Route planning with flexible edge restrictions

Journal of Experimental Algorithmics

Volumn 17, Issue , 2012, Pages

  Geisberger, Robert ^a   Rice, Michael N ^b   Sanders, Peter ^a   Tsotras, Vassilis J ^b  

^a KARLSRUHE INSTITUTE OF TECHNOLOGY   (Germany)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Contraction Hierarchies; Edge restrictions; Flexible scenario; Route planning; Shortest paths

Indexed keywords

EID: 84859412459     PISSN: 10846654     EISSN: None     Source Type: Journal    
DOI: 10.1145/2133803.2133805     Document Type: Article

References (16)

1. 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, 1-31. (Special Section WEA'08.)
2. DELLING, D., SANDERS, P., SCHULTES, D., AND WAGNER, D. 2009. Engineering route planning algorithms. In Algorithmics of Large and Complex Networks, J. Lerner, D. Wagner, and K. A. Zweig, Eds., Lecture Notes in Computer Science, vol. 5515, Springer, Berlin, 117-139.
3. DELLING, D. AND WAGNER, D. 2007. Landmark-based routing in dynamic graphs. In Proceedings of the 6th Workshop on Experimental Algorithms (WEA'07). Lecture Notes in Computer Science, vol. 4525, Springer, Berlin, 52-65.
4. DEMETRESCU, C., Ed. 2007. Proceedings of the 6th Workshop on Experimental Algorithms (WEA'07). Lecture Notes in Computer Science, vol. 4525, Springer, Berlin.
5. DIJKSTRA, E. W. 1959. A Note on Two Problems in Connexion with Graphs. Numerische Mathematik 1, 269-271.
6. GEISBERGER, R., KOBITZSCH, M., AND SANDERS, P. 2010. Route planning with flexible objective functions. In Proceedings of the 12th Workshop on Algorithm Engineering and Experiments (ALENEX'10). SIAM, Philadelphia, 124-137.
7. 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). C. C. McGeoch, Ed., Lecture Notes in Computer Science, vol. 5038, Springer, Berlin, 319-333.
8. 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, Philadelphia, 156-165. (Pubitemid 40851368)
9. GOLDBERG, A. V. AND WERNECK, R. F. 2005. Computing point-to-point shortest paths from external memory. In Proceedings of the 7th Workshop on Algorithm Engineering and Experiments (ALENEX'05). SIAM, Philadelphia, 26-40. (Pubitemid 43206496)
10. HART, P. E., NILSSON, N., AND RAPHAEL, B. 1968. A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4, 100-107.
11. HILGER, M., KÖHLER, E., MÖHRING, R.H., AND SCHILLING,H. 2009. Fast point-to-point shortest path computations with arc-flags. In The Shortest Path Problem: Ninth DIMACS Implementation Challenge, C. Demetrescu, A. V. Goldberg, and D. S. Johnson, Eds., DIMACS Book, vol. 74, American Mathematical Society, 41-72.
12. HOLZER, M., SCHULZ, F., AND WAGNER, D. 2008. Engineering multi-level overlay graphs for shortest-path queries. ACM J. Exp. Algor. 13, 2.5, 1-26.
13. LAUTHER, U. 2004. An extremely fast, exact algorithm for finding shortest paths in static networks with geographical background. In Geoinformation und Mobilit ät-von der Forschung zur praktischen Anwendung. vol. 22, IfGI prints, 219-230.
14. RICE, M. N. AND TSOTRAS, V. J. 2010. Graph indexing of road networks for shortest path queries with label restrictions. Proc. VLDB Endow. 4, 2, 69-80.
15. 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). Lecture Notes in Computer Science, vol. 3669, Springer, Berlin, 568-579. (Pubitemid 41491557)
16. SCHULTES, D. AND SANDERS, P. 2007. Dynamic highway-node routing. In Proceedings of the 6th Workshop on Experimental Algorithms (WEA'07). Lecture Notes in Computer Science, vol. 4525, Springer, Berlin, 66-79. (Pubitemid 350259661)