Ranking paths in stochastic time-dependent networks

DOI10.1016/j.ejor.2013.10.022zbMath1304.90057OpenAlexW2107387902MaRDI QIDQ2514742

Lars Relund Nielsen, Kim Allan Andersen, Daniele Pretolani

Publication date: 3 February 2015

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11380/1005323

zbMATH Keywords

rankingshortest pathsroutingstochastic time-dependent networks

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Stochastic network models in operations research (90B15)

Related Items (6)

Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem ⋮ Finding the most reliable strategy on stochastic and time-dependent transportation networks: a hypergraph based formulation ⋮ The constrained shortest path problem with stochastic correlated link travel times ⋮ Time-dependent routing problems: a review ⋮ Exact bidirectional algorithm for the least expected travel-time path problem on stochastic and time-dependent networks ⋮ Fuzzy multi-objective chance-constrained programming model for hazardous materials transportation

Cites Work

• Decremental algorithm for adaptive routing incorporating traveler information
• Optimal information location for adaptive routing
• A directed hypergraph model for random time dependent shortest paths
• Finding the \(K\) shortest hyperpaths
• On finding dissimilar paths
• Adaptive least-expected time paths in stochastic, time-varying transportation and data networks
• Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks
• Bicriterion Shortest Paths in Stochastic Time-Dependent Networks
• Minimum weight paths in time-dependent networks
• Transit Service and Path Choice Models in Stochastic and Time-Dependent Networks
• Finding the K Shortest Loopless Paths in a Network

This page was built for publication: Ranking paths in stochastic time-dependent networks