Simulated Annealing-Genetic Algorithm for Transit Network Optimization

This paper presents a mathematical stochastic methodology for transit route network optimization. The goal is to provide an effective computational tool for the optimization of a large-scale transit route network to minimize transfers with reasonable route directness while maximizing service coverage. The methodology includes representation of transit route network solution search spaces, representation of transit route and network constraints, and a stochastic search scheme based on an integrated simulated annealing and genetic algorithm solution search method. The methodology has been implemented as a computer program, tested using previously published results, and applied to a large-scale realistic network optimization problem.

[1]  Dimitri P. Bertsekas,et al.  Network optimization : continuous and discrete models , 1998 .

[2]  David J. Lovell,et al.  Optimal Time Transfer in Bus Transit Route Network Design using a Genetic Algorithm , 2003 .

[3]  Gilbert Laporte,et al.  Metaheuristics: A bibliography , 1996, Ann. Oper. Res..

[4]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5]  M-C Shih,et al.  A DESIGN METHODOLOGY FOR BUS TRANSIT NETWORKS WITH COORDINATED OPERATIONS , 1994 .

[6]  Rob van Nes,et al.  DESIGN OF PUBLIC TRANSPORT NETWORKS , 1988 .

[7]  S. B. Pattnaik,et al.  Urban Bus Transit Route Network Design Using Genetic Algorithm , 1998 .

[8]  W. Lampkin,et al.  The Design of Routes, Service Frequencies, and Schedules for a Municipal Bus Undertaking: A Case Study , 1967 .

[9]  Douglas R. Shier,et al.  On algorithms for finding the k shortest paths in a network , 1979, Networks.

[10]  Lazar N Spasovic,et al.  Optimization of Bus Route Planning in Urban Commuter Networks , 2003 .

[11]  J. K. Lenstra,et al.  Local Search in Combinatorial Optimisation. , 1997 .

[12]  Christoph E. Mandl,et al.  Evaluation and optimization of urban public transportation networks , 1980 .

[13]  Bennett L. Fox,et al.  Integrating and accelerating tabu search, simulated annealing, and genetic algorithms , 1993, Ann. Oper. Res..

[14]  Bruce E. Hajek,et al.  Cooling Schedules for Optimal Annealing , 1988, Math. Oper. Res..

[15]  D. F. Dubois,et al.  A Set of Methods in Transportation Network Synthesis and Analysis , 1979 .

[16]  P. Chakroborty,et al.  Optimal Route Network Design for Transit Systems Using Genetic Algorithms , 2002 .

[17]  Hani S. Mahmassani,et al.  AN AI-BASED APPROACH FOR TRANSIT ROUTE SYSTEM PLANNING AND DESIGN , 1991 .

[18]  Maurizio Bielli,et al.  Genetic algorithms in bus network optimization , 2002 .

[19]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[20]  Hani S. Mahmassani,et al.  Hybrid route generation heuristic algorithm for the design of transit networks , 1995 .

[21]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[22]  Fang Zhao,et al.  Transit Network Optimization - Minimizing Transfers and Optimizing Route Directness , 2004 .

[23]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[24]  G. Nemhauser,et al.  Integer Programming , 2020 .

[25]  Richard Stern.  Passenger Transfer System Review , 1996 .