A simple multi-objective optimization algorithm for the urban transit routing problem

The urban transit routing problem (UTRP) for public transport systems involves finding a set of efficient transit routes to meet customer demands. The UTRP is an NP-Hard, highly constrained, multi-objective problem, for which the evaluation of candidate route sets can prove both time consuming and challenging, with many potential solutions rejected on the grounds of infeasibility. In this paper we propose a simple evolutionary multi-objective optimization technique to solve the UTRP. First we present a representation of the UTRP and introduce our two key objectives, which are to minimise both passenger costs and operator costs. Following this, we describe a simple multi-objective optimization algorithm for the UTRP then present experimental results obtained using the Mandl's benchmark data and a larger transport network.

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

[2]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

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

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

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

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

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

[8]  Christine L. Mumford,et al.  A metaheuristic approach to the urban transit routing problem , 2010, J. Heuristics.

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

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

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

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

[13]  C. L. Valenzuela.  A simple evolutionary algorithm for multi-objective optimization (SEAMO) , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[14]  A. Ceder,et al.  Designing transit routes at the network level , 1989, Conference Record of papers presented at the First Vehicle Navigation and Information Systems Conference (VNIS '89).

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

[16]  Albert Gan,et al.  Transit network optimization : Minimizing transfers and maximizing service coverage with an integrated simulated annealing and tabu search method , 2005 .

[17]  Christine L. Mumford.  Simple Population Replacement Strategies for a Steady-State Multi-objective Evolutionary Algorithm , 2004, GECCO.

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

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

[20]  Partha Chakroborty,et al.  Genetic Algorithms for Optimal Urban Transit Network Design , 2003 .