Abstract
In this paper, we introduce our implementation of the Plateau algorithm, which is an extension of the basic Dijsktra algorithm for finding the n shortest paths in a graph. The algorithm can be used to divide the traffic flow in a city by implementing a routing pipeline which takes into account a global view of the traffic network. We describe the heuristic extensions we implemented in the algorithm to optimize its run time, including computational experiments and its integration into a routing pipeline.
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
References
Bast H, Delling D, Goldberg A, Müller-Hannemann M, Pajor T, Sanders P, Wagner D, Werneck RF (2016) Route planning in transportation networks, pp 19–80. Springer International Publishing, Cham. https://doi.org/10.1007/978-3-319-49487-6_2
Chondrogiannis T, Bouros P, Gamper J, Leser U (2017) Exact and approximate algorithms for finding k-shortest paths with limited overlap. Int Conf Extend Database Technol 414–425. https://doi.org/10.5441/002/edbt.2017.37
Feng L, Lv Z, Guo G, Song H (2016) Pheromone based alternative route planning. Digital Commun Netw 2(3):151–158
Golasowski M, Beránek J, Šurkovský M, Rapant L, Szturcová D, Martinovič J, Slaninová K (2020) Alternative paths reordering using probabilistic time-dependent routing. Adv Intell Syst Comput 1036:235–246. https://doi.org/10.1007/978-3-030-29029-0_22
IT4Innovations: IT4Innovations Documentation (2020). Accessed 3 November 2020. https://docs.it4i.cz
Lampinen J, Zelinka I (1999) Mixed integer-discrete-continuous optimization by differential evolution. In: Proceedings of the 5th international conference on soft computing, pp. 71–76
Martinovič J, Golasowski M, Slaninová K, Beránek J, Šurkovský M, Rapant L, Szturcová D, Cmar R (2020) A distributed environment for traffic navigation systems. Adv Intell Syst Comput 993:294–304. https://doi.org/10.1007/978-3-030-22354-0_27
Paraskevopoulos A, Zaroliagis C (2013) Improved alternative route planning. In: Frigioni D, Stiller S (eds) ATMOS—13th workshop on algorithmic approaches for transportation modelling, optimization, and systems—2013. OpenAccess Series in Informatics (OASIcs), vol 33, pp 108–122. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Sophia Antipolis, France (Sep 2013). https://doi.org/10.4230/OASIcs.ATMOS.2013.108. https://hal.inria.fr/hal-00871739
Rapant L, Golasowski M, Martinovič J, Slaninová K (2018) Simulated probabilistic speed profiles for selected routes in Prague
Tomis R, Rapant L, Martinovič J, Slaninová K, Vondrák I (2015) Probabilistic time-dependent travel time computation using monte carlo simulation. In: International conference on high performance computing in science and engineering, pp 161–170. Springer
Vitali E, Gadioli D, Palermo G, Golasowski M, Bispo J, Pinto P, Martinovic J, Slaninova K, Cardoso J, SILVANO C (2019) An efficient monte carlo-based probabilistic time-dependent routing calculation targeting a server-side car navigation system. IEEE Trans Emerg Topics Comput (IF=4.989, Q1). https://doi.org/10.1109/TETC.2019.2919801
Vojtek D, Rapant L, Golasowski M, Ševčík J, Ptošek V, Slaninová K, Martinovič J (2018) Traffic network routing index for the Czech Republic. https://doi.org/10.5281/zenodo.2275557
Acknowledgements
This work was supported by The Ministry of Education, Youth and Sports from the National Programme of Sustainability (NPS II) project “IT4Innovations excellence in science—LQ1602”, by the IT4Innovations infrastructure which is supported from the Large Infrastructures for Research, Experimental Development and Innovations project “IT4Innovations National Supercomputing Center—LM2015070”, and partially supported by the SGC grant No. SP2020/167 “Extension of HPC platforms for executing scientific pipelines 2”, VSB - Technical University of Ostrava, Czech Republic.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this chapter
Cite this chapter
Faltýnek, J., Golasowski, M., Slaninová, K., Martinovič, J. (2022). Shortest n-paths Algorithm for Traffic Optimization. In: Chaki, R., Chaki, N., Cortesi, A., Saeed, K. (eds) Advanced Computing and Systems for Security: Volume 13. Lecture Notes in Networks and Systems, vol 241. Springer, Singapore. https://doi.org/10.1007/978-981-16-4287-6_12
Download citation
DOI: https://doi.org/10.1007/978-981-16-4287-6_12
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-16-4286-9
Online ISBN: 978-981-16-4287-6
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)