Arriving on time

DOI10.1007/S10957-005-7498-5MaRDI QIDQ2499355zbMATH OpenOpenAlexFDO

Authors R. E. Kalaba, J. E. II Moore, 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) Dynamic programming (90C39) Transportation, logistics and supply chain management (90B06) Stochastic network models in operations research (90B15)

Recommendations

• Maximizing the probability of arriving on time
• Speedup techniques for the stochastic on-time arrival problem
• Dynamic journeying under uncertainty
• Arrival time dependent routing policies in public transport
• Least expected time paths in stochastic, time-varying transportation networks

Cites work

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

Cited in

(20)

• A mean-risk model for the traffic assignment problem with stochastic travel times
• Stochastic shortest path with unlimited hops
• Optimal routing for maximizing the travel time reliability
• Arrival time dependent routing policies in public transport
• Dynamic journeying under uncertainty
• Vehicle routing problem with stochastic travel times including soft time windows and service costs
• Computing constrained shortest-paths at scale
• Robust adaptive routing under uncertainty
• Meeting a deadline: shortest paths on stochastic directed acyclic graphs with information gathering
• A multi-objective approach for PH-graphs with applications to stochastic shortest paths
• Markov decision processes associated with two threshold probability criteria
• Speedup techniques for the stochastic on-time arrival problem
• Mean‐standard deviation model for minimum cost flow problem
• A new model for path planning with interval data
• A simple ant colony optimizer for stochastic shortest path problems
• Robust routing, its price, and the tradeoff between routing robustness and travel time reliability in road networks
• The constrained reliable shortest path problem in stochastic time-dependent networks
• Dynamic traveling salesman problem with stochastic release dates
• Solving the stochastic time-dependent orienteering problem with time windows
• Maximizing the probability of arriving on time

This page was built for publication: Arriving on time

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