An Improved Multi-objective Algorithm for the Urban Transit Routing Problem

The determination of efficient routes and schedules in public transport systems is complex due to the vast search space and multiple constraints involved. In this paper we focus on the Urban Transit Routing Problem concerned with the physical network design of public transport systems. Historically, route planners have used their local knowledge coupled with simple guidelines to produce network designs. Several major studies have identified the need for automated tools to aid in the design and evaluation of public transport networks. We propose a new construction heuristic used to seed a multi-objective evolutionary algorithm. Several problem specific mutation operators are then combined with an NSGAII framework leading to improvements upon previously published results.

[1]  G. Croes.  A Method for Solving Traveling-Salesman Problems , 1958 .

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

[3]  Christine L. Mumford,et al.  New heuristic and evolutionary operators for the multi-objective urban transit routing problem , 2013, 2013 IEEE Congress on Evolutionary Computation.

[4]  Randy B Machemehl,et al.  Optimal Transit Route Network Design Problem with Variable Transit Demand: Genetic Algorithm Approach , 2006 .

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

[6]  Tom V. Mathew,et al.  Transit route network design using parallel genetic algorithm , 2004 .

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

[8]  L. A. Silman,et al.  Planning the route system for urban buses , 1974, Comput. Oper. Res..

[9]  Christine L. Mumford,et al.  A simple multi-objective optimization algorithm for the urban transit routing problem , 2009, 2009 IEEE Congress on Evolutionary Computation.

[10]  S. Mohan,et al.  TRANSIT ROUTE NETWORK DESIGN USING FREQUENCY CODED GENETIC ALGORITHM , 2003 .

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

[12]  Randy B Machemehl,et al.  Using a Simulated Annealing Algorithm to Solve the Transit Route Network Design Problem , 2006 .

[13]  Randy B Machemehl,et al.  A Tabu Search Based Heuristic Method for the Transit Route Network Design Problem , 2008 .

[14]  Avishai Ceder,et al.  Transit-network design methodology for actual-size road networks , 2011 .

[15]  Thomas L. Magnanti,et al.  Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..

[16]  Fang Zhao,et al.  OPTIMIZATION OF TRANSIT NETWORK TO MINIMIZE TRANSFERS , 2003 .

[17]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[18]  Nigel H. M. Wilson,et al.  Bus network design , 1986 .

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

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

[21]  H. S. Mahmassani,et al.  Design methodology for bus transit networks with coordinated operations. Research report , 1994 .

[22]  J. Y. Yen,et al.  Finding the K Shortest Loopless Paths in a Network , 2007 .

[23]  Christoph E. Mandl,et al.  Applied Network Optimization , 1980 .