An Evolutionary Algorithm for the Urban Public Transportation

A public transport route planner provides for citizens and tourists information about available public transport journeys. The heart of such systems are effective methods for solving itinerary planning problem in a multi-modal urban public transportation networks. This paper describes a new evolutionary algorithm solving a certain version of this problem. The method returns the set of k-journeys that lexicographically optimize two criteria's: total travel time and number of transfers. Proposed algorithm was compared with two another solutions for itinerary planning problem. This comparison is prepared on the base of experimental results which were performed on real-life data - Warsaw city public transport network. Conducted experiments confirm high effectiveness of the proposed method in comparison with two another known solutions for considered problem.

[1]  Pierre Hansen,et al.  Bicriterion Path Problems , 1980 .

[2]  Maria Grazia Scutellà,et al.  Dynamic shortest paths minimizing travel times and costs , 2001, Networks.

[3]  Sam Kwong,et al.  Genetic algorithms and their applications , 1996, IEEE Signal Process. Mag..

[4]  E. Lawler.  A PROCEDURE FOR COMPUTING THE K BEST SOLUTIONS TO DISCRETE OPTIMIZATION PROBLEMS AND ITS APPLICATION TO THE SHORTEST PATH PROBLEM , 1972 .

[5]  Jerzy Mikulski.  Transport Systems Telematics - 10th Conference, TST 2010, Katowice - Ustron, Poland, October 20-23, 2010. Selected Papers , 2011, TST.

[6]  Ariel Orda,et al.  Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length , 1990, JACM.

[7]  Jolanta Koszelew,et al.  Evolutionary Algorithms Find Routes in Public Transport Network with Optimal Time of Realization , 2010, TST.

[8]  Richard Bellman,et al.  ON A ROUTING PROBLEM , 1958 .

[9]  Carlos Alberto Ochoa Ortíz Zezzatti,et al.  A Cultural Algorithm for the Urban Public Transportation , 2010, HAIS.

[10]  Enrique Alba,et al.  Distributed Approach for Solving Time-Dependent Problems in Multimodal Transport Networks , 2009, Adv. Oper. Res..

[11]  K. Cooke,et al.  The shortest route through a network with time-dependent internodal transit times , 1966 .

[12]  Ismail Chabini,et al.  Discrete Dynamic Shortest Path Problems in Transportation Applications: Complexity and Algorithms with Optimal Run Time , 1998 .

[13]  Stuart E. Dreyfus,et al.  An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..

[14]  Yueqin Zhang,et al.  The Application of Genetic Algorithm in Vehicle Routing Problem , 2008, 2008 International Symposium on Electronic Commerce and Security.