The dynamic shortest path problem with anticipation
From MaRDI portal
Publication:852944
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
Cites work
- scientific article; zbMATH DE number 3591262 (Why is no real title available?)
- scientific article; zbMATH DE number 1206370 (Why is no real title available?)
- scientific article; zbMATH DE number 1300391 (Why is no real title available?)
- scientific article; zbMATH DE number 700091 (Why is no real title available?)
- scientific article; zbMATH DE number 1093829 (Why is no real title available?)
- scientific article; zbMATH DE number 1445281 (Why is no real title available?)
- scientific article; zbMATH DE number 956788 (Why is no real title available?)
- A Heuristic Search Approach for a Nonstationary Stochastic Shortest Path Problem with Terminal Cost
- A Stochastic Formulation of the Dynamic Assignment Problem, with an Application to Truckload Motor Carriers
- Dynamic Shortest Paths in Acyclic Networks with Markovian Arc Costs
- Dynamic routing for priority shipments in LTL service networks
- Dynamic shortest path in stochastic dynamic networks: Ship routing problem
- Dynamic vehicle routing: Status and prospects
- Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks
- Improved results for route planning in stochastic transportation networks
- Least expected time paths in stochastic, time-varying transportation networks
- Least possible time paths in stochastic, time-varying networks.
- On the online shortest path problem with limited arc cost dependencies
- Robust path choice in networks with failures
- Stochastic shortest path problems with recourse
- Supply chain management with guaranteed delivery
Cited in
(9)- Digital traveler assistant
- Algorithms – ESA 2004
- Time-dependent routing problems: a review
- How much the grid network and rescuers' communication can improve the rescue efficiency in worst-case analysis
- Stochastic shortest path with unlimited hops
- Reconstructing freeway travel times with a simplified network flow model alternating the adopted fundamental diagram
- Dynamic journeying under uncertainty
- The covering Canadian traveller problem
- Dynamic shortest path problems: hybrid routing policies considering network disruptions
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)
