The dynamic shortest path problem with anticipation

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

Chelsea C. III White, Barrett W. Thomas

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 processes; routing; real-time decision making

Mathematics Subject Classification ID

90C27: Combinatorial optimization

90C40: Markov and semi-Markov decision processes

Related Items

Stochastic shortest path with unlimited hops

Cites Work

• 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
• On the online shortest path problem with limited arc cost dependencies
• Dynamic Shortest Paths in Acyclic Networks with Markovian Arc Costs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item