Exact bidirectional algorithm for the least expected travel-time path problem on stochastic and time-dependent networks

DOI10.1016/J.COR.2021.105671MaRDI QIDQ2669733zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

transportation networksstochastic and time-dependent networkspulse algorithmdynamic and random travel timesleast expected travel time

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

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

Cites work

• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• A directed hypergraph model for random time dependent shortest paths
• A note on two problems in connexion with graphs
• Acceleration strategies for the weight constrained shortest path problem with replenishment
• Adaptive least-expected time paths in stochastic, time-varying transportation and data networks
• An exact method for the biobjective shortest path problem for large-scale road networks
• 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
• JGraphT—A Java Library for Graph Data Structures and Algorithms
• Least expected time paths in stochastic, time-varying transportation networks
• Least possible time paths in stochastic, time-varying networks.
• Network flows. Theory, algorithms, and applications.
• On an exact method for the constrained shortest path problem
• Ranking paths in stochastic time-dependent networks
• Solving the orienteering problem with time windows via the pulse framework

Describes a project that uses

Uses Software

• GitHub
• JGraphT

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)