A Heuristic Search Approach for a Nonstationary Stochastic Shortest Path Problem with Terminal Cost

DOI10.1287/TRSC.36.2.218.562zbMATH Open1134.90323OpenAlexW2055923132MaRDI QIDQ4408693FDOQ4408693

Authors: James L. Bander, Chelsea C. White 

Publication date: 29 June 2003

Published in: Transportation Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/trsc.36.2.218.562

Recommendations

• Stochastic shortest path problems with recourse
• An Analysis of Stochastic Shortest Path Problems
• Shortest paths in stochastic networks with correlated link costs
• scientific article; zbMATH DE number 1300391
• scientific article; zbMATH DE number 3869088

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Stochastic network models in operations research (90B15)

Cited In (6)

• Arrival time dependent routing policies in public transport
• Dynamic journeying under uncertainty
• An \(\mathrm{AO}^{*}\) based exact algorithm for the Canadian traveler problem
• Time-dependent routing problems: a review
• Heuristics for the stochastic/dynamic user-optimal route choice problem
• The dynamic shortest path problem with anticipation

This page was built for publication: A Heuristic Search Approach for a Nonstationary Stochastic Shortest Path Problem with Terminal Cost

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