Abstract
This paper presents a new memetic algorithm, which solves bi-criteria version of Routing Problem in Urban Public Transportation Networks. Our solution returns a set of routes, containing at most k quasi-optimal paths with the earliest arrival in the first instance and with minimal number of transfers in the second. The method was implemented and tested on the real-life public transportation network of Warsaw city in Poland. This network was completed with walk links and therefore resultant routes are more practical. Effectiveness of the described solution was compared in two aspects: time complexity and quality of results, with another three algorithms for considered problem. Computational experiments clearly show the memetic algorithm be highly competitive with comparable ones, yielding new improved solutions in the most cases of tested source/destination specifications.
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)
Boryczka, U., Boryczka, M.: Multi-cast ant colony system for the bus routing problem. Applied Optimization 86, 91–125 (2004)
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 (1996)
Dawkins, R.: The Selfish Gene. Clarendon Press, Oxford (1976)
Dreyfus, S.E.: An Appraisal of Some Shortest-path Algorithms. Journal Operations Research 17, 395–412 (1969)
Galves-Fernandez, C., Khadraoui, D.: Remainder: Distribited Aproach for Solving Time-Dependent Problems in Multimodal Transport Networks. Advanced in Operation Research (2009); doi:10.1016/j.cie.2010.05.018
Chi-Keong, G., Yew-Soon, O., Kay Chen, T.: Multi-Objective Memetic Algorithms. SCI, vol. 171. Springer, Heidelberg (2007)
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(4C), 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)
Pyrga, E., Schultz, F., Wagner, D., Zaroliagis, C.D.: Efficient models for timetable inforamtion in public transformation systems. Journal of Experimental Algorithms 12 (2007)
Reyes, L.C., Ochoa, C.A., Santilln, C.G., Hernndez, P., 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)
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., Ostrowski, K. (2011). A Memetic Algorithm for Routing in Urban Public Transportation Networks. In: Bouchachia, A. (eds) Adaptive and Intelligent Systems. ICAIS 2011. Lecture Notes in Computer Science(), vol 6943. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23857-4_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-23857-4_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23856-7
Online ISBN: 978-3-642-23857-4
eBook Packages: Computer ScienceComputer Science (R0)