Round-based public transit routing

Proceedings of the Workshop on Algorithm Engineering and Experiments

Volumn , Issue , 2012, Pages 130-140

  Delling, Daniel ^a   Pajor, Thomas ^b   Werneck, Renato F ^a  

^a MICROSOFT RESEARCH   (United States)

^b KARLSRUHE INSTITUTE OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BUS TRANSPORTATION; PARETO PRINCIPLE; TRANSPORTATION ROUTES;

DIJKSTRA'S ALGORITHMS; DYNAMIC SCENARIOS; GRAPH PROBLEMS; INTERACTIVE APPLICATIONS; PARALLELIZATIONS; PUBLIC TRANSIT NETWORKS; PUBLIC TRANSPORTATION NETWORKS; RANDOM LOCATION;

URBAN TRANSPORTATION;

EID: 84882346347     PISSN: 21640300     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972924.13     Document Type: Conference Paper

References (26)

1. I. Abraham, D. Delling, A. V. Goldberg, and R. F. Werneck. A Hub-Based Labeling Algorithm for Shortest Paths on Road Networks. In SEA, LNCS 6630, pp. 230-241. Springer, 2011.
2. H. Bast. Car or Public Transport - Two Worlds. In Efficient Algorithms, LNCS 5760, pp. 355-367. Springer, 2009.
3. H. Bast, E. Carlsson, A. Eigenwillig, R. Geisberger, C. Harrelson, V. Raychev, and F. Viger. Fast Routing in Very Large Public Transportation Networks using Transfer Patterns. In ESA, LNCS, pp. 290-301. Springer, 2010.
4. R. Bauer, D. Delling, and D. Wagner. Experimental Study on Speed-Up Techniques for Timetable Information Systems. Networks, 57(1):38-52, January 2011.
5. A. Berger, D. Delling, A. Gebhardt, and M. Müller-Hannemann. Accelerating Time-Dependent Multi-Criteria Timetable Information is Harder Than Expected. In ATMOS, OASICS, 2009.
6. A. Berger, M. Grimmer, and M. Müller-Hannemann. Fully Dynamic Speed-Up Techniques for Multi-criteria Shortest Path Searches in Time-Dependent Networks. In SEA, LNCS 6049, pp. 35-46. Springer, 2010.
7. G. Brodal and R. Jacob. Time-dependent Networks as Models to Achieve Fast Exact Time-table Queries. In ATMOS, ENTCS 92, pp. 3-15, 2004.
8. Chicago Transit Authority. www.transitchicago.com.
9. D. Delling. Time-Dependent SHARC-Routing. Algorithmica, 60(1):60-94, May 2011.
10. D. Delling, B. Katz, and T. Pajor. Parallel Computation of Best Connections in Public Transportation Networks. In IPDPS, pp. 1-12. IEEE, 2010.
11. D. Delling, B. Katz, and T. Pajor. Parallel Computation of Best Connections in Public Transportation Networks. Journal version. Submitted for publication. Online available at www.iti.uni-karlsruhe.de/~pajor/paper/dkp- pcbcp-11.pdf, 2011.
12. D. Delling, T. Pajor, and D. Wagner. Engineering Time-Expanded Graphs for Faster Timetable Information. In Robust and Online Large-Scale Optimization, LNCS 5868, pp. 182-206. Springer, 2009.
13. D. Delling, P. Sanders, D. Schultes, and D. Wagner. Engineering Route Planning Algorithms. In Algorithmics of Large and Complex Networks, LNCS 5515, pp. 117-139. Springer, 2009.
14. E. W. Dijkstra. A Note on Two Problems in Connexion with Graphs. Numerische Mathematik, 1:269-271, 1959.
15. Y. Disser, M. Müller-Hannemann, and M. Schnee. Multi-Criteria Shortest Paths in Time-Dependent Train Networks. In WEA, LNCS 5038, pp. 347-361. Springer, 2008.
16. R. Geisberger. Contraction of Timetable Networks with Realistic Transfers. In SEA, LNCS 6049, pp. 71-82. Springer, 2010.
17. General Transit Feed Specification. code.google.com/transit/spec/transit- feed-specification.html
18. London Data Store. data.london.gov.uk
19. Los Angeles County Metropolitan Transportation Authority. www.metro.net
20. K. Madduri, D. A. Bader, J. W. Berry, and J. R. Crobak. Parallel Shortest Path Algorithms for Solving Large-Scale Instances. In C. Demetrescu, A. V. Goldberg, and D. S. Johnson, editors, The Shortest Path Problem: Ninth DIMACS Implementation Challenge, DIMACS Book 74, pp. 249-290. AMS, 2009.
21. Metropolitan Transportation Authority of the State of New York. www.mta.info
22. U. Meyer and P. Sanders. δ-Stepping: A Parallelizable Shortest Path Algorithm. Journal of Algorithms, 49(1):114-152, 2003.
23. M. Müller-Hannemann and M. Schnee. Finding All Attractive Train Connections by Multi-Criteria Pareto Search. In Algorithmic Methods for Railway Optimization, LNCS 4359, pp. 246-263. Springer, 2007.
24. M. Müller-Hannemann, M. Schnee, and L. Frede. Efficient On-Trip Timetable Information in the Presence of Delays. In ATMOS, OASICS, 2008.
25. E. Pyrga, F. Schulz, D. Wagner, and C. Zaroliagis. Efficient Models for Timetable Information in Public Transportation Systems. ACM Journal of Experimental Algorithmics, 12(2.4):1-39, 2007.
26. Transport for London. www.tfl.gov.uk