The dynamic shortest path problem with anticipation

DOI10.1016/j.ejor.2005.09.019zbMath1100.90042OpenAlexW1994569469MaRDI QIDQ852944

Barrett W. Thomas, Chelsea C. III White

Publication date: 15 November 2006

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.09.019

zbMATH Keywords

Markov decision processesroutingreal-time decision making

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Markov and semi-Markov decision processes (90C40)

Related Items (7)

Dynamic shortest path problems: hybrid routing policies considering network disruptions ⋮ Time-dependent routing problems: a review ⋮ How much the grid network and rescuers' communication can improve the rescue efficiency in worst-case analysis ⋮ The covering Canadian traveller problem ⋮ Dynamic journeying under uncertainty ⋮ Stochastic shortest path with unlimited hops ⋮ Reconstructing freeway travel times with a simplified network flow model alternating the adopted fundamental diagram

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Least possible time paths in stochastic, time-varying networks.
• Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks
• Dynamic shortest path in stochastic dynamic networks: Ship routing problem
• Dynamic vehicle routing: Status and prospects
• Dynamic Routing for Priority Shipments in LTL Service Networks
• Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks
• Supply Chain Management with Guaranteed Delivery
• A Stochastic Formulation of the Dynamic Assignment Problem, with an Application to Truckload Motor Carriers
• A Heuristic Search Approach for a Nonstationary Stochastic Shortest Path Problem with Terminal Cost
• Robust path choice in networks with failures
• On the online shortest path problem with limited arc cost dependencies
• Stochastic shortest path problems with recourse
• Dynamic Shortest Paths in Acyclic Networks with Markovian Arc Costs

This page was built for publication: The dynamic shortest path problem with anticipation