Maximizing the probability of arriving on time

DOI10.1007/978-3-642-39408-9_11MaRDI QIDQ2843062zbMATH OpenOpenAlexFDO

Authors Joao Cassamano

Publication date 9 August 2013

Published in Analytical and Stochastic Modeling Techniques and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-39408-9_11

zbMATH Keywords

dynamic programmingroutingstochastic networks

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Dynamic programming (90C39)

Recommendations

• Arriving on time
• Speedup techniques for the stochastic on-time arrival problem
• Arrival probability in the stochastic networks with an established discrete time Markov chain
• Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks
• Dynamic journeying under uncertainty

Cited in

(6)

• Multi-cost bounded tradeoff analysis in MDP
• Meeting a deadline: shortest paths on stochastic directed acyclic graphs with information gathering
• Arriving on time
• Speedup techniques for the stochastic on-time arrival problem
• Arrival probability in the stochastic networks with an established discrete time Markov chain
• Optimal departure-time advice in road networks with stochastic disruptions

This page was built for publication: Maximizing the probability of arriving on time

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