Finding reliable shortest paths in road networks under uncertainty
DOI10.1007/s11067-012-9175-1zbMath1332.90032OpenAlexW2057983864WikidataQ58208758 ScholiaQ58208758MaRDI QIDQ264260
Agachai Sumalee, Zhixiang Fang, Hu Shao, William H. K. Lam, Bi Yu Chen, Qingquan Li
Publication date: 31 March 2016
Published in: Networks and Spatial Economics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11067-012-9175-1
advanced traveller information systempre-trip planning applicationreliable shortest path problemtravel time reliability
Programming involving graphs or networks (90C35) Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)
Related Items (25)
Cites Work
- Optimal path problems with second-order stochastic dominance constraints
- A cumulative perceived value-based dynamic user equilibrium model considering the travelers' risk evaluation on arrival time
- Multi-objective and multi-constrained non-additive shortest path problems
- An efficient solution algorithm for solving multi-class reliability-based traffic assignment problem
- A reliability-based stochastic traffic assignment model for network with multiple user classes under uncertainty in demand
- Optimal routing for maximizing the travel time reliability
- Extended dominance and a stochastic shortest path problem
- An empirical investigation of some bicriterion shortest path algorithms
- Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks
- A label correcting approach for solving bicriterion shortest-path problems
- Network-based accessibility measures for vulnerability analysis of degradable transportation networks
- High-Performance Heuristics for Optimization in Stochastic Traffic Engineering Problems
- On a routing problem
- A Mean-Variance Model for Route Guidance in Advanced Traveler Information Systems
- On the online shortest path problem with limited arc cost dependencies
- Fibonacci heaps and their uses in improved network optimization algorithms
- Stochastic Shortest Paths Via Quasi-convex Maximization
- Shortest Paths in Probabilistic Graphs
This page was built for publication: Finding reliable shortest paths in road networks under uncertainty