Skip to main content
SpringerLink
Log in

Fast paths in large-scale dynamic road networks

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

Efficiently computing fast paths in large-scale dynamic road networks (where dynamic traffic information is known over a part of the network) is a practical problem faced by traffic information service providers who wish to offer a realistic fast path computation to GPS terminal enabled vehicles. The heuristic solution method we propose is based on a highway hierarchy-based shortest path algorithm for static large-scale networks; we maintain a static highway hierarchy and perform each query on the dynamically evaluated network, using a simple algorithm to propagate available dynamic traffic information over a larger part of the road network. We provide computational results that show the efficacy of our approach.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ahuja, R., Orlin, J., Pallottino, S., Scutellà, M.: Dynamic shortest paths minimizing travel times and costs. Networks 41(4), 197–205 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  2. Buriol, L., Resende, M., Thorup, M.: Speeding up dynamic shortest path algorithms. INFORMS J. Comput. (2008). DOI: 10.1287/ijoc.1070.0231

    MathSciNet  Google Scholar 

  3. Chabini, I.: Discrete dynamic shortest path problems in transportation applications: complexity and algorithms with optimal run time. Transp. Res. Rec. 1645, 170–175 (1998)

    Article  Google Scholar 

  4. Chabini, I., Shan, L.: Adaptations of the A * algorithm for the computation of fastest paths in deterministic discrete-time dynamic networks. IEEE Trans. Intell. Transp. Syst. 3(1), 60–74 (2002)

    Article  Google Scholar 

  5. Chan, E., Zhang, N.: Finding shortest paths in large network systems. In: GIS’01: Proceedings of the 9th ACM International Symposium on Advances in Geographic Information Systems, pp. 160–166. Assoc. Comput. Mach., New York (2001)

    Chapter  Google Scholar 

  6. Cooke, K., Halsey, E.: The shortest route through a network with time-dependent internodal transit times. J. Math. Anal. Appl. 14, 493–498 (1966)

    Article  MATH  MathSciNet  Google Scholar 

  7. Dean, B.: Shortest paths in FIFO time-dependent networks: theory and algorithms. Technical Report, MIT, Cambridge, MA (2004)

  8. Delling, D., Wagner, D.: Landmark-based routing in dynamic graphs. In: Demetrescu, C. (ed.) WEA 2007—Workshop on Experimental Algorithms. Lecture Notes in Computer Science, vol. 4525. Springer, New York (2007)

    Chapter  Google Scholar 

  9. Dijkstra, E.: A note on two problems in connexion with graphs. Numer. Math. 1, 269–271 (1959)

    Article  MATH  MathSciNet  Google Scholar 

  10. Dreyfus, S.: An appraisal of some shortest-path algorithms. Oper. Res. 17(3), 395–412 (1969)

    Article  MATH  Google Scholar 

  11. Flatberg, T., Hasle, G., Kloster, O., Nilssen, E., Riise, A.: Dynamic and stochastic aspects in vehicle routing—a literature survey. Technical Report STF90A05413, SINTEF, Oslo, Norway (2005)

  12. Goldberg, A., Kaplan, H., Werneck, R.: Reach for A *: Efficient point-to-point shortest path algorithms. In: Demetrescu, C., Sedgewick, R., Tamassia, R. (eds.) ALENEX 2005. SIAM, Philadelphia (2005)

    Google Scholar 

  13. Holzer, M., Schulz, F., Wagner, D.: Engineering multi-level overlay graphs for shortest-path queries. In: Proceedings of the 8th Workshop on Algorithm Engineering. Lecture Notes in Computer Science, vol. 129, pp. 156–170. SIAM, Philadelphia (2006)

    Google Scholar 

  14. Kerner, B.S.: The Physics of Traffic. Springer, Berlin (2004)

    Google Scholar 

  15. NV, T.: Tele Atlas Multinet ShapeFile 4.3.1 Format Specifications. TeleAtlas NV, May 2005

  16. Sanders, P., Schultes, D.: Highway hierarchies hasten exact shortest path queries. In: Stølting Brodal, G., Leonardi, S. (eds.) ESA. Lecture Notes in Computer Science, vol. 3669, pp. 568–579. Springer, Berlin (2005)

    Google Scholar 

  17. Sanders, P., Schultes, D.: Engineering highway hierarchies. In: ESA 2006. Lecture Notes in Computer Science, vol. 4168, pp. 804–816. Springer, Berlin (2006)

    Chapter  Google Scholar 

  18. Sanders, P., Schultes, D.: Dynamic highway-node routing. In: Demetrescu, C. (ed.) WEA 2007—Workshop on Experimental Algorithms. Lecture Notes in Computer Science, vol. 4525, pp. 66–79. Springer, New York (2007)

    Chapter  Google Scholar 

  19. Sanders, P., Schultes, D.: Engineering fast route planning algorithms. In: Demetrescu, C. (ed.) WEA 2007—Workshop on Experimental Algorithms. Lecture Notes in Computer Science, vol. 4525, pp. 23–36. Springer, New York (2007)

    Chapter  Google Scholar 

  20. Schultes, D.: Fast and exact shortest path queries using highway hierarchies. Master Thesis, Informatik, Universität des Saarlandes, June 2005

Download references

Author information

Authors and Affiliations

  1. LIX, École Polytechnique, 91128, Palaiseau, France

    Giacomo Nannicini, Philippe Baptiste, Daniel Krob & Leo Liberti

  2. Mediamobile, 10 rue d’Oradour sur Glane, Paris, France

    Giacomo Nannicini & Gilles Barbier

Authors
  1. Giacomo Nannicini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Philippe Baptiste
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gilles Barbier
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Daniel Krob
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Leo Liberti
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Giacomo Nannicini.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nannicini, G., Baptiste, P., Barbier, G. et al. Fast paths in large-scale dynamic road networks. Comput Optim Appl 45, 143–158 (2010). https://doi.org/10.1007/s10589-008-9172-y

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10589-008-9172-y

Keywords

Search

Navigation