Minimum time-dependent travel times with contraction hierarchies

ACM Journal of Experimental Algorithmics

Volumn 18, Issue 1, 2013, Pages

  Batz, G Veit ^a   Geisberger, Robert ^a   Sanders, Peter ^a   Vetter, Christian ^a  

^a KARLSRUHE INSTITUTE OF TECHNOLOGY   (Germany)

Author keywords

Earliest arrival problem; Road network; Server based route planning; Shortest path; Speed up technique; Travel time profile

Indexed keywords

EID: 84878068235     PISSN: 10846654     EISSN: None     Source Type: Journal    
DOI: 10.1145/2444016.2444020     Document Type: Conference Paper

References (28)

1. BATZ, G. V., DELLING, D., SANDERS, P., AND VETTER, C. 2009. Time-dependent contraction hierarchies. In Proceedings of the 11thWorkshop on Algorithm Engineering and Experiments (ALENEX'09). SIAM, 97-105.
2. BATZ, G. V., GEISBERGER, R., NEUBAUER, S., AND SANDERS, P. 2010. Time-dependent contraction hierarchies and approximation. See Festa [2010], 166-177. http://www.springerlink.com/content/u787292691813526/.
3. BATZ, G. V.,GEISBERGER, R., AND SANDERS, P. 2008. Time dependent contraction hierarchies - basic algorithmic ideas. Tech. rep. ITI Sanders, Faculty of Informatics, Universität Karlsruhe (TH).
4. BATZ, G. V. AND SANDERS, P. 2012. Time-dependent route planning with generalized objective functions. In Proceedings of the 20th Annual European Symposium on Algorithms (ESA'12). Springer.
5. BAUER, R., DELLING, D., SANDERS, P., SCHIEFERDECKER, D., SCHULTES, D., AND WAGNER, D. 2010. Combining hierarchical and goal-directed speed-up techniques for Dijkstra's algorithm. ACM J. Exp. Algor. 15, 2.3 (January 2010), 1-31.
6. BRUNEL, E., DELLING, D., GEMSA, A., AND WAGNER, D. 2010. Space-efficient SHARC-routing. In Proceedings of the 9th International Symposium on Experimental Algorithms (SEA'10). Springer, 47-58.
7. DANTZIG, G. B. 1962. Linear Programming and Extensions. Princeton University Press.
8. DEAN, B. C. 2004. Shortest paths in FIFO time-dependent networks: theory and algorithms. Tech. rep., Massachusetts Institute of Technology.
9. DELLING, D. 2009. Engineering and augmenting route planning algorithms. Ph.d. Dissertation, Universität Karlsruhe, Fakultät f ür Informatik. http://i11www.ira.uka.de/extra/publications/d-earpa-09.pdf.
10. DELLING, D. 2011. Time-dependent SHARC-routing. Algorithmica 60, 1, 60-94.
11. DELLING, D. AND NANNICINI, G. 2008. Bidirectional core-based routing in dynamic time-dependent road networks. In Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC'08), Springer, 813-824.
12. DELLING, D., SANDERS, P., SCHULTES, D., AND WAGNER, D. 2009. Engineering route planning algorithms. In Algorithmics of Large and Complex Networks, Jürgen Lerner, Dorothea Wagner, and Katharina A. Zweig, Eds., Springer, 117-139.
13. DIJKSTRA, E. W. 1959. A note on two problems in connexion with graphs. Numer. Math. 1, 269-271.
14. DREYFUS, S. E. 1969. An appraisal of some shortest-path algorithms. Oper. Res. 17, 3, 395-412.
15. FESTA, P. (Ed.). 2010. Proceedings of the 9th International Symposium on Experimental Algorithms (SEA'10). Springer.
16. GEISBERGER, R. AND SANDERS, P. 2010. Engineering time-dependent many-to-many shortest paths computation. In Proceedings of the 10th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'10).
17. GEISBERGER, R., SANDERS, P., SCHULTES, D., AND DELLING, D. 2008. Contraction hierarchies: Faster and simpler hierarchical routing in road networks. In Proceedings of the 7th Workshop on Experimental Algorithms (WEA'08). Springer, 319-333.
18. GEISBERGER, R., SANDERS, P., SCHULTES, D., AND VETTER, C. 2012. Exact routing in large road networks using contraction hierarchies. Trans. Sci. 46, 3, 388-404.
19. GOLDBERG, A. V. AND HARRELSON, C. 2005. Computing the shortest path: A* search meets graph theory. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'05). SIAM, 156-165.
20. HOLZER,M.,SCHULZ, F., ANDWAGNER, D. 2008. Engineeringmultilevel overlay graphs for shortest-path queries. ACM J. Exp. Algor. 13, 2.5, 1-26.
21. IMAI, H. AND IRI, M. 1987. An optimal algorithm for approximating a piecewise linear function. J. Info. Proces. 9, 3, 159-162.
22. KIERITZ, T., LUXEN, D., SANDERS, P., AND VETTER, C. 2010. Distributed time-dependent contraction hierarchies. In Proceedings of the 9th International Symposium on Experimental Algorithms (SEA'10). Springer, 83-93.
23. MEHLHORN, K. AND SANDERS, P. 2008. Algorithms and Data Structures: The Basic Toolbox. Springer.
24. NANNICINI, G.,DELLING, D., LIBERTI, L., AND SCHULTES, D. 2008. Bidirectional A* search for time-dependent fast paths. In Proceedings of the 7th Workshop on Experimental Algorithms (WEA'08). Springer, 334-346.
25. NEUBAUER, S. 2009. Space efficient approximation of piecewise linear functions. Studienarbeit, Universität Karlsruhe, Fakultät f ür Informatik. http://algo2.iti.kit.edu/download/neubauersa.pdf.
26. ORDA, A. AND ROM, R. 1990. Shortest-path and minimum delay algorithms in networks with time-dependent edge-length. J. ACM 37, 3, 607-625.
27. SANDERS, P. AND SCHULTES, D. 2005. Highway hierarchies hasten exact shortest path queries. In Proceedings of the 13th Annual European Symposium on Algorithms (ESA'05). Springer, 568-579.
28. SCHULTES, D. AND SANDERS, P. 2007. Dynamic highway-node routing. In Proceedings of the 6th Workshop on Experimental Algorithms (WEA'07). Springer, 66-79.