The Constrained Reliable Shortest Path Problem in Stochastic Time-Dependent Networks

DOI10.1287/opre.2020.2089zbMath1469.90044OpenAlexW3155727026MaRDI QIDQ5003704

Gunther Gust, Dirk Neumann, Matthias Ruß

Publication date: 29 July 2021

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.2020.2089

zbMATH Keywords

resource constraintsmultiobjective \(A^*\) searchreliable route planning

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• The constrained shortest path problem with stochastic correlated link travel times
• Multicriteria heuristic search.
• On the robust shortest path problem.
• Least possible time paths in stochastic, time-varying networks.
• Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks
• Arriving on time
• A survey of resource constrained shortest path problems: Exact solution approaches
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• Multiobjective A ^* search with consistent heuristics
• Multiobjective A*
• A Mean-Variance Model for Route Guidance in Advanced Traveler Information Systems
• Robust Adaptive Routing Under Uncertainty
• Shortest Paths in Probabilistic Graphs

This page was built for publication: The Constrained Reliable Shortest Path Problem in Stochastic Time-Dependent Networks