Skip to main content
SpringerLink
Log in

A Dynamic Discretization Discovery Algorithm for the Minimum Duration Time-Dependent Shortest Path Problem

  • Conference paper
  • First Online:
Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2018)

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

Abstract

We present an exact algorithm for the Minimum Duration Time-Dependent Shortest Path Problem with piecewise linear arc travel time functions. The algorithm iteratively refines a time-expanded network model, which allows for the computation of a lower and an upper bound, until - in a finite number of iterations - an optimal solution is obtained.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and 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

Institutional subscriptions

References

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

  2. Dean, B.C.: Shortest paths in FIFO time-dependent networks: theory and algorithms. Rapport technique, Massachusetts Institute of Technology (2004)

    Google Scholar 

  3. Demiryurek, U., Banaei-Kashani, F., Shahabi, C., Ranganathan, A.: Online computation of fastest path in time-dependent spatial networks. In: Pfoser, D., Tao, Y., Mouratidis, K., Nascimento, M.A., Mokbel, M., Shekhar, S., Huang, Y. (eds.) SSTD 2011. LNCS, vol. 6849, pp. 92–111. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-22922-0_7

    Chapter  Google Scholar 

  4. Gunturi, V.M., Joseph, K., Shekhar, S., Carley, K.M.: Information lifetime aware analysis for dynamic social networks. Technical report, University of Minnesota (2012)

    Google Scholar 

  5. Foschini, L., Hershberger, J., Suri, S.: On the complexity of time-dependent shortest paths. Algorithmica 68(4), 1075–1097 (2014)

    Article  MathSciNet  Google Scholar 

  6. Orda, A., Rom, R.: Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length. J. ACM (JACM) 37(3), 607–625 (1990)

    Article  MathSciNet  Google Scholar 

  7. Nachtigall, K.: Time depending shortest-path problems with applications to railway networks. Eur. J. Oper. Res. 83(1), 154–166 (1995)

    Article  Google Scholar 

  8. Ding, B., Yu, J.X., Qin, L.: Finding time-dependent shortest paths over large graphs. In: Proceedings of the 11th International Conference on Extending Database Technology: Advances in Database Technology, pp. 205–216. ACM (2008)

    Google Scholar 

  9. Kanoulas, E., Du, Y., Xia, T., Zhang, D.: Finding fastest paths on a road network with speed patterns. In: Proceedings of the 22nd International Conference on Data Engineering, ICDE 2006, p. 10. IEEE (2006)

    Google Scholar 

  10. Boland, N., Hewitt, M., Marshall, L., Savelsbergh, M.: The continuous-time service network design problem. Oper. Res. 65(5), 1303–1321 (2017)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

This material is based upon work supported by the National Science Foundation under Grant No. 1662848.

Author information

Authors and Affiliations

  1. H. Milton Steward School of Industrial and Systems Engineering, Georgia Institute of Technology, 765 Ferst Dr, Atlanta, GA, 30332, USA

    Edward He, Natashia Boland, George Nemhauser & Martin Savelsbergh

Authors
  1. Edward He
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Natashia Boland
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. George Nemhauser
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Martin Savelsbergh
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Edward He or Natashia Boland .

Editor information

Editors and Affiliations

  1. Carnegie Mellon University, Pittsburgh, Pennsylvania, USA

    Willem-Jan van Hoeve

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

He, E., Boland, N., Nemhauser, G., Savelsbergh, M. (2018). A Dynamic Discretization Discovery Algorithm for the Minimum Duration Time-Dependent Shortest Path Problem. In: van Hoeve, WJ. (eds) Integration of Constraint Programming, Artificial Intelligence, and Operations Research. CPAIOR 2018. Lecture Notes in Computer Science(), vol 10848. Springer, Cham. https://doi.org/10.1007/978-3-319-93031-2_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-93031-2_21

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-93030-5

  • Online ISBN: 978-3-319-93031-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation