A Heuristic Search Approach for a Nonstationary Stochastic Shortest Path Problem with Terminal Cost
From MaRDI portal
Publication:4408693
DOI10.1287/trsc.36.2.218.562zbMath1134.90323OpenAlexW2055923132MaRDI QIDQ4408693
James L. Bander, Chelsea C. III 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
Stochastic network models in operations research (90B15) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (5)
Arrival time dependent routing policies in public transport ⋮ The dynamic shortest path problem with anticipation ⋮ Time-dependent routing problems: a review ⋮ Dynamic journeying under uncertainty ⋮ An AO* Based Exact Algorithm for the Canadian Traveler Problem
This page was built for publication: A Heuristic Search Approach for a Nonstationary Stochastic Shortest Path Problem with Terminal Cost
