A Memetic Algorithm for Optimization of Urban Transit Route Network
this paper presents a memetic algorithm for optimization of urban transit route network. The objective of this research is to minimize the users cost and the unsatisfied user demand. The local search operator of the memetic algorithm combines three types of moves: 2-opt moves, exchange of two stops and relocation of one stop. The move of the most direct travel passengers increased in terms of the operation time of routes is chosen as a local search to improve the convergence of the algorithm. The algorithm has been tested with problems reported in the existing literature, and the results show that the algorithm could improve the solution to the transit route network optimization problem in acceptable time and reasonable computing resources.
Transit route network Route optimization Memetic algorithm Local Search Operator
Zhao Hang Xie Binglei An Shi
The Research Center of Traffic Engineering Harbin institute of Technology Shenzhen Graduate School S School of Transportation Science and Engineering Harbin Institute of Technology Harbin, China
国际会议
2011 Seventh International Conference on Natural Computation(第七届自然计算国际会议 ICNC 2011)
上海
英文
1925-1929
2011-07-26(万方平台首次上网日期,不代表论文的发表时间)