Combined Simulated Annealing and Genetic Algorithm Approach to Bus Network Design

被引:0
作者
Liu, Li [1 ]
Olszewski, Piotr [2 ]
Goh, Pong-Chai [3 ]
机构
[1] Shanghai Tat Hong Equipment Co, Beijing, Peoples R China
[2] Warsaw Univ Technol, PL-00661 Warsaw, Poland
[3] Nanyang Technol Univ, Singapore 639798, Singapore
来源
TRANSPORT SYSTEM TELEMATICS | 2010年 / 104卷
关键词
Bus network design; optimization; genetic algorithm; simulated annealing; OPTIMIZATION;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A new method - combined simulated annealing (SA) and genetic algorithm (GA) approach is proposed to solve the problem of bus route design and frequency setting for a given road network with fixed bus stop locations and fixed travel demand. The method involves two steps: a set of candidate routes is generated first and then the best subset of these routes is selected by the combined SA and GA procedure. SA is the main process to search for a better solution to minimize the total system cost, comprising user and operator costs. GA is used as a sub-process to generate new solutions. Bus demand assignment on two alternative paths is performed at the solution evaluation stage. The method was implemented on four theoretical grid networks of different size and a benchmark network. Several GA operators (crossover and mutation) were utilized and tested for their effectiveness. The results show that the proposed method can efficiently converge to the optimal solution on a small network but computation time increases significantly with network size. The method can also be used for other transport operation management problems.
引用
收藏
页码:335 / +
页数:2
相关论文
共 18 条
[1]  
APTA, 2009 PUBL TRANSP FAC
[2]   HYBRID ROUTE GENERATION HEURISTIC ALGORITHM FOR THE DESIGN OF TRANSIT NETWORKS [J].
BAAJ, MH ;
MAHMASSANI, HS .
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 1995, 3 (01) :31-50
[3]   BUS NETWORK DESIGN [J].
CEDER, A ;
WILSON, NHM .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1986, 20 (04) :331-344
[4]   Genetic algorithm approach for transit route planning and design [J].
Chien, S ;
Yan, ZW ;
Hou, E .
JOURNAL OF TRANSPORTATION ENGINEERING-ASCE, 2001, 127 (03) :200-207
[5]  
Cormen T., 2001, Introduction to Algorithms
[6]   A SIMULATED ANNEALING APPROACH TO THE NETWORK DESIGN PROBLEM WITH VARIATIONAL INEQUALITY CONSTRAINTS [J].
FRIESZ, TL ;
CHO, HJ ;
MEHTA, NJ ;
TOBIN, RL ;
ANANDALINGAM, G .
TRANSPORTATION SCIENCE, 1992, 26 (01) :18-26
[7]  
Golberg D. E., 1989, GENETIC ALGORITHMS S, V1989, P36
[8]  
HERSHBERGER J, 2003, FINDING K SHORTEST S
[9]  
Krishna Rao K.V., 1998, P K MIN FOR MIN FORS, P91
[10]   OPTIMIZATION OF FEEDER BUS ROUTES AND BUS-STOP SPACING [J].
KUAH, GK ;
PERL, J .
JOURNAL OF TRANSPORTATION ENGINEERING-ASCE, 1988, 114 (03) :341-354