Exact routing in large road networks using contraction hierarchies

Transportation Science

Volumn 46, Issue 3, 2012, Pages 388-404

  Geisberger, Robert ^a   Sanders, Peter ^a   Schultes, Dominik ^a   Vetter, Christian ^a  

^a KARLSRUHE INSTITUTE OF TECHNOLOGY   (Germany)

Author keywords

Algorithm engineering; Route planning; Shortest paths

Indexed keywords

GRAPH THEORY; MOBILE DEVICES; MOTOR TRANSPORTATION; ROADS AND STREETS; TRAFFIC CONGESTION; TRANSPORTATION;

ALGORITHM ENGINEERING; DIJKSTRA ALGORITHMS; HIERARCHICAL STRUCTURES; PRE-PROCESSING STEP; ROUTE PLANNING; SEARCH SPACES; SHORTEST PATH; SIMPLE APPROACH;

NETWORK ROUTING;

EID: 84864363720     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.1110.0401     Document Type: Article

References (38)

1. Abraham, I., D. Delling, A. V. Goldberg, R. F. Werneck. 2010a. Alternative routes in road networks. P. Festa, ed. Proc. 9th Sympos. Experiment. Algorithms (SEA), Vol. 6049, Lecture Notes Comput. Sci., Springer, Berlin/Heidelberg, 23-34.
2. Abraham, I., D. Delling, A. V. Goldberg, R. F. Werneck. 2011. A hubbased labeling algorithm for shortest paths in road networks. P. M. Pardalos, S. Rebennack, eds. Proc. 10th Sympos. Experiment. Algorithms (SEA), Vol. 6630, Lecture Notes Comput. Sci., Springer, Berlin/Heidelberg, 230-241.
3. Abraham, I., A. Fiat, A. V. Goldberg, R. F. Werneck. 2010b. Highway dimension, shortest paths, and provably efficient algorithms. M. Charikar, ed. Proc. 21st ACM-SIAM Sympos. Discrete Algorithms (SODA). SIAM, Philadelphia, 782-793.
4. Ahuja, R. K., T. L. Magnanti, J. B. Orlin. 1993. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Upper Saddle River, NJ.
5. Batz, G. V., D. Delling, P. Sanders, C. Vetter. 2009. Time-dependent contraction hierarchies. Proc. 11th Workshop on Algorithm Engrg. Experiments (ALENEX). SIAM, Philadelphia, 97-105.
6. Bauer, R., D. Delling. 2009. SHARC: Fast and robust unidirectional routing. ACM J. Experiment. Algorithmics 14(December) Article 4.
7. Bauer, R., T. Columbus, B. Katz, M. Krug, D. Wagner. 2010a. Preprocessing speed-up techniques is hard. Proc. 7th Conf. Algorithms and Complexity (CIAC), Vol. 6078, Lecture Notes Comput. Sci., Springer, Berlin/Heidelberg, 359-370.
8. Bauer, R., D. Delling, P. Sanders, D. Schieferdecker, D. Schultes, D. Wagner. 2010b. Combining hierarchical and goal-directed speed-up techniques for Dijkstra's algorithm. ACM J. Experiment. Algorithmics 15(March) Article 2.3.
9. Delling, D., D. Wagner. 2007. Landmark-based routing in dynamic graphs. C. Demetrescu, ed. Proc. 6th Workshop Experiment. Algorithms (WEA), Vol. 4525, Lecture Notes Comput. Sci., Springer, Berlin/Heidelberg, 52-65.
10. Delling, D., A. V. Goldberg, A. Nowatzyk, R. F. Werneck. 2010. PHAST: Hardware-accelerated shortest path trees. Technical report MSR-TR-2010-125, Microsoft Research, Palo Alto, CA.
11. Delling, D., P. Sanders, D. Schultes, D. Wagner. 2009. Engineering route planning algorithms. J. Lerner, D. Wagner, K. A. Zweig, eds. Algorithmics of Large and Complex Networks, Springer- Verlag, Berlin/Heidelberg, 117-139.
12. Dijkstra, E. W. 1959. A note on two problems in connexion with graphs. Numerische Mathematik 1 269-271.
13. Fu, L., D. Sun, L. R. Rilett. 2006. Heuristic shortest path algorithms for transportation applications: State of the art. Comput. Oper. Res. 33(11) 3324-3343. (Pubitemid 43333228)
14. Geisberger, R. 2008. Contraction hierarchies. Master's thesis, Universität Karlsruhe (TH), Fakultät für Informatik, http://algo2.iti.kit.edu/documents/routeplanning/geisberger-dipl.pdf.
15. Geisberger, R. 2010. Contraction of timetable networks with realistic transfers. P. Festa, ed. Proc. 9th Sympos. Experiment. Algorithms (SEA), Vol. 6049, Lecture Notes Comput. Sci., Springer, Berlin/Heidelberg, 71-82.
16. Geisberger, R., M. Kobitzsch, P. Sanders. 2010. Route planning with flexible objective functions. Proc. 12th Workshop on Algorithm Engrg. Experiments (ALENEX). SIAM, Philadelphia, 124-137.
17. Geisberger, R., P. Sanders, D. Schultes. 2008. Contraction hierarchies source code. http://algo2.iti.kit.edu/routeplanning.php.
18. Geisberger, R., P. Sanders, D. Schultes, D. Delling. 2008. Contraction hierarchies: Faster and simpler hierarchical routing in road networks. C. C. McGeoch, ed. Proc. 7th Workshop Experiment. Algorithms (WEA), Vol. 5038, Lecture Notes Comput. Sci., Springer, Berlin/Heidelberg, 319-333.
19. Goldberg, A. V., C. Harrelson. 2005. Computing the shortest path: A* search meets graph theory. Proc. 16th ACM-SIAM Sympos. Discrete Algorithms (SODA). SIAM, Philadelphia, 156-165. (Pubitemid 40851368)
20. Goldberg, A. V., R. F. Werneck. 2005. Computing point-to-point shortest paths from external memory. Proc. 7th Workshop on Algorithm Engrg. Experiments (ALENEX). SIAM, Philadelphia, 26-40. (Pubitemid 43206496)
21. Goldberg, A. V., H. Kaplan, R. F. Werneck. 2007. Better landmarks within reach. C. Demetrescu, ed. Proc. 6th Workshop Experiment. Algorithms (WEA), Vol. 4525, Lecture Notes Comput. Sci., Springer-Verlag, Berlin/Heidelberg, 38-51. (Pubitemid 350259659)
22. Goldberg, A. V., H. Kaplan, R. F. Werneck. 2009. Reach for A*: Shortest path algorithms with preprocessing. C. Demetrescu, A. V. Goldberg, D. S. Johnson, eds. The Shortest Path Problem2 Ninth DIMACS Implementation Challenge, Vol. 74, DIMACS: Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, Providence, RI, 93-139.
23. Hilger, M., E. Köhler, R. H. Möhring, H. Schilling. 2009. Fast point-to-point shortest path computations with arc-flags. C. Demetrescu, A. V. Goldberg, D. S. Johnson, eds. The Shortest Path Problem2 Ninth DIMACS Implementation Challenge, Vol. 74, DIMACS: Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, Providence, RI, 41-72.
24. Kieritz, T., D. Luxen, P. Sanders, C. Vetter. 2010. Distributed timedependent contraction hierarchies. P. Festa, ed. Proc. 9th sympos. Experiment. Algorithms (SEA), Vol. 6049, Lecture Notes Comput. Sci., Springer, Berlin/Heidelberg, 83-93.
25. Klunder, G. A., H. N. Post. 2006. The shortest path problem on large-scale real-road networks. Networks 48(4) 182-194.
26. Knopp, S., P. Sanders, D. Schultes, F. Schulz, D. Wagner. 2007. Computing many-to-many shortest paths using highway hierarchies. Proc. 9th Workshop on Algorithm Engrg. Experiments (ALENEX). SIAM, Philadelphia, 36-45. (Pubitemid 47267201)
27. Lauther, U. 2004. An extremely fast, exact algorithm for finding shortest paths in static networks with geographical background. Geoinformation und Mobilität - von der Forschung zur Praktischen Anwendung, Vol. 22. IfGI Prints, Münster, 219-230.
28. Maue, J., P. Sanders, D. Matijevic. 2006. Goal directed shortest path queries using precomputed cluster distances. Proc. 5th Workshop on Experiment. Algorithms (WEA), Vol. 4007, Lecture Notes Comput. Sci., Springer, Berlin/Heidelberg, 316-328.
29. Pijls, W., H. N. Post. 2009. A new bidirectional search algorithm with shortened postprocessing. Eur. J. Oper. Res. 198(2) 363-369.
30. Rice, M., V. J. Tsotras. 2010. Graph indexing of road networks for shortest path queries with label restrictions. Proc. VLDB Endowment 4(2) 69-80.
31. Sanders, P., D. Schultes. 2005. Highway hierarchies hasten exact shortest path queries. Proc. 13th Annual Eur. Sympos. Algorithms (ESA), Vol. 3669, Lecture Notes Comput. Sci., Springer, Berlin/Heidelberg, 568-579. (Pubitemid 41491557)
32. Sanders, P., D. Schultes, C. Vetter. 2008. Mobile route planning. Proc. 16th Annual Eur. Sympos. Algorithms (ESA), Vol. 5193, Lecture Notes Comput. Sci., Springer, Berlin/Heidelberg, 732-743.
33. Schultes, D. 2008. Route planning in road networks. Ph.D. thesis, Universität Karlsruhe (TH), Fakultät für Informatik, http://algo2.iti.uka.de/schultes/hwy/schultes-diss.pdf.
34. Schultes, D., P. Sanders. 2007. Dynamic highway-node routing. C. Demetrescu, ed. Proc. 6th Workshop Experiment. Algorithms (WEA), Vol. 4525, Lecture Notes Comput. Sci., Springer, Berlin/Heidelberg, 66-79. (Pubitemid 350259661)
35. U.S. Census Bureau. 2002. U.S. Census 2000 TIGER/Line Files. Washington DC. Accessed March 1, 2005, http://www.censusgov/geo/www/tiger/tigerua/ua-tgr2k. html.
36. Vetter, C. 2009. Parallel time-dependent contraction hierarchies. Student research project, Universität Karlsruhe, Fakultät für Informatik, http://algo2.iti.kit.edu/download/vetter-sa.pdf.
37. Vetter, C. 2010. Monav. http://code.google.com/p/monav/.
38. Winter, S. 2002. Modeling costs of turns in route planning. GeoInformatica 6(4) 345-361. (Pubitemid 36036389)