Optimal routing for maximizing the travel time reliability

DOI10.1007/s11067-006-9287-6zbMath1128.90015MaRDI QIDQ862490

Yu (Marco) Nie, Yueyue Fan

Publication date: 24 January 2007

Published in: Networks and Spatial Economics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11067-006-9287-6

zbMATH Keywords

dynamic programming; reliability; successive approximation; shortest path problem; stochastic networks

Mathematics Subject Classification ID

90B15: Stochastic network models in operations research

90C39: Dynamic programming

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Minimizing risk models in stochastic shortest path problems
• Minimising a threshold probability in discounted Markov decision processes
• Shortest paths in stochastic networks with correlated link costs
• Arriving on time
• Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks
• Stochastic Shortest Path Problems with Piecewise-Linear Concave Utility Functions
• Optimal paths in graphs with stochastic or multidimensional weights
• On a routing problem
• The Stochastic Shortest Route Problem
• On the online shortest path problem with limited arc cost dependencies
• Algorithms for minimum-cost paths in time-dependent networks with waiting policies
• ON A NEW APPROACH TO THE NUMERICAL SOLUTION OF A CLASS OF PARTIAL DIFFERENTIAL INTEGRAL EQUATIONS OF TRANSPORT THEORY
• An Appraisal of Some Shortest-Path Algorithms
• Shortest Paths in Probabilistic Graphs