Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ahuja, R.K., Orlin, J.B., Pallotino, S., Scutella, M.G.: Dynamic shortest path minimizing travel times and costs. Networks 41(4), 197–205 (2003)
Bellman, R.E.: On a Routing Problem. Journal Quarterly of Applied Mathematics 16, 87–90 (1958)
Chabini, I.: Discrete dynamic shortest path problems in transportation applications. Complexity and algorithms with optimal run time, Journal Transportation Research Records, 170–175 (1998)
Cooke, K.L., Halsey, E.: The shortest route through a network with time-dependent intermodal transit times. Journal Math. Anal. Appl. 14, 493–498 (1998)
Dreyfus, S.E.: An Appraisal of Some Shortest-path Algorithms. Journal Operations Research 17, 395–412 (1969)
Galves-Fernandez C. Khadraoui D. and remainder: Distribited Aproach for Solving Time-Dependent Problems in Multimodal Transport Networks. In: Advanced in Operation Research, (2009)
Goldberg, D.E.: Genetic algorithms and their applications. WNT, Warsaw (1995)
Hansen, P.: Bicriterion path problems. In: Multicriteria Decision Making: Theory and Applications. Lecture Notes in Economics and Mathematical Systems, vol. 177, pp. 236–245 (1980)
Koszelew, J.: Approximation method to route generation in public transportation network. Polish Journal of Enviromental Studies 17, 418–422 (2008)
Piwonska, A., Koszelew, J.: Evolutionary algorithms find routes in public transport network with optimal time of realization. In: Mikulski, J. (ed.) TST 2010. CCIS, vol. 104, pp. 194–201. Springer, Heidelberg (2010)
Lawler, E.L.: A procedure for computing the K best solutions to discrete optimization problems and its application to the shortest path problem. Management Science 18, 401–405 (1972)
Orda, A., Rom, R.: Shortest path and minimum - delay algorithms in networks with time-dependent edge-length. Journal Assoc. Computer Mach. 37(3), 607–625 (1990)
Reyes, L.C., Zezzatti, C.A.O.O., Santillán, C.G., Hernández, P.H., Fuerte, M.V.: A Cultural Algorithm for the Urban Public Transportation. In: Corchado, E., Graña Romay, M., Manhaes Savio, A. (eds.) HAIS 2010. LNCS (LNAI), vol. 6077, pp. 135–142. Springer, Heidelberg (2010)
Zhang, Y., Shiying, C., Jinfeng, L., Fu, D.: The Application of Genetic Algorithm in Vehicle Routing Problem. In: Electronic Commerce and Security, International Symposium, International Symposium on Electronic Commerce and Security, pp. 3–6 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Koszelew, J. (2011). An Evolutionary Algorithm for the Urban Public Transportation. In: Jędrzejowicz, P., Nguyen, N.T., Hoang, K. (eds) Computational Collective Intelligence. Technologies and Applications. ICCCI 2011. Lecture Notes in Computer Science(), vol 6922. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23935-9_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-23935-9_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23934-2
Online ISBN: 978-3-642-23935-9
eBook Packages: Computer ScienceComputer Science (R0)