Abstract
Contraction hierarchies (CH) is a two-phase effective shortest path algorithm for large-scale road networks based on node contraction. However, the remaining graphs tend to be complete near the end of preprocessing, which slows down the preprocessing speed. We combine CH with the all-pairs shortest paths (APSP) problem algorithms which are efficient on complete graphs, to propose a new method. Near the end of the CH preprocessing phase, we use the APSP algorithm to obtain a distance table that contains the shortest path between all remaining nodes. Query performs a bidirectional Dijkstra search combined with a table lookup. Experimental results show that our method achieves both preprocessing and query acceleration compared to the raw CH algorithm. It allows for parameter adjustment based on spatial requirements and can be interpreted as an interpolation between CH and APSP algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: A hub-based labeling algorithm for shortest paths in road networks. In: Pardalos, P.M., Rebennack, S. (eds.) Experimental Algorithms, pp. 230–241. Springer, Berlin Heidelberg, Berlin, Heidelberg (2011). https://doi.org/10.1007/978-3-642-20662-7_20
Arz, J., Luxen, D., Sanders, P.: Transit node routing reconsidered. In: Bonifaci, V., Demetrescu, C., Marchetti-Spaccamela, A. (eds.) Experimental Algorithms, pp. 55–66. Springer, Berlin Heidelberg, Berlin, Heidelberg (2013). https://doi.org/10.1007/978-3-642-38527-8_7
Bauer, R., Columbus, T., Rutter, I., Wagner, D.: Search-space size in contraction hierarchies. Theoret. Comput. Sci. 645, 112–127 (2016)
Bauer, R., Delling, D., Sanders, P., Schieferdecker, D., Schultes, D., Wagner, D.: Combining hierarchical and goal-directed speed-up techniques for dijkstra’s algorithm. ACM J. Exp. Algorithmics 15 (2010)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge, MA, USA (2001)
Demetrescu, C., Johnson, D.S., Goldberg, A.V.: The Shortest Path Problem: Ninth Dimacs Implementation Challenge (2009)
Dijkstra, E.: A note on two problems in Connexion with graphs. Numer. Math. 1, 269–271 (1959)
Funke, S.: Seamless interpolation between contraction hierarchies and hub labels for fast and space-efficient shortest path queries in road networks. In: Kim, D., Uma, R.N., Cai, Z., Lee, D.H. (eds.) Computing and Combinatorics, pp. 123–135. Springer International Publishing, Cham (2020). https://doi.org/10.1007/978-3-030-58150-3_10
Geisberger, R., Sanders, P., Schultes, D., Delling, D.: Contraction hierarchies: faster and simpler hierarchical routing in road networks. In: McGeoch, C.C. (ed.) Experimental Algorithms, pp. 319–333. Springer, Berlin Heidelberg, Berlin, Heidelberg (2008). https://doi.org/10.1007/978-3-540-68552-4_24
Goldberg, A., Harrelson, C.: Computing the shortest path: a* search meets graph theory, Tech. Rep., MSR-TR-2004-24 (2004). https://www.microsoft.com/en-us/research/publication/computing-the-shortest-path-a-search-meets-graph-theory/
Gutman, R.J.: Reach-based routing: a new approach to shortest path algorithms optimized for road networks. In: ALENEX/ANALC, pp. 100–111 (2004)
Lauther, U.: 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, pp. 219–230. IfGI prints, Institut für Geoinformatik, Münster (2004)
Sanders, P., Schultes, D.: Highway hierarchies hasten exact shortest path queries. In: Brodal, G.S., Leonardi, S. (eds.) Algorithms - ESA 2005, pp. 568–579. Springer, Berlin Heidelberg, Berlin, Heidelberg (2005). https://doi.org/10.1007/11561071_51
Schultes, D., Sanders, P.: Dynamic highway-node routing. In: Demetrescu, C. (ed.) Experimental Algorithms, pp. 66–79. Springer, Berlin Heidelberg, Berlin, Heidelberg (2007). https://doi.org/10.1007/978-3-540-72845-0_6
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Song, X., Jiang, Z., Yang, W., Gao, S. (2024). Improving Contraction Hierarchies by Combining with All-Pairs Shortest Paths Problem Algorithms. In: Wu, W., Guo, J. (eds) Combinatorial Optimization and Applications. COCOA 2023. Lecture Notes in Computer Science, vol 14462. Springer, Cham. https://doi.org/10.1007/978-3-031-49614-1_32
Download citation
DOI: https://doi.org/10.1007/978-3-031-49614-1_32
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-49613-4
Online ISBN: 978-3-031-49614-1
eBook Packages: Computer ScienceComputer Science (R0)