Optimal routing for maximizing the travel time reliability

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

Yueyue Fan, Yu (Marco) Nie

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 programmingreliabilitysuccessive approximationshortest path problemstochastic networks

Mathematics Subject Classification ID

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

Related Items (16)

Optimal path problems with second-order stochastic dominance constraints ⋮ A new multi-objective competitive open vehicle routing problem solved by particle swarm optimization ⋮ Finding reliable shortest paths in road networks under uncertainty ⋮ Linear programming formulation for strategic dynamic traffic assignment ⋮ Finding efficient and environmentally friendly paths for risk-averse freight carriers ⋮ Meeting a deadline: shortest paths on stochastic directed acyclic graphs with information gathering ⋮ Arrival time dependent routing policies in public transport ⋮ Finding the most reliable strategy on stochastic and time-dependent transportation networks: a hypergraph based formulation ⋮ Robust routing, its price, and the tradeoff between routing robustness and travel time reliability in road networks ⋮ Algorithms for non-linear and stochastic resource constrained shortest path ⋮ Optimal stopping with a probabilistic constraint ⋮ Quantifying and Managing Uncertainty in Piecewise-Deterministic Markov Processes ⋮ Mean‐standard deviation model for minimum cost flow problem ⋮ Markov decision processes associated with two threshold probability criteria ⋮ Range-constrained traffic assignment with multi-modal recharge for electric vehicles ⋮ Reliability in public transit networks considering backup itineraries

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

This page was built for publication: Optimal routing for maximizing the travel time reliability