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

DOI10.1016/j.cor.2021.105671OpenAlexW4200031930MaRDI QIDQ2669733

Andrés L. Medaglia, Daniel Yamín, 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)

Uses Software

• JGraphT
• GitHub

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• 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
• Least possible time paths in stochastic, time-varying networks.
• A directed hypergraph model for random time dependent shortest paths
• Finding the most reliable strategy on stochastic and time-dependent transportation networks: a hypergraph based formulation
• Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
• 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
• Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• JGraphT—A Java Library for Graph Data Structures and Algorithms

This page was built for publication: Exact bidirectional algorithm for the least expected travel-time path problem on stochastic and time-dependent networks