Round-Based Public Transit Routing

References

• Abraham I, Delling D, Goldberg AV, Werneck RF (2011) A hub-based labeling algorithm for shortest paths on road networks. Pardalos PM, Rebennack S, eds. Proc. 10th Internat. Sympos. Experiment. Algorithms (SEA'11), Lecture Notes Comput. Sci., Vol. 6630 (Springer, Berlin Heidelberg), 230–241.Crossref, Google Scholar
• Amdahl GM (1967) Validity of the single processor approach to achieving large scale computing capabilities. Proc. April 18–20, 1967, Spring Joint Comput. Conf. AFIPS'67 (Spring) (ACM, New York), 483–485.Crossref, Google Scholar
• Bast H (2009) Car or public transport—Two worlds. Albers S, Alt H, Näher S, eds. Efficient Algorithms, Lecture Notes Comput. Sci., Vol. 5760 (Springer, Berlin Heidelberg), 355–367.Crossref, 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. Proc. 18th Annual Eur. Sympos. Algorithms (ESA'10), Lecture Notes Comput. Sci., Vol. 6346 (Springer, Berlin Heidelberg), 290–301.Crossref, Google Scholar
• Bast H, Delling D, Goldberg AV, Müller–Hannemann M, Pajor T, Sanders P, Wagner D, Werneck RF (2014) Route planning in transportation networks. Technical Report MSR-TR-2014-4, Microsoft Research, Redmond, WA. http://research.microsoft.com/apps/pubs/?id=207102.Google Scholar
• Bauer R, Delling D, Wagner D (2011) Experimental study on speed-up techniques for timetable information systems. Networks 57(1):38–52.Crossref, Google Scholar
• Berger A, Grimmer M, Müller–Hannemann M (2010) Fully dynamic speed-up techniques for multi-criteria shortest path searches in time-dependent networks. Festa P, ed. Proc. 9th Internat. Sympos. Experiment. Algorithms (SEA'10), Lecture Notes Comput. Sci., Vol. 6049 (Springer, Berlin Heidelberg), 35–46.Crossref, Google Scholar
• Berger A, Delling D, Gebhardt A, Müller–Hannemann M (2009) Accelerating time-dependent multi-criteria timetable information is harder than expected. Clausen J, Di Stefano G, eds. Proc. 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optim., Systems (ATMOS'09), OpenAccess Series in Informatics (OASIcs) (Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany).Google Scholar
• Brodal G, Jacob R (2004) Time-dependent networks as models to achieve fast exact time-table queries. Proc. 3rd Workshop on Algorithmic Methods and Models for Optim. Railways (ATMOS'03), Electronic Notes in Theoretical Computer Science, Vol. 92 (Elsevier, Budapest), 3–15.Google Scholar
• Delling D (2011) Time-dependent SHARC-routing. Algorithmica 60(1):60–94.Crossref, Google Scholar
• Delling D, Katz B, Pajor T (2012a) Parallel computation of best connections in public transportation networks. ACM J. Experiment. Algorithmics 17(4):4.1–4.26.Google Scholar
• Delling D, Pajor T, Wagner D (2009) Engineering time-expanded graphs for faster timetable information. Ahuja RK, Möhring RH, Zaroliagis C, eds. Robust and Online Large-Scale Optimization, Lecture Notes Comput. Sci., Vol. 5868 (Springer, Berlin Heidelberg), 182–206.Crossref, Google Scholar
• Delling D, Pajor T, Werneck RF (2012b) Round-based public transit routing. Proc. 14th Meeting on Algorithm Engrg. Experiments (ALENEX'12) (SIAM, Philadelphia), 130–140.Crossref, Google Scholar
• Dijkstra EW (1959) A note on two problems in connexion with graphs. Numerische Mathematik 1(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. 7th Workshop Experiment. Algorithms (WEA'08), Lecture Notes Comput. Sci., Vol. 5038 (Springer, Berlin Heidelberg), 347–361.Crossref, Google Scholar
• Geisberger R (2010) Contraction of timetable networks with realistic transfers. Festa P, ed. Proc. 9th Internat. Sympos. Experiment. Algorithms (SEA'10), Lecture Notes Comput. Sci., Vol. 6049 (Springer, Berlin Heidelberg), 71–82.Crossref, Google Scholar
• General Transit Feed Specification (2010) http://developers.google.com/transit/gtfs.Google Scholar
• London Data Store (2011) http://data.london.gov.uk/.Google Scholar
• Madduri K, Bader DA, Berry JW, Crobak JR (2009) Parallel shortest path algorithms for solving large-scale instances. Demetrescu C, Goldberg AV, Johnson DS, eds. The Shortest Path Problem: Ninth DIMACS Implementation Challenge, DIMACS Book, Vol. 74 (American Mathematical Society, Providence, RI), 249–290.Google Scholar
• Meyer U, Sanders P (2003) Δ-stepping: A parallelizable shortest path algorithm. J. Algorithms 49(1):114–152.Crossref, Google Scholar
• Müller–Hannemann M, Schnee M (2007) Finding all attractive train connections by multi-criteria Pareto search. Algorithmic Methods for Railway Optimization, Lecture Notes Comput. Sci., Vol. 4359 (Springer, Berlin Heidelberg), 246–263.Crossref, Google Scholar
• Müller–Hannemann M, Schnee M (2009) Efficient timetable information in the presence of delays. Ahuja RK, Möhring RH, Zaroliagis C, eds. Robust and Online Large-Scale Optimization, Lecture Notes Comput. Sci., Vol. 5868 (Springer, Berlin Heidelberg), 249–272.Crossref, Google Scholar
• Pyrga E, Schulz F, Wagner D, Zaroliagis C (2008) Efficient models for timetable information in public transportation systems. ACM J. Experiment. Algorithmics 12(2.4):1–39.Crossref, Google Scholar
• Sanders P, Schultes D (2005) Highway hierarchies hasten exact shortest path queries. Proc. 13th Annual Eur. Sympos. Algorithms (ESA'05), Lecture Notes Comput. Sci., Vol. 3669 (Springer, Berlin Heidelberg), 568–579.Crossref, Google Scholar
• Sommer C (2014) Shortest-path queries in static networks. ACM Comput. Surveys 46(4):45:1–45:31.Crossref, Google Scholar