论文信息 - Hybrid Algorithm for Line Planning Problem

Hybrid Algorithm for Line Planning Problem

The line planning problem belongs to the area of the public transportation strategic planning. In this paper, we propose a new hybrid algorithm dealing with this problem. Its performance is verified against a simulated annealing algorithm and random search. The obtained results are promising, the hybrid algorithm has produced good solutions in almost all of tested scenarios.

[1] Anita Schöbel,et al. Line Planning with Minimal Traveling Time , 2005, ATMOS.

[2] Leszek Koszalka,et al. Comparison of Allocation Algorithms for Mesh Structured Networks with Using Multistage Simulation , 2006, ICCSA.

[3] Leszek Koszalka,et al. Efficiency Analysis of Evolutionary Algorithm for Congestion Problem Using Computer Experimentation System , 2009, 2009 Eighth International Conference on Networks.

[4] Enrique Carlos Segura,et al. Evolutionary Computation with Simulated Annealing: Conditions for Optimal Equilibrium Distribution , 2005 .

[5] Martin Grötschel,et al. A Column-Generation Approach to Line Planning in Public Transport , 2007, Transp. Sci..

[6] Keith J. Burnham,et al. An Experimentation System for Testing Bee Behavior Based Algorithm to Solving a Transportation Problem , 2011, ACIIDS.

[7] Ralf Borndörfer,et al. Discrete Optimization in Public Transportation , 2009 .