Abstract
Contraction Hierarchies (CH) are one of the most relevant techniques for accelerating shortest path-queries on road networks in practice. We reconsider the CH query routine and devise an additional preprocessing step which gathers auxiliary information such that CH queries can be answered even faster than before. Compared to the standard CH query, response times decrease by more than 70%; compared to a well-known refined CH query routine with so-called stall-on-demand, response times still decrease by more than 33% on average. While faster speed-up schemes like hub labels incur a serious space overhead, our precomputed auxiliary information takes less space than the graph representation itself.
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
References
OpenStreetMap. https://www.openstreetmap.org/
Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: Hierarchical hub labelings for shortest paths. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 24–35. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-33090-2_4
Bast, H., et al.: Route planning in transportation networks. CoRR, abs/1504.05140 (2015)
Bast, H., Funke, S., Matijevic, D., Sanders, P., Schultes, D.: In transit to constant time shortest-path queries in road networks. In: ALENEX. SIAM (2007)
Bast, H., Funke, S., Sanders, P., Schultes, D.: Fast routing in road networks with transit nodes. Science 316(5824), 566 (2007)
Bauer, R., Delling, D.: SHARC: fast and robust unidirectional routing. In: ALENEX, pp. 13–26. SIAM (2008)
Blum, J., Funke, S., Storandt, S.: Sublinear search spaces for shortest path planning in grid and road networks. In: AAAI, pp. 6119–6126. AAAI Press (2018)
Dementiev, R., Kettner, L., Sanders, P.: STXXL: standard template library for XXL data sets. Softw. Pract. Exper. 38(6), 589–637 (2008)
Funke, S., Storandt, S.: Provable efficiency of contraction hierarchies with randomized preprocessing. In: Elbassioni, K., Makino, K. (eds.) ISAAC 2015. LNCS, vol. 9472, pp. 479–490. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-48971-0_41
Geisberger, R., Sanders, P., Schultes, D., Vetter, C.: Exact routing in large road networks using contraction hierarchies. Transp. Sci. 46(3), 388–404 (2012)
Goldberg, A.V., Kaplan, H., Werneck, R.F.: Reach for a*: efficient point-to-point shortest path algorithms. In: ALENEX, pp. 129–143. SIAM (2006)
Gutman, R.J.: Reach-based routing: a new approach to shortest path algorithms optimized for road networks. In: ALENEX/ANALCO, pp. 100–111. SIAM (2004)
Sanders, P., Schultes, D.: Engineering highway hierarchies. ACM J. Exp. Algorithmics, 17(1) (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Funke, S., Mendel, T. (2019). Improved Contraction Hierarchy Queries via Perfect Stalling. In: Kotsireas, I., Pardalos, P., Parsopoulos, K., Souravlias, D., Tsokas, A. (eds) Analysis of Experimental Algorithms. SEA 2019. Lecture Notes in Computer Science(), vol 11544. Springer, Cham. https://doi.org/10.1007/978-3-030-34029-2_11
Download citation
DOI: https://doi.org/10.1007/978-3-030-34029-2_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-34028-5
Online ISBN: 978-3-030-34029-2
eBook Packages: Computer ScienceComputer Science (R0)