Dynamic shortest path problems: hybrid routing policies considering network disruptions

DOI10.1016/j.cor.2013.06.014zbMath1348.90189OpenAlexW2057734091MaRDI QIDQ336651

Tom Van Woensel, Derya Sever, Nico P. Dellaert, Ton G. de Kok

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2013.06.014

zbMATH Keywords

transportationdynamic programmingdisruption handlingdynamic shortest path problemoffline routingonline routing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Markov and semi-Markov decision processes (90C40) Traffic problems in operations research (90B20)

Related Items (3)

Model and methods to address urban road network problems with disruptions ⋮ Priority-oriented route network planning for evacuation in constrained space scenarios ⋮ Balanced-flow algorithm for path network planning in hierarchical spaces

Uses Software

• SPSS

Cites Work

• The dynamic shortest path problem with anticipation
• A new model for path planning with interval data
• Statistical decision functions which minimize the maximum risk
• Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks
• Q-Learning and Enhanced Policy Iteration in Discounted Dynamic Programming
• An Analysis of Stochastic Shortest Path Problems
• Robust path choice in networks with failures
• On the online shortest path problem with limited arc cost dependencies
• Stochastic shortest path problems with recourse

This page was built for publication: Dynamic shortest path problems: hybrid routing policies considering network disruptions