ULTRA: Unlimited Transfers for Efficient Multimodal Journey Planning

References

• Abraham I, Delling D, Goldberg AV, Werneck RF (2011) A hub-based labeling algorithm for shortest paths in road networks. Pardalos PM, Rebennack S, eds. Proc. 10th Internat. Sympos. Experiment. Algorithms, Lecture Notes in Computer Science, vol. 6630 (Springer, Berlin), 230–241.Google Scholar
• Bast H, Storandt S (2014) Frequency-based search for public transit. Huang Y, Schneider M, Gertz M, Krumm J, Sankaranarayanan J, eds. Proc. 22nd SIGSPATIAL Internat. Conf. Adv. Geographic Inform. Systems (Association for Computing Machinery, New York), 13–22.Google Scholar
• Bast H, Hertel M, Storandt S (2016) Scalable transfer patterns. Goodrich M, Mitzenmacher M, eds. Proc. 18th Workshop Algorithm Engrg. Experiments (Society for Industrial and Applied Mathematics, Philadelphia), 15–29.Google Scholar
• Bast H, Carlsson E, Eigenwillig A, Geisberger R, Harrelson C, Raychev V, Viger F (2010) Fast routing in very large public transportation networks using transfer patterns. de Berg M, Meyer U, eds. Proc. 18th Annual Eur. Sympos. Algorithms, Lecture Notes in Computer Science, vol. 6346 (Springer, Berlin), 290–301.Google Scholar
• Bast H, Delling D, Goldberg A, Müller-Hannemann M, Pajor T, Sanders P, Wagner D, Werneck RF (2016) Route Planning in Transportation Networks. Kliemann L, Sanders P, eds. Algorithm Engineering: Selected Results and Surveys, Lecture Notes in Computer Science, vol. 9220 (Springer, Berlin), 19–80.Google Scholar
• Bauer R, Delling D, Wagner D (2011) Experimental study of speed up techniques for timetable information systems. Networks 57(1):38–52.Crossref, Google Scholar
• Bauer R, Delling D, Sanders P, Schieferdecker D, Schultes D, Wagner D (2010) Combining hierarchical and goal-directed speed-up techniques for Dijkstra’s algorithm. J. Experiment. Algorithmics 15:1–31.Crossref, Google Scholar
• Baum M, Buchhold V, Sauer J, Wagner D, Zündorf T (2019) Unlimited transfers for multi-modal route planning: An efficient solution. Bender MA, Svensson O, Herman G, eds. Proc. 27th Annual Eur. Sympos. Algorithms, Leibniz International Proceedings in Informatics, vol. 144 (Schloss Dagstuhl–Leibniz-Zentrum für Informatik, Dagstuhl), 1–16.Google Scholar
• Briem L, Buck S, Ebhart H, Mallig N, Strasser B, Vortisch P, Wagner D, Zündorf T (2017) Efficient traffic assignment for public transit networks. Iliopoulos CS, Pissis SP, Puglisi SJ, Raman R, eds. Proc. 16th Internat. Sympos. Experiment. Algorithms, Leibniz International Proceedings in Informatics, vol. 75 (Schloss Dagstuhl–Leibniz-Zentrum für Informatik, Dagstuhl), 1–14.Google Scholar
• Delling D, Dibbelt J, Pajor T (2019) Fast and exact public transit routing with restricted Pareto sets. Kobourov S, Meyerhenke H, eds. Proc. 21st Workshop Algorithm Engrg. Experiments (Society for Industrial and Applied Mathematics, Philadelphia), 54–65.Google Scholar
• Delling D, Katz B, Pajor T (2012) Parallel computation of best connections in public transportation networks. J. Experiment. Algorithmics 17:1–26.Crossref, Google Scholar
• Delling D, Pajor T, Wagner D (2009) Engineering time-expanded graphs for faster timetable information. Ahuja RK, Möhring RH, Zaroliagis CD, eds. Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems, Lecture Notes in Computer Science, vol. 5868 (Springer, Berlin), 182–206.Crossref, Google Scholar
• Delling D, Pajor T, Werneck RF (2015) Round-based public transit routing. Transportation Sci. 49(3):591–604.Link, Google Scholar
• Delling D, Dibbelt J, Pajor T, Werneck RF (2015) Public transit labeling. Proc. 14th Internat. Sympos. Experiment. Algorithms, Lecture Notes in Computer Science, vol. 9125 (Springer, Berlin), 273–285.Google Scholar
• Delling D, Dibbelt J, Pajor T, Zündorf T (2017) Faster transit routing by hyper partitioning. Proc. 17th Workshop Algorithmic Approaches Transportation Model. Optim. Systems, OpenAccess Series in Informatics, vol. 59 (Schloss Dagstuhl–Leibniz-Zentrum für Informatik), 1–14.Google Scholar
• Delling D, Dibbelt J, Pajor T, Wagner D, Werneck RF (2013) Computing multimodal journeys in practice. Bonifaci V, Demetrescu C, Marchetti-Spaccamela A, eds. Proc. 12th Internat. Sympos. Experiment. Algorithms, Lecture Notes in Computer Science, vol. 7933 (Springer, Berlin), 260–271.Google Scholar
• Dibbelt J, Pajor T, Wagner D (2015) User-constrained multimodal route planning. J. Experiment. Algorithmics 19:1–19.Crossref, Google Scholar
• Dibbelt J, Pajor T, Strasser B, Wagner D (2018) Connection scan algorithm. J. Experiment. Algorithmics 23:1–56.Crossref, Google Scholar
• Dijkstra EW (1959) A note on two problems in connexion with graphs. Numerische Mathematik 1:269–271.Crossref, Google Scholar
• Disser Y, Müller-Hannemann M, Schnee M (2008) Multi-criteria shortest paths in time-dependent train networks. McGeoch CC, ed. Proc. Seventh Internat. Workshop Experiment. Efficient Algorithms, Lecture Notes in Computer Science, vol. 5038 (Springer, Berlin), 347–361.Google Scholar
• Geisberger R, Sanders P, Schultes D, Vetter C (2012) Exact routing in large road networks using contraction hierarchies. Transportation Sci. 46(3):388–404.Link, Google Scholar
• Giannakopoulou K, Paraskevopoulos A, Zaroliagis CD (2019) Multimodal dynamic journey-planning. Algorithms 12(10):1–16.Crossref, Google Scholar
• Knopp S, Sanders P, Schultes D, Schulz F, Wagner D (2007) Computing many-to-many shortest paths using highway hierarchies. Applegate D, Brodal GS, eds. Proc. Ninth Workshop Algorithm Engrg. Experiments (Society for Industrial and Applied Mathematics, Philadelphia), 36–45.Google Scholar
• Lehoux V, Loiodice C (2020) Faster preprocessing for the trip-based public transit routing algorithm. Huisman D, Zaroliagis CD, eds. Proc. 20th Sympos. Algorithmic Approaches Transportation Model. Optim. Systems, OpenAccess Series in Informatics, vol. 85 (Schloss Dagstuhl–Leibniz-Zentrum für Informatik, Dagstuhl), 1–12.Google Scholar
• Mallig N, Kagerbauer M, Vortisch P (2013) mobiTopp—A modular agent-based travel demand modelling framework. Procedia Comput. Sci. 19:854–859.Crossref, Google Scholar
• Müller-Hannemann M, Schnee M (2007) Finding all attractive train connections by multi-criteria Pareto search. Geraets F, Kroon L, Schöbel A, Wagner D, Zaroliagis CD, eds. Algorithmic Methods for Railway Optimization, Lecture Notes in Computer Science, vol. 4359 (Springer, Berlin), 246–263.Crossref, Google Scholar
• Phan DM, Viennot L (2019) Fast public transit routing with unrestricted walking through hub labeling. Kotsireas I, Pardalos P, Parsopoulos KE, Souravlias D, Tsokas A, eds. Proc. Special Event Anal. Experiment. Algorithms, Lecture Notes in Computer Science, vol. 11544 (Springer, Berlin), 237–247.Google Scholar
• Pyrga E, Schulz F, Wagner D, Zaroliagis CD (2008) Efficient models for timetable information in public transportation systems. J. Experiment. Algorithmics 12:1–39.Crossref, Google Scholar
• Sauer J (2018) Faster public transit routing with unrestricted walking. Unpublished master’s thesis, Karlsruhe Institute of Technology, Germany.Google Scholar
• Sauer J, Wagner D, Zündorf T (2020) Integrating ULTRA and trip-based routing. Huisman D, Zaroliagis CD, eds. Proc. 20th Sympos. Algorithmic Approaches Transportation Model. Optim. Systems, OpenAccess Series in Informatics, vol. 85 (Schloss Dagstuhl–Leibniz-Zentrum für Informatik, Dagstuhl), 1–15.Google Scholar
• Wagner D, Zündorf T (2017) Public transit routing with unrestricted walking. D’Angelo G, Dollevoet T, eds. Proc. 17th Workshop Algorithmic Approaches Transportation Model. Optim. Systems, OpenAccess Series in Informatics, vol. 59 (Schloss Dagstuhl–Leibniz-Zentrum für Informatik, Dagstuhl), 1–14.Google Scholar
• Witt S (2015) Trip-based public transit routing. Bansal N, Finocchi I, eds. Proc. 23rd Annual Eur. Sympos. Algorithms, Lecture Notes in Computer Science, vol. 9294 (Springer, Berlin), 1025–1036.Google Scholar
• Zündorf T (2020) Multimodal journey planning and assignment in public transportation networks. Unpublished PhD thesis, Karlsruhe Institute of Technology, Germany.Google Scholar