The dynamic shortest path problem with time-dependent stochastic disruptions

The dynamic shortest path problem with time-dependent stochastic disruptions consists of finding a route with a minimum expected travel time from an origin to a destination using both historical and real-time information. The problem is formulated as a discrete time finite horizon Markov decision process and it is solved by a hybrid Approximate Dynamic Programming (ADP) algorithm with a clustering approach using a deterministic lookahead policy and value function approximation. The algorithm is tested on a number of network configurations which represent different network sizes and disruption levels. Computational results reveal that the proposed hybrid ADP algorithm provides high quality solutions with a reduced computational effort.

• Record URL:
  • https://doi.org/10.1016/j.trc.2018.04.018
• Record URL:
  • http://www.sciencedirect.com/science/article/pii/S0968090X1830531X
• Availability:
  • Find a library where document is available. Order URL: http://worldcat.org/issn/0968090X
• Supplemental Notes:
  • Abstract reprinted with permission of Elsevier.
• Authors:
  • Sever, Derya
  • Zhao, Lei
  • Dellaert, Nico
  • Demir, Emrah
  • van Woensel, Tom
  • De Kok, Ton
• Publication Date: 2018-7

Language

• English

Media Info

• Media Type: Web
• Features: Appendices; Figures; References; Tables;
• Pagination: pp 42-57
• Serial:
  • Transportation Research Part C: Emerging Technologies
  • Volume: 92
  • Issue Number: 0
  • Publisher: Elsevier
  • ISSN: 0968-090X
  • Serial URL: http://www.sciencedirect.com/science/journal/0968090X

Subject/Index Terms

• TRT Terms: Dynamic programming; Service disruption; Shortest path algorithms; Stochastic processes; Time dependence
• Subject Areas: Highways; Operations and Traffic Management; Planning and Forecasting;

Filing Info

• Accession Number: 01673798
• Record Type: Publication
• Files: TRIS
• Created Date: Jun 27 2018 10:42AM