Arriving on time

DOI10.1007/s10957-005-7498-5zbMath1130.90410OpenAlexW2058135791MaRDI QIDQ2499355

J. E. II Moore, Robert E. Kalaba, Yueyue Fan

Publication date: 14 August 2006

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-005-7498-5

zbMATH Keywords

dynamic programmingstochastic shortest path problemsconvolution integralsOptimal routing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Stochastic network models in operations research (90B15) Dynamic programming (90C39)

Related Items (18)

Meeting a deadline: shortest paths on stochastic directed acyclic graphs with information gathering ⋮ Arrival time dependent routing policies in public transport ⋮ Vehicle routing problem with stochastic travel times including soft time windows and service costs ⋮ Optimal routing for maximizing the travel time reliability ⋮ A multi-objective approach for PH-graphs with applications to stochastic shortest paths ⋮ Robust routing, its price, and the tradeoff between routing robustness and travel time reliability in road networks ⋮ Mean‐standard deviation model for minimum cost flow problem ⋮ A simple ant colony optimizer for stochastic shortest path problems ⋮ Solving the stochastic time-dependent orienteering problem with time windows ⋮ Dynamic journeying under uncertainty ⋮ Markov decision processes associated with two threshold probability criteria ⋮ Stochastic shortest path with unlimited hops ⋮ A new model for path planning with interval data ⋮ Robust Adaptive Routing Under Uncertainty ⋮ Dynamic traveling salesman problem with stochastic release dates ⋮ The Constrained Reliable Shortest Path Problem in Stochastic Time-Dependent Networks ⋮ A Mean-Risk Model for the Traffic Assignment Problem with Stochastic Travel Times ⋮ Computing Constrained Shortest-Paths at Scale

Cites Work

• Minimizing risk models in Markov decision processes with policies depending on target values
• Dynamic programming and pseudo-inverses
• Minimising a threshold probability in discounted Markov decision processes
• Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks
• Optimal paths in graphs with stochastic or multidimensional weights
• The Stochastic Shortest Route Problem
• On the online shortest path problem with limited arc cost dependencies
• An Appraisal of Some Shortest-Path Algorithms
• Shortest Paths in Probabilistic Graphs

This page was built for publication: Arriving on time