{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T23:34:48Z","timestamp":1772753688496,"version":"3.50.1"},"reference-count":41,"publisher":"Association for Computing Machinery (ACM)","license":[{"start":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T00:00:00Z","timestamp":1267401600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["SA 933\/1-3SA 933\/5-1WA 654\/16-1"],"award-info":[{"award-number":["SA 933\/1-3SA 933\/5-1WA 654\/16-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Research Training Group","award":["1194"],"award-info":[{"award-number":["1194"]}]},{"DOI":"10.13039\/501100004963","name":"Seventh Framework Programme","doi-asserted-by":"publisher","award":["FP6-021235-2"],"award-info":[{"award-number":["FP6-021235-2"]}],"id":[{"id":"10.13039\/501100004963","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ACM J. Exp. Algorithmics"],"published-print":{"date-parts":[[2010,3]]},"abstract":"<jats:p>In recent years, highly effective hierarchical and goal-directed speed-up techniques for routing in large road networks have been developed. This article makes a systematic study of combinations of such techniques. These combinations turn out to give the best results in many scenarios, including graphs for unit disk graphs, grid networks, and time-expanded timetables. Besides these quantitative results, we obtain general insights for successful combinations.<\/jats:p>","DOI":"10.1145\/1671970.1671976","type":"journal-article","created":{"date-parts":[[2010,4,7]],"date-time":"2010-04-07T02:56:32Z","timestamp":1270608992000},"source":"Crossref","is-referenced-by-count":75,"title":["Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm"],"prefix":"10.1145","volume":"15","author":[{"given":"Reinhard","family":"Bauer","sequence":"first","affiliation":[{"name":"Karlsruhe Institute of Technology, Karlsruhe, Germany"}]},{"given":"Daniel","family":"Delling","sequence":"additional","affiliation":[{"name":"Karlsruhe Institute of Technology, Karlsruhe, Germany"}]},{"given":"Peter","family":"Sanders","sequence":"additional","affiliation":[{"name":"Karlsruhe Institute of Technology, Karlsruhe, Germany"}]},{"given":"Dennis","family":"Schieferdecker","sequence":"additional","affiliation":[{"name":"Karlsruhe Institute of Technology, Karlsruhe, Germany"}]},{"given":"Dominik","family":"Schultes","sequence":"additional","affiliation":[{"name":"Karlsruhe Institute of Technology, Karlsruhe, Germany"}]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[{"name":"Karlsruhe Institute of Technology, Karlsruhe, Germany"}]}],"member":"320","published-online":{"date-parts":[[2010,3,17]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Proceedings of the 9th Workshop on Algorithm Engineering and Experiments (ALENEX'07)","author":"Bast H.","unstructured":"Bast , H. , Funke , S. , Matijevic , D. , Sanders , P. , and Schultes , D . 2007. In transit to constant shortest-path queries in road networks . In Proceedings of the 9th Workshop on Algorithm Engineering and Experiments (ALENEX'07) . SIAM, Philadelphia, 46--59. Bast, H., Funke, S., Matijevic, D., Sanders, P., and Schultes, D. 2007. In transit to constant shortest-path queries in road networks. In Proceedings of the 9th Workshop on Algorithm Engineering and Experiments (ALENEX'07). SIAM, Philadelphia, 46--59."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1137521"},{"key":"e_1_2_1_3_1","volume-title":"Proceedings of the 11th Workshop on Algorithm Engineering and Experiments (ALENEX'09)","author":"Batz G. V.","unstructured":"Batz , G. V. , Delling , D. , Sanders , P. , and Vetter , C . 2009. Time-dependent contraction hierarchies . In Proceedings of the 11th Workshop on Algorithm Engineering and Experiments (ALENEX'09) . SIAM, Philadelphia, 97--105. Batz, G. V., Delling, D., Sanders, P., and Vetter, C. 2009. Time-dependent contraction hierarchies. In Proceedings of the 11th Workshop on Algorithm Engineering and Experiments (ALENEX'09). SIAM, Philadelphia, 97--105."},{"key":"e_1_2_1_4_1","volume-title":"Proceedings of the 10th Workshop on Algorithm Engineering and Experiments (ALENEX'08)","author":"Bauer R.","unstructured":"Bauer , R. and Delling , D . 2008. SHARC: Fast and robust unidirectional routing . In Proceedings of the 10th Workshop on Algorithm Engineering and Experiments (ALENEX'08) . SIAM, Philadelphia, 13--26. Bauer, R. and Delling, D. 2008. SHARC: Fast and robust unidirectional routing. In Proceedings of the 10th Workshop on Algorithm Engineering and Experiments (ALENEX'08). SIAM, Philadelphia, 13--26."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1498698.1537599"},{"key":"e_1_2_1_6_1","volume-title":"Proceedings of the 7th Workshop on Experimental Algorithms (WEA'08)","author":"Bauer R.","unstructured":"Bauer , R. , Delling , D. , Sanders , P. , Schieferdecker , D. , Schultes , D. , and Wagner , D . 2008. Combining hierarchical and goal-directed speed-up techniques for Dijkstra's algorithm . In Proceedings of the 7th Workshop on Experimental Algorithms (WEA'08) . Springer, Berlin, 303--318. Bauer, R., Delling, D., Sanders, P., Schieferdecker, D., Schultes, D., and Wagner, D. 2008. Combining hierarchical and goal-directed speed-up techniques for Dijkstra's algorithm. In Proceedings of the 7th Workshop on Experimental Algorithms (WEA'08). Springer, Berlin, 303--318."},{"key":"e_1_2_1_7_1","volume-title":"Proceedings of the 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'07)","author":"Bauer R.","unstructured":"Bauer , R. , Delling , D. , and Wagner , D . 2007. Experimental study on speed-up techniques for timetable information systems . In Proceedings of the 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'07) . Bauer, R., Delling, D., and Wagner, D. 2007. Experimental study on speed-up techniques for timetable information systems. In Proceedings of the 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'07)."},{"key":"e_1_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Beier R. Funke S. Matijevic D. and Sanders P. 2009. Energy-efficient paths in radio networks. Algorithmica.  Beier R. Funke S. Matijevic D. and Sanders P. 2009. Energy-efficient paths in radio networks. Algorithmica.","DOI":"10.1007\/s00453-010-9414-0"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2001.1189"},{"key":"e_1_2_1_10_1","volume-title":"Linear Programming and Extensions","author":"Dantzig G. B.","unstructured":"Dantzig , G. B. 1962. Linear Programming and Extensions . Princeton University Press . Dantzig, G. B. 1962. Linear Programming and Extensions. Princeton University Press."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87744-8_28"},{"key":"e_1_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Delling D. 2009. Time-dependent SHARC-routing. Algorithmica.  Delling D. 2009. Time-dependent SHARC-routing. Algorithmica.","DOI":"10.1007\/s00453-009-9341-0"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92182-0_71"},{"key":"e_1_2_1_14_1","volume-title":"Proceedings of the 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'08)","author":"Delling D.","unstructured":"Delling , D. , Pajor , T. , and Wagner , D . 2008. Engineering time-expanded graphs for faster timetable information . In Proceedings of the 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'08) . Delling, D., Pajor, T., and Wagner, D. 2008. Engineering time-expanded graphs for faster timetable information. In Proceedings of the 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'08)."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02094-0_7"},{"key":"e_1_2_1_16_1","volume-title":"Eds. DIMACS Book","volume":"74","author":"Delling D.","unstructured":"Delling , D. , Sanders , P. , Schultes , D. , and Wagner , D . 2009b. Highway hierarchies star. 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, Providence, RI, 141--174. Delling, D., Sanders, P., Schultes, D., and Wagner, D. 2009b. Highway hierarchies star. 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, Providence, RI, 141--174."},{"key":"e_1_2_1_17_1","volume-title":"Proceedings of the 6th Workshop on Experimental Algorithms (WEA'07)","author":"Delling D.","unstructured":"Delling , D. and Wagner , D . 2007. Landmark-based routing in dynamic graphs . In Proceedings of the 6th Workshop on Experimental Algorithms (WEA'07) . Springer, Berlin, 52--65. Delling, D. and Wagner, D. 2007. Landmark-based routing in dynamic graphs. In Proceedings of the 6th Workshop on Experimental Algorithms (WEA'07). Springer, Berlin, 52--65."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02011-7_13"},{"key":"e_1_2_1_19_1","volume-title":"Eds","author":"Demetrescu C.","year":"2006","unstructured":"Demetrescu , C. , Goldberg , A. V. , and Johnson , D. S. , Eds . 2006 . Proceedings of the 9th DIMACS Implementation Challenge\u2014Shortest Paths. American Mathematical Society , Providence, RI. Demetrescu, C., Goldberg, A. V., and Johnson, D. S., Eds. 2006. Proceedings of the 9th DIMACS Implementation Challenge\u2014Shortest Paths. American Mathematical Society, Providence, RI."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_2_1_21_1","volume-title":"Proceedings of the 7th Workshop on Experimental Algorithms (WEA'08)","author":"Geisberger R.","unstructured":"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, Berlin, 319--333. 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, Berlin, 319--333."},{"key":"e_1_2_1_22_1","volume-title":"Proceedings of the 16th Annual ACM--SIAM Symposium on Discrete Algorithms (SODA'05)","author":"Goldberg A. V.","unstructured":"Goldberg , A. V. and Harrelson , C . 2005. Computing the shortest path: A&ast; search meets graph theory . In Proceedings of the 16th Annual ACM--SIAM Symposium on Discrete Algorithms (SODA'05) . ACM, New York, 156--165. Goldberg, A. V. and Harrelson, C. 2005. Computing the shortest path: A&ast; search meets graph theory. In Proceedings of the 16th Annual ACM--SIAM Symposium on Discrete Algorithms (SODA'05). ACM, New York, 156--165."},{"key":"e_1_2_1_23_1","volume-title":"Proceedings of the 8th Workshop on Algorithm Engineering and Experiments (ALENEX'06)","author":"Goldberg A. V.","unstructured":"Goldberg , A. V. , Kaplan , H. , and Werneck , R. F . 2006. Reach for A&ast;: Efficient point-to-point shortest path algorithms . In Proceedings of the 8th Workshop on Algorithm Engineering and Experiments (ALENEX'06) . SIAM, Philadelphia, 129--143. Goldberg, A. V., Kaplan, H., and Werneck, R. F. 2006. Reach for A&ast;: Efficient point-to-point shortest path algorithms. In Proceedings of the 8th Workshop on Algorithm Engineering and Experiments (ALENEX'06). SIAM, Philadelphia, 129--143."},{"key":"e_1_2_1_24_1","volume-title":"Proceedings of the 6th Workshop on Experimental Algorithms (WEA'07)","author":"Goldberg A. V.","unstructured":"Goldberg , A. V. , Kaplan , H. , and Werneck , R. F . 2007. Better landmarks within reach . In Proceedings of the 6th Workshop on Experimental Algorithms (WEA'07) . Springer, Berlin, 38--51. Goldberg, A. V., Kaplan, H., and Werneck, R. F. 2007. Better landmarks within reach. In Proceedings of the 6th Workshop on Experimental Algorithms (WEA'07). Springer, Berlin, 38--51."},{"key":"e_1_2_1_25_1","volume-title":"Eds. DIMACS Book","volume":"74","author":"Goldberg A. V.","unstructured":"Goldberg , A. V. , Kaplan , H. , and Werneck , R. F . 2009. Reach for A&ast;: shortest path algorithms with preprocessing. 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, Providence, RI, 93--139. Goldberg, A. V., Kaplan, H., and Werneck, R. F. 2009. Reach for A&ast;: shortest path algorithms with preprocessing. 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, Providence, RI, 93--139."},{"key":"e_1_2_1_26_1","volume-title":"Proceedings of the 7th Workshop on Algorithm Engineering and Experiments (ALENEX'05)","author":"Goldberg A. V.","unstructured":"Goldberg , A. V. and Werneck , R. F . 2005. Computing point-to-point shortest paths from external, emory . In Proceedings of the 7th Workshop on Algorithm Engineering and Experiments (ALENEX'05) . SIAM, Philadelphia, 26--40. Goldberg, A. V. and Werneck, R. F. 2005. Computing point-to-point shortest paths from external, emory. In Proceedings of the 7th Workshop on Algorithm Engineering and Experiments (ALENEX'05). SIAM, Philadelphia, 26--40."},{"key":"e_1_2_1_27_1","volume-title":"Proceedings of the 6th Workshop on Algorithm Engineering and Experiments (ALENEX'04)","author":"Gutman R. J.","year":"2004","unstructured":"Gutman , R. J. 2004 . Reach-based routing: A new approach to shortest path algorithms optimized for road networks . In Proceedings of the 6th Workshop on Algorithm Engineering and Experiments (ALENEX'04) . SIAM, Philadelphia, 100--111. Gutman, R. J. 2004. Reach-based routing: A new approach to shortest path algorithms optimized for road networks. In Proceedings of the 6th Workshop on Algorithm Engineering and Experiments (ALENEX'04). SIAM, Philadelphia, 100--111."},{"key":"e_1_2_1_28_1","volume-title":"Eds. DIMACS Book","volume":"74","author":"Hilger M.","unstructured":"Hilger , M. , K\u00f6hler , E. , M\u00f6hring , R. H. , and Schilling , H . 2009. Fast point-to-point shortest path computations with ArcFlags. 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, Providence, RI, 41--72. Hilger, M., K\u00f6hler, E., M\u00f6hring, R. H., and Schilling, H. 2009. Fast point-to-point shortest path computations with ArcFlags. 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, Providence, RI, 41--72."},{"key":"e_1_2_1_29_1","volume-title":"Proceedings of the 8th Workshop on Algorithm Engineering and Experiments (ALENEX'06)","author":"Holzer M.","unstructured":"Holzer , M. , Schulz , F. , and Wagner , D . 2006. Engineering multi-level overlay graphs for shortest-path queries . In Proceedings of the 8th Workshop on Algorithm Engineering and Experiments (ALENEX'06) . SIAM, Philadelphia, 156--170. Holzer, M., Schulz, F., and Wagner, D. 2006. Engineering multi-level overlay graphs for shortest-path queries. In Proceedings of the 8th Workshop on Algorithm Engineering and Experiments (ALENEX'06). SIAM, Philadelphia, 156--170."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1064546.1180616"},{"key":"e_1_2_1_31_1","volume-title":"Proceedings of the 3rd Workshop on Experimental Algorithms (WEA'04)","author":"Holzer M.","unstructured":"Holzer , M. , Schulz , F. , and Willhalm , T . 2004. Combining speed-up techniques for Shortest path computations . In Proceedings of the 3rd Workshop on Experimental Algorithms (WEA'04) . Springer, Berlin, 269--284. Holzer, M., Schulz, F., and Willhalm, T. 2004. Combining speed-up techniques for Shortest path computations. In Proceedings of the 3rd Workshop on Experimental Algorithms (WEA'04). Springer, Berlin, 269--284."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/11427186_13"},{"key":"e_1_2_1_33_1","volume-title":"Geoinformation und Mobilit\u00e4t - von der Forschung zur praktischen Anwendung.","author":"Lauther U.","unstructured":"Lauther , U. 2004. An extremely fast, exact algorithm for finding shortest paths in static networks with geographical background . In Geoinformation und Mobilit\u00e4t - von der Forschung zur praktischen Anwendung. vol. 22 . IfGI , 219--230. Lauther, U. 2004. An extremely fast, exact algorithm for finding shortest paths in static networks with geographical background. In Geoinformation und Mobilit\u00e4t - von der Forschung zur praktischen Anwendung. vol. 22. IfGI, 219--230."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/11427186_18"},{"key":"e_1_2_1_35_1","volume-title":"SCOTCH: Static mapping, graph, mesh and hyper-graph partitioning, and parallel and sequential sparse matrix ordering package","author":"Pellegrini F.","year":"2007","unstructured":"Pellegrini , F. 2007 . SCOTCH: Static mapping, graph, mesh and hyper-graph partitioning, and parallel and sequential sparse matrix ordering package . http:\/\/www.labri.fr\/perso\/pelegrin\/scotch\/. Pellegrini, F. 2007. SCOTCH: Static mapping, graph, mesh and hyper-graph partitioning, and parallel and sequential sparse matrix ordering package. http:\/\/www.labri.fr\/perso\/pelegrin\/scotch\/."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561071_51"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/11841036_71"},{"key":"e_1_2_1_40_1","volume-title":"Proceedings of the 6th Workshop on Experimental Algorithms (WEA'07)","author":"Schultes D.","unstructured":"Schultes , D. and Sanders , P . 2007. Dynamic highway-node routing . In Proceedings of the 6th Workshop on Experimental Algorithms (WEA'07) . Springer, Berlin, 66--79. Schultes, D. and Sanders, P. 2007. Dynamic highway-node routing. In Proceedings of the 6th Workshop on Experimental Algorithms (WEA'07). Springer, Berlin, 66--79."},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/351827.384254"},{"key":"e_1_2_1_42_1","volume-title":"Proceedings of the 4th Workshop on Algorithm Engineering and Experiments (ALENEX'02)","author":"Schulz F.","unstructured":"Schulz , F. , Wagner , D. , and Zaroliagis , C . 2002. Using multi-level graphs for timetable information in railway systems . In Proceedings of the 4th Workshop on Algorithm Engineering and Experiments (ALENEX'02) . Springer, Berlin, 43--59. Schulz, F., Wagner, D., and Zaroliagis, C. 2002. Using multi-level graphs for timetable information in railway systems. In Proceedings of the 4th Workshop on Algorithm Engineering and Experiments (ALENEX'02). Springer, Berlin, 43--59."},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1064546.1103378"}],"container-title":["ACM Journal of Experimental Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1671970.1671976","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1671970.1671976","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:26:24Z","timestamp":1750278384000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1671970.1671976"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3]]},"references-count":41,"alternative-id":["10.1145\/1671970.1671976"],"URL":"https:\/\/doi.org\/10.1145\/1671970.1671976","relation":{},"ISSN":["1084-6654","1084-6654"],"issn-type":[{"value":"1084-6654","type":"print"},{"value":"1084-6654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3]]}}}