Skip to main content
SpringerLink
Log in

Seamless Interpolation Between Contraction Hierarchies and Hub Labels for Fast and Space-Efficient Shortest Path Queries in Road Networks

  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 2020)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12273))

Included in the following conference series:

Abstract

We propose a conceptually simple, yet very effective extension of the highly popular Contraction Hierarchies (CH) speedup technique improving query times for shortest paths in road networks by one order of magnitude with very modest space overhead. Using our scheme we are able to answer queries on continental-sized road networks with more than half a billion edges in the microseconds range on standard workstation hardware. Previous approaches that are considerably faster than CH were only for shortest path distance queries (recovering the actual path required additional effort and space) or suffered from humongous space consumption hindering their practicality for large real-world road networks. Our approach can be interpreted as a seamless interpolation between Contraction Hierarchies and Hub Labels.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. OpenStreetMap (2020). https://www.openstreetmap.org/

  2. 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.) SEA 2011. LNCS, vol. 6630, pp. 230–241. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-20662-7_20

    Chapter  Google Scholar 

  3. 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

    Chapter  Google Scholar 

  4. Arz, J., Luxen, D., Sanders, P.: Transit node routing reconsidered. In: Bonifaci, V., Demetrescu, C., Marchetti-Spaccamela, A. (eds.) SEA 2013. LNCS, vol. 7933, pp. 55–66. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-38527-8_7

    Chapter  Google Scholar 

  5. Bast, H., et al.: Route planning in transportation networks. CoRR, abs/1504.05140 (2015)

    Google Scholar 

  6. Bast, H., Funke, S., Matijevic, D., Sanders, P., Schultes, D.: In transit to constant time shortest-path queries in road networks. In: Proceedings of the ALENEX. SIAM (2007)

    Google Scholar 

  7. Bast, H., Funke, S., Sanders, P., Schultes, D.: Fast routing in road networks with transit nodes. Science 316(5824), 566 (2007)

    Article  MathSciNet  Google Scholar 

  8. Bauer, R., Delling, D.: SHARC: fast and robust unidirectional routing. In: Proceedings of the ALENEX, pp. 13–26. SIAM (2008)

    Google Scholar 

  9. 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, 2.1–2.31 (2010)

    MathSciNet  MATH  Google Scholar 

  10. Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. In: SODA, pp. 937–946. ACM/SIAM (2002)

    Google Scholar 

  11. Delling, D., Goldberg, A.V., Werneck, R.F.: Hub label compression. In: Bonifaci, V., Demetrescu, C., Marchetti-Spaccamela, A. (eds.) SEA 2013. LNCS, vol. 7933, pp. 18–29. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-38527-8_4

    Chapter  Google Scholar 

  12. Geisberger, R., Sanders, P., Schultes, D., Vetter, C.: Exact routing in large road networks using contraction hierarchies. Transportation Science 46(3), 388–404 (2012)

    Article  Google Scholar 

  13. Gutman, R.J.: Reach-based routing: a new approach to shortest path algorithms optimized for road networks. In: Proceedings of the ALENEX/ANALCO, pp. 100–111. SIAM (2004)

    Google Scholar 

  14. Kosowski, A., Viennot, L.: Beyond highway dimension: small distance labels using tree skeletons. In: SODA, pp. 1462–1478. SIAM (2017)

    Google Scholar 

  15. Li, Y., Leong Hou, U., Yiu, M.L., Kou, N.M.: An experimental study on hub labeling based shortest path algorithms. Proc. VLDB Endow. 11(4), 445–457 (2017)

    Article  Google Scholar 

  16. Luxen, D., Vetter, C.: Real-time routing with OpenStreetMap data. In: Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, GIS 2011, pp. 513–516. ACM, New York (2011)

    Google Scholar 

  17. Sanders, P., Schultes, D.: Engineering highway hierarchies. ACM J. Exp. Algorithmics 17(1), 1.1–1.40 (2012)

    MathSciNet  MATH  Google Scholar 

  18. Schultes, D.: Route planning in road networks. Ph.D. thesis, Universität Karlsruhe (2008)

    Google Scholar 

  19. Schultes, D., Sanders, P.: Dynamic highway-node routing. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol. 4525, pp. 66–79. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-72845-0_6

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Stuttgart, Stuttgart, Germany

    Stefan Funke

Authors
  1. Stefan Funke
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Stefan Funke .

Editor information

Editors and Affiliations

  1. Georgia State University, Atlanta, USA

    Donghyun Kim

  2. Department of Mathematics and Physics, North Carolina Central University, Durham, NC, USA

    R. N. Uma

  3. Computer Science, Georgia State University, Atlanta, GA, USA

    Zhipeng Cai

  4. Korea University, Seoul, Korea (Republic of)

    Dong Hoon Lee

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Funke, S. (2020). Seamless Interpolation Between Contraction Hierarchies and Hub Labels for Fast and Space-Efficient Shortest Path Queries in Road Networks. In: Kim, D., Uma, R., Cai, Z., Lee, D. (eds) Computing and Combinatorics. COCOON 2020. Lecture Notes in Computer Science(), vol 12273. Springer, Cham. https://doi.org/10.1007/978-3-030-58150-3_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-58150-3_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-58149-7

  • Online ISBN: 978-3-030-58150-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation