Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Experimental Algorithms

SEA 2013: Experimental Algorithms pp 30–42Cite as

Faster Customization of Road Networks

  • Conference paper

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

Abstract

A wide variety of algorithms can answer exact shortest-path queries in real time on continental road networks, but they typically require significant preprocessing effort. Recently, the customizable route planning (CRP) approach has reduced the time to process a new cost function to a fraction of a minute. We reduce customization time even further, by an order of magnitude. This makes it worthwhile even when a single query is to be run, enabling a host of new applications.

This is a preview of subscription content, 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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Project OSRM (2012), http://project-osrm.org/

  2. 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)

    Chapter  Google Scholar 

  3. Abraham, I., Fiat, A., Goldberg, A.V., Werneck, R.F.: Highway Dimension, Shortest Paths, and Provably Efficient Algorithms. In: SODA, pp. 782–793 (2010)

    Google Scholar 

  4. Bader, R., Dees, J., Geisberger, R., Sanders, P.: Alternative Route Graphs in Road Networks. In: Marchetti-Spaccamela, A., Segal, M. (eds.) TAPAS 2011. LNCS, vol. 6595, pp. 21–32. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  5. Bast, H., Funke, S., Sanders, P., Schultes, D.: Fast Routing in Road Networks with Transit Nodes. Science 316(5824), 566 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  6. Bauer, R., Columbus, T., Katz, B., Krug, M., Wagner, D.: Preprocessing Speed-Up Techniques is Hard. In: Calamoneri, T., Diaz, J. (eds.) CIAC 2010. LNCS, vol. 6078, pp. 359–370. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  7. Bauer, R., Delling, D.: SHARC: Fast and Robust Unidirectional Routing. ACM JEA 14(2.4), 1–29 (2009)

    MathSciNet  Google Scholar 

  8. 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 JEA 15(2.3), 1–31 (2010)

    MathSciNet  Google Scholar 

  9. Bellman, R.: On a routing problem. Q. Appl. Math. 16(1), 87–90 (1958)

    MATH  Google Scholar 

  10. Columbus, T.: Search space size in contraction hierarchies. Master’s thesis, Karlsruhe Institute of Technology (2012)

    Google Scholar 

  11. Delling, D., Goldberg, A.V., Pajor, T., Werneck, R.F.: Customizable Route Planning. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol. 6630, pp. 376–387. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  12. Delling, D., Goldberg, A.V., Razenshteyn, I., Werneck, R.F.: Graph Partitioning with Natural Cuts. In: Proc. IPDPS, pp. 1135–1146. IEEE Computer Society (2011)

    Google Scholar 

  13. Demetrescu, C., Goldberg, A.V., Johnson, D.S. (eds.): The Shortest Path Problem: 9th DIMACS Implementation Challenge. DIMACS Book, vol. 74. AMS (2009)

    Google Scholar 

  14. Dijkstra, E.W.: A Note on Two Problems in Connexion with Graphs. Numerische Mathematik 1, 269–271 (1959)

    Article  MathSciNet  MATH  Google Scholar 

  15. Floyd, R.W.: Algorithm 97 (shortest paths). Comm. ACM 5(6), 345 (1962)

    Article  Google Scholar 

  16. Ford Jr., L.R., Fulkerson, D.R.: Flows in Networks. Princeton U. Press (1962)

    Google Scholar 

  17. Funke, S., Storandt, S.: Polynomial-time Construction of Contraction Hierarchies for Multi-criteria Queries. In: Proc. ALENEX, pp. 41–54. SIAM (2013)

    Google Scholar 

  18. Geisberger, R., Sanders, P., Schultes, D., Vetter, C.: Exact Routing in Large Road Networks Using Contraction Hierarchies. Transportation Sci. 46(3), 388–404 (2012)

    Article  Google Scholar 

  19. Geisberger, R., Vetter, C.: Efficient Routing in Road Networks with Turn Costs. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol. 6630, pp. 100–111. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  20. Goldberg, A.V.: A Practical Shortest Path Algorithm with Linear Expected Time. SIAM J. Comp. 37, 1637–1655 (2008)

    Article  MATH  Google Scholar 

  21. Goldberg, A.V., Kaplan, H., Werneck, R.F.: Reach for A*: Shortest Path Algorithms with Preprocessing. In: Demetrescu, et al. (eds.) [13], pp. 93–139

    Google Scholar 

  22. Hilger, M., Köhler, E., Möhring, R.H., Schilling, H.: Fast Point-to-Point Shortest Path Computations with Arc-Flags. In: Demetrescu, et al. (eds.) [13], pp. 41–72

    Google Scholar 

  23. Holzer, M., Schulz, F., Wagner, D.: Engineering Multi-Level Overlay Graphs for Shortest-Path Queries. ACM JEA 13(2.5), 1–26 (2008)

    MathSciNet  Google Scholar 

  24. Luxen, D., Sanders, P.: Hierarchy Decomposition and Faster User Equilibria on Road Networks. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol. 6630, pp. 242–253. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  25. Milosavljevic, N.: On optimal preprocessing for contraction hierarchies. In: Proc. SIGSPATIAL IWCTS, pp. 6:1–6:6 (2012)

    Google Scholar 

  26. Yanagisawa, H.: A multi-source label-correcting algorithm for the all-pairs shortest paths problem. In: Proc. IPDPS, pp. 1–10 (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Microsoft Research Silicon Valley, USA

    Daniel Delling & Renato F. Werneck

Authors
  1. Daniel Delling
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Renato F. Werneck
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Systems Analysis and Computer Science (IASI), National Research Council (CNR), Viale Manzoni 30, 00185, Rome, Italy

    Vincenzo Bonifaci

  2. Department of Computer and Systems Science, Sapienza University of Rome, Via Ariosto 25, 00185, Rome, Italy

    Camil Demetrescu  & Alberto Marchetti-Spaccamela  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Delling, D., Werneck, R.F. (2013). Faster Customization of Road Networks. In: Bonifaci, V., Demetrescu, C., Marchetti-Spaccamela, A. (eds) Experimental Algorithms. SEA 2013. Lecture Notes in Computer Science, vol 7933. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38527-8_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38527-8_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38526-1

  • Online ISBN: 978-3-642-38527-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation