Abstract
This paper presents a new evolutionary algorithm with a special geographic heuristics, which solves bi-criteria version of Routing Problem in Urban Public Transportation Networks often called Bus Routing Problem (BRP). 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. Effective algorithms for BRP are the heart of public transport routes planners. Proposed algorithm was compared with three 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 comparable 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)
Boryczka, U., Boryczka, M.: Multi-cast ant colony system for the bus routing problem. Metaheuristics, 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)
Chakroborty, P.: Genetic algorithms for optimal urban transit network design. In: Computer-Aided Civil and Infastructure Engineering, vol. 18, pp. 184–200 (2003)
Chen, H.K., Feng, G.: Heuristics for the dynamic user-optimal route choice problem. European Journal of Operational Research 126, 13–30 (2000)
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.: remainder: Distribited Aproach for Solving Time-Dependent Problems in Multimodal Transport Networks. Advanced in Operation Research, Article ID 512613, 15 pages (2009), doi:10.1155/2009/512613
Goldberg, D.E.: Genetic algorithms and their applications. WNT, Warsaw (1995)
Hartley, J.K., Wu, Q.: Accommodating User Preferences in the Optimization of Public Transport Travel. International Journal of Simulation Systems, Science and Technology: Applied Modeling and Simulation, 12–25 (2004)
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)
Koszelew, J.: An Evolutionary Algorithm for the Urban Public Transportation. In: Jędrzejowicz, P., Nguyen, N.T., Hoang, K. (eds.) ICCCI 2011, Part I. LNCS, vol. 6922, pp. 234–243. Springer, Heidelberg (2011)
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)
Pattnaik, S.B., Mohan, S., Tom, V.M.: Urban bus transit route network design using genetic algorithm. Journal of Transportation Engineering 124, 124–368 (1998)
Pyrga, E., Schultz, F., Wagner, D., Zaroliagis, C.D.: Efficient models for timetable inforamtion in public transformation systems. Journal of Experimental Algorithms 12, Article No. 2.4 (2008)
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, Part II. LNCS, vol. 6077, pp. 135–142. Springer, Heidelberg (2010)
Wellman, M.P., Ford, M., Larson, K.: Path planning under time-dependent uncertainty. In: Proceedings of the Eleventh Conference on Uncertainty in Artificial Intelligence, pp. 532–539 (1995)
Zhang, Y.: Shiying Ch., 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
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Koszelew, J., Ostrowski, K. (2013). Evolutionary Algorithm with Geographic Heuristics for Urban Public Transportation. In: Nguyen, N.T. (eds) Transactions on Computational Collective Intelligence XII. Lecture Notes in Computer Science, vol 8240. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-53878-0_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-53878-0_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-53877-3
Online ISBN: 978-3-642-53878-0
eBook Packages: Computer ScienceComputer Science (R0)