Contraction of timetable networks with realistic transfers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6049 LNCS, Issue , 2010, Pages 71-82

  Geisberger, Robert ^a  

^a KARLSRUHE INSTITUTE OF TECHNOLOGY   (Germany)

Author keywords

Algorithm engineering; Public transit; Route planning

Indexed keywords

ALGORITHM ENGINEERING; CONTINENTAL NETWORK; GRAPH MODEL; PRE-COMPUTATION; PUBLIC TRANSIT; QUERY TIME; ROUTE PLANNING; SHORTEST PATH; TRANSFER TIME;

OPERATIONS RESEARCH;

ALGORITHMS;

EID: 78249255035     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13193-6_7     Document Type: Conference Paper

References (23)

1. Delling, D., Sanders, P., Schultes, D., Wagner, D.: Engineering Route Planning Algorithms. In: Lerner, J., Wagner, D., Zweig, K.A. (eds.) Algorithmics of Large and Complex Networks. LNCS, vol. 5515, pp. 117-139. Springer, Heidelberg (2009).
2. Geisberger, R., Sanders, P., Schultes, D., Delling, D.: Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. In: [22], pp. 319-333.
3. Batz, G.V., Delling, D., Sanders, P., Vetter, C.: Time-Dependent Contraction Hierarchies. In: Proceedings of the 11th Workshop on Algorithm Engineering and Experiments (ALENEX 2009), pp. 97-105. SIAM, Philadelphia (2009).
4. Müller-Hannemann, M., Weihe, K.: Pareto Shortest Paths is Often Feasible in Practice. In: Brodal, G.S., Frigioni, D., Marchetti-Spaccamela, A. (eds.)WAE 2001. LNCS, vol. 2141, pp. 185-197. Springer, Heidelberg (2001).
5. Marcotte, P., Nguyen, S. (eds.): Equilibrium and Advanced Transportation Modelling. Kluwer Academic Publishers Group, Dordrecht (1998).
6. Schulz, F., Wagner, D., Weihe, K.: Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport. ACM Journal of Experimental Algorithmics 5, 12 (2000).
7. Brodal, G., Jacob, R.: Time-dependent Networks as Models to Achieve Fast Exact Time-table Queries. In: [23], pp. 3-15.
8. Nachtigall, K.: Time depending shortest-path problems with applications to railway networks. European Journal of Operational Research 83(1), 154-166 (1995).
9. Orda, A., Rom, R.: Shortest-Path and Minimum Delay Algorithms in Networks with Time-Dependent Edge-Length. Journal of the ACM 37(3), 607-625 (1990).
10. Orda, A., Rom, R.: Minimum Weight Paths in Time-Dependent Networks. Networks 21, 295-319 (1991).
11. Pyrga, E., Schulz, F., Wagner, D., Zaroliagis, C.: Efficient Models for Timetable Information in Public Transportation Systems. ACM Journal of Experimental Algorithmics 12, Article 2.4 (2007).
12. Berger, A., Müller-Hannemann, M.: Subpath-Optimality ofMulti-Criteria Shortest Paths in Time-and Event-Dependent Networks. Technical Report 1, University Halle-Wittenberg, Institute of Computer Science (2009).
13. Berger, A., Delling, D., Gebhardt, A., Mü ller-Hannemann, M.: 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 2009), Dagstuhl Seminar Proceedings (2009).
14. Delling, D., Wagner, D.: Time-Dependent Route Planning. In: Ahuja, R.K., Möhring, R.H., Zaroliagis, C. (eds.) Robust and Online Large-Scale Optimization. LNCS, vol. 5868, pp. 207-230. Springer, Heidelberg (2009).
15. Bast, H.: Car or Public Transport - Two Worlds. In: Albers, S., Alt, H., Näher, S. (eds.) Efficient Algorithms. LNCS, vol. 5760, pp. 355-367. Springer, Heidelberg (2009).
16. Hart, P.E., Nilsson, N., Raphael, B.: A Formal Basis for the Heuristic Determination of Minimum Cost Paths. IEEE Transactions on Systems Science and Cybernetics 4, 100-107 (1968).
17. Pyrga, E., Schulz, F., Wagner, D., Zaroliagis, C.: Towards Realistic Modeling of Time-Table Information through the Time-Dependent Approach. In: [22], pp. 85-103.
18. Disser, Y., Müller-Hannemann, M., Schnee, M.: Multi-Criteria Shortest Paths in Time-Dependent Train Networks. In: [22], pp. 347-361.
19. Delling, D.: Time-Dependent SHARC-Routing. Algorithmica (July 2009); In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol. 5193, pp. 332-343. Springer, Heidelberg (2008).
20. Vetter, C.: Parallel Time-Dependent Contraction Hierarchies (2009), Student Research Project, http://algo2.iti.kit.edu/documents/routeplanning/ vetter-sa.pdf.
21. Batz, G.V., Geisberger, R., Neubauer, S., Sanders, P.: Time-Dependent Contraction Hierarchies and Approximation. In: Festa, P. (ed.) SEA 2010. LNCS, vol. 6049, pp. 166-177. Springer, Heidelberg (2010).
22. McGeoch, C.C. (ed.): WEA 2008. LNCS, vol. 5038. Springer, Heidelberg (2008).
23. Proceedings of the 3rd Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS 2003). Electronic Notes in Theoretical Computer Science, vol. 92 (2004).