The dynamic shortest path problem with anticipation

DOI10.1016/J.EJOR.2005.09.019zbMATH Open1100.90042OpenAlexW1994569469MaRDI QIDQ852944FDOQ852944

Authors: Barrett W. Thomas, Chelsea C. 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

Recommendations

• Shortest paths in stochastic networks with correlated link costs
• Solving an Instantaneous Dynamic User-Optimal Route Choice Model
• Anticipation in dynamic vehicle routing
• Dynamic Shortest Paths in Acyclic Networks with Markovian Arc Costs
• Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks

zbMATH Keywords

Markov decision processesroutingreal-time decision making

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Least possible time paths in stochastic, time-varying networks.
• Dynamic vehicle routing: Status and prospects
• Least expected time paths in stochastic, time-varying transportation networks
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Dynamic shortest path in stochastic dynamic networks: Ship routing problem
• A Stochastic Formulation of the Dynamic Assignment Problem, with an Application to Truckload Motor Carriers
• Improved results for route planning in stochastic transportation networks
• Title not available (Why is that?)
• Robust path choice in networks with failures
• Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks
• A Heuristic Search Approach for a Nonstationary Stochastic Shortest Path Problem with Terminal Cost
• Title not available (Why is that?)
• Dynamic routing for priority shipments in LTL service networks
• Supply Chain Management with Guaranteed Delivery
• Title not available (Why is that?)

Cited In (8)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q852944)