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. © 2011 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Koszelew, J. (2011). An evolutionary algorithm for the urban public transportation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6922 LNAI, pp. 234–243). https://doi.org/10.1007/978-3-642-23935-9_23
Mendeley helps you to discover research relevant for your work.