Exact bidirectional algorithm for the least expected travel-time path problem on stochastic and time-dependent networks
DOI10.1016/J.COR.2021.105671OpenAlexW4200031930MaRDI QIDQ2669733FDOQ2669733
Authors: Daniel Yamín, Andrés L. Medaglia, A. Arun Prakash 
Publication date: 9 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2021.105671
Recommendations
- Least expected time paths in stochastic schedule-based transit networks
- The constrained shortest path problem with stochastic correlated link travel times
- Stochastic scenario-based time-stage optimization model for the least expected time shortest path problem
- Least expected time paths in stochastic, time-varying transportation networks
- A dynamic discretization discovery algorithm for the minimum duration time-dependent shortest path problem
transportation networksstochastic and time-dependent networkspulse algorithmdynamic and random travel timesleast expected travel time
Cites Work
- Network flows. Theory, algorithms, and applications.
- JGraphT—A Java Library for Graph Data Structures and Algorithms
- A note on two problems in connexion with graphs
- Least possible time paths in stochastic, time-varying networks.
- Least expected time paths in stochastic, time-varying transportation networks
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- A directed hypergraph model for random time dependent shortest paths
- Ranking paths in stochastic time-dependent networks
- An exact method for the biobjective shortest path problem for large-scale road networks
- Adaptive least-expected time paths in stochastic, time-varying transportation and data networks
- Solving the orienteering problem with time windows via the pulse framework
- On an exact method for the constrained shortest path problem
- Acceleration strategies for the weight constrained shortest path problem with replenishment
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- Finding the most reliable strategy on stochastic and time-dependent transportation networks: a hypergraph based formulation
Uses Software
This page was built for publication: Exact bidirectional algorithm for the least expected travel-time path problem on stochastic and time-dependent networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2669733)
