Document Open Access Logo

Faster Transit Routing by Hyper Partitioning

Authors Daniel Delling, Julian Dibbelt, Thomas Pajor, Tobias Zündorf

PDF
Thumbnail PDF

File

OASIcs.ATMOS.2017.8.pdf
  • Filesize: 2.09 MB
  • 14 pages

Document Identifiers

Author Details

Daniel Delling
Julian Dibbelt
Thomas Pajor
Tobias Zündorf

Cite As Get BibTex

Daniel Delling, Julian Dibbelt, Thomas Pajor, and Tobias Zündorf. Faster Transit Routing by Hyper Partitioning. In 17th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2017). Open Access Series in Informatics (OASIcs), Volume 59, pp. 8:1-8:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017) https://doi.org/10.4230/OASIcs.ATMOS.2017.8

Abstract

We present a preprocessing-based acceleration technique for computing bi-criteria Pareto-optimal journeys in public transit networks, based on the well-known RAPTOR algorithm [Delling et al 2015]. Our key idea is to first partition a hypergraph into cells, in which vertices correspond to routes (e.g., bus lines) and hyperedges to stops, and to then mark routes sufficient for optimal travel across cells. The query can then be restricted to marked routes and those in the source and target cells. This results in a practical approach, suitable for networks that are too large to be efficiently handled by the basic RAPTOR algorithm.

Subject Classification

Keywords
  • Routing
  • speed-up techniques
  • public transport
  • partitioning

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. Ittai Abraham, Daniel Delling, Andrew V. Goldberg, and Renato F. Werneck. Hierarchical hub labelings for shortest paths. In Leah Epstein and Paolo Ferragina, editors, Proceedings of the 20th Annual European Symposium on Algorithms (ESA'12), volume 7501 of Lecture Notes in Computer Science, pages 24-35. Springer, 2012. Google Scholar
  2. Hannah Bast, Erik Carlsson, Arno Eigenwillig, Robert Geisberger, Chris Harrelson, Veselin Raychev, and Fabien Viger. Fast routing in very large public transportation networks using transfer patterns. In Proceedings of the 18th Annual European Symposium on Algorithms (ESA'10), volume 6346 of Lecture Notes in Computer Science, pages 290-301. Springer, 2010. Google Scholar
  3. Hannah Bast, Daniel Delling, Andrew V. Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, and Renato F. Werneck. Route planning in transportation networks. In Algorithm Engineering - Selected Results and Surveys, volume 9220 of Lecture Notes in Computer Science, pages 19-80. Springer, 2016. Google Scholar
  4. Hannah Bast, Matthias Hertel, and Sabine Storandt. Scalable transfer patterns. In Proceedings of the 18th Meeting on Algorithm Engineering and Experiments (ALENEX'16), pages 15-29. SIAM, 2016. Google Scholar
  5. Hannah Bast, Jonas Sternisko, and Sabine Storandt. Delay-robustness of transfer patterns in public transportation route planning. In Proceedings of the 13th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'13), volume 33 of OpenAccess Series in Informatics (OASIcs), pages 42-54. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. URL: http://dx.doi.org/10.4230/OASIcs.ATMOS.2013.42.
  6. Reinhard Bauer, Daniel Delling, Peter Sanders, Dennis Schieferdecker, Dominik Schultes, and Dorothea Wagner. Combining hierarchical and goal-directed speed-up techniques for Dijkstra’s algorithm. ACM Journal of Experimental Algorithmics, 15(2.3):1-31, January 2010. Special Section devoted to WEA'08. Google Scholar
  7. Reinhard Bauer, Daniel Delling, and Dorothea Wagner. Experimental study on speed-up techniques for timetable information systems. Networks, 57(1):38-52, January 2011. Google Scholar
  8. Annabell Berger, Daniel Delling, Andreas Gebhardt, and Matthias Müller-Hannemann. Accelerating Time-Dependent Multi-Criteria Timetable Information is Harder Than Expected. In Proceedings of the 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'09), volume 12 of OpenAccess Series in Informatics (OASIcs). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2009. URL: http://dx.doi.org/10.4230/OASIcs.ATMOS.2009.2148.
  9. Annabell Berger, Martin Grimmer, and Matthias Müller-Hannemann. Fully dynamic speed-up techniques for multi-criteria shortest path searches in time-dependent networks. In Paola Festa, editor, Proceedings of the 9th International Symposium on Experimental Algorithms (SEA'10), volume 6049 of Lecture Notes in Computer Science, pages 35-46. Springer, May 2010. Google Scholar
  10. Alessio Cionini, Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Kalliopi Giannakopoulou, Andreas Paraskevopoulos, and Christos Zaroliagis. Engineering graph-based models for dynamic timetable information systems. In Stefan Funke and Matúš Mihalák, editors, Proceedings of the 14th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'14), volume 42 of OpenAccess Series in Informatics (OASIcs), pages 46-61. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014. URL: http://dx.doi.org/10.4230/OASIcs.ATMOS.2014.46.
  11. Daniel Delling, Julian Dibbelt, Thomas Pajor, Dorothea Wagner, and Renato F. Werneck. Computing multimodal journeys in practice. In Proceedings of the 12th International Symposium on Experimental Algorithms (SEA'13), volume 7933 of Lecture Notes in Computer Science, pages 260-271. Springer, 2013. Google Scholar
  12. Daniel Delling, Julian Dibbelt, Thomas Pajor, and Renato F. Werneck. Public transit labeling. In Proceedings of the 14th International Symposium on Experimental Algorithms (SEA'15), Lecture Notes in Computer Science, pages 273-285. Springer, 2015. URL: http://dx.doi.org/10.1007/978-3-319-20086-6_21.
  13. Daniel Delling, Kalliopi Giannakopoulou, Dorothea Wagner, and Christos Zaroliagis. Contracting timetable information networks. Technical Report 144, Arrival Technical Report, 2008. Google Scholar
  14. Daniel Delling, Andrew V. Goldberg, Thomas Pajor, and Renato F. Werneck. Customizable route planning in road networks. Transportation Science, 51(2):566-591, 2017. URL: http://dx.doi.org/10.1287/trsc.2014.0579.
  15. Daniel Delling, Martin Holzer, Kirill Müller, Frank Schulz, and Dorothea Wagner. High-performance multi-level routing. In Camil Demetrescu, Andrew V. Goldberg, and David S. Johnson, editors, The Shortest Path Problem: Ninth DIMACS Implementation Challenge, volume 74 of DIMACS Book, pages 73-92. American Mathematical Society, 2009. Google Scholar
  16. Daniel Delling, Thomas Pajor, and Renato F. Werneck. Round-based public transit routing. Transportation Science, 49(3):591-604, 2015. URL: http://dx.doi.org/10.1287/trsc.2014.0534.
  17. Camil Demetrescu, Andrew V. Goldberg, and David S. Johnson, editors. The Shortest Path Problem: Ninth DIMACS Implementation Challenge, volume 74 of DIMACS Book. American Mathematical Society, 2009. Google Scholar
  18. Julian Dibbelt, Thomas Pajor, Ben Strasser, and Dorothea Wagner. Intriguingly simple and fast transit routing. In Proceedings of the 12th International Symposium on Experimental Algorithms (SEA'13), volume 7933 of Lecture Notes in Computer Science, pages 43-54. Springer, 2013. Google Scholar
  19. Julian Dibbelt, Ben Strasser, and Dorothea Wagner. Customizable contraction hierarchies. ACM Journal of Experimental Algorithmics, 21(1):1.5:1-1.5:49, April 2016. URL: http://dx.doi.org/10.1145/2886843.
  20. Yann Disser, Matthias Müller-Hannemann, and Mathias Schnee. Multi-criteria shortest paths in time-dependent train networks. In Catherine C. McGeoch, editor, Proceedings of the 7th Workshop on Experimental Algorithms (WEA'08), volume 5038 of Lecture Notes in Computer Science, pages 347-361. Springer, June 2008. Google Scholar
  21. Michael R. Garey and David S. Johnson. Computers and Intractability. A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979. Google Scholar
  22. Robert Geisberger. Contraction of timetable networks with realistic transfers. In Paola Festa, editor, Proceedings of the 9th International Symposium on Experimental Algorithms (SEA'10), volume 6049 of Lecture Notes in Computer Science, pages 71-82. Springer, May 2010. Google Scholar
  23. Martin Holzer, Frank Schulz, and Dorothea Wagner. Engineering multilevel overlay graphs for shortest-path queries. ACM Journal of Experimental Algorithmics, 13(2.5):1-26, December 2008. Google Scholar
  24. Sungwon Jung and Sakti Pramanik. An efficient path computation model for hierarchically structured topographical road maps. IEEE Transactions on Knowledge and Data Engineering, 14(5):1029-1046, September 2002. Google Scholar
  25. George Karypis. METIS - Family of Multilevel Partitioning Algorithms, 2007. URL: http://glaros.dtc.umn.edu/gkhome/views/metis.
  26. Matthias Müller-Hannemann and Mathias Schnee. Finding all attractive train connections by multi-criteria Pareto search. In Algorithmic Methods for Railway Optimization, volume 4359 of Lecture Notes in Computer Science, pages 246-263. Springer, 2007. Google Scholar
  27. Matthias Müller-Hannemann, Frank Schulz, Dorothea Wagner, and Christos Zaroliagis. Timetable information: Models and algorithms. In Algorithmic Methods for Railway Optimization, volume 4359 of Lecture Notes in Computer Science, pages 67-90. Springer, 2007. Google Scholar
  28. Matthias Müller-Hannemann and Karsten Weihe. Pareto shortest paths is often feasible in practice. In Proceedings of the 5th International Workshop on Algorithm Engineering (WAE'01), volume 2141 of Lecture Notes in Computer Science, pages 185-197. Springer, 2001. Google Scholar
  29. Evangelia Pyrga, Frank Schulz, Dorothea Wagner, and Christos Zaroliagis. Efficient models for timetable information in public transportation systems. ACM Journal of Experimental Algorithmics, 12(2.4):1-39, 2008. Google Scholar
  30. Frank Schulz, Dorothea Wagner, and Karsten Weihe. Dijkstra’s algorithm on-line: An empirical case study from public railroad transport. ACM Journal of Experimental Algorithmics, 5(12):1-23, 2000. Google Scholar
  31. Frank Schulz, Dorothea Wagner, and Christos Zaroliagis. Using multi-level graphs for timetable information in railway systems. In Proceedings of the 4th Workshop on Algorithm Engineering and Experiments (ALENEX'02), volume 2409 of Lecture Notes in Computer Science, pages 43-59. Springer, 2002. Google Scholar
  32. Ben Strasser and Dorothea Wagner. Connection scan accelerated. In Catherine C. McGeoch and Ulrich Meyer, editors, Proceedings of the 16th Meeting on Algorithm Engineering and Experiments (ALENEX'14), pages 125-137. SIAM, 2014. Google Scholar
  33. Sibo Wang, Wenqing Lin, Yi Yang, Xiaokui Xiao, and Shuigeng Zhou. Efficient route planning on public transportation networks: A labelling approach. In Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data (SIGMOD'15), pages 967-982. ACM Press, 2015. URL: http://dx.doi.org/10.1145/2723372.2749456.
  34. Alexander Wirth. Algorithms for contraction hierarchies on public transit networks. Master’s thesis, Karlsruhe Institute of Technology, 2015. Google Scholar
  35. Sascha Witt. Trip-based public transit routing. In Proceedings of the 23rd Annual European Symposium on Algorithms (ESA'15), Lecture Notes in Computer Science, pages 1025-1036. Springer, 2015. Accepted for publication. Google Scholar
  36. Sascha Witt. Trip-based public transit routing using condensed search trees. In Marc Goerigk and Renato F. Werneck, editors, Proceedings of the 16th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'16), volume 54 of OpenAccess Series in Informatics (OASIcs), pages 10:1-10:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, August 2016. URL: https://arxiv.org/abs/1607.01299, URL: http://dx.doi.org/10.4230/OASIcs.ATMOS.2016.10.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact