Travel time reliability in transportation networks: A review of methodological developments

Z Zang, X Xu, K Qu, R Chen, A Chen - Transportation Research Part C …, 2022 - Elsevier
The unavoidable travel time variability in transportation networks, resulted from the
widespread supply-side and demand-side uncertainties, makes travel time reliability (TTR) …

An exact algorithm for the mean–standard deviation shortest path problem

A Khani, SD Boyles - Transportation Research Part B: Methodological, 2015 - Elsevier
This paper studies the reliable path problem in the form of minimizing the sum of mean and
standard deviation of path travel time. For the case of independent link travel times, we show …

Pareto optimal path generation algorithm in stochastic transportation networks

M Owais, A Alshehri - IEEE Access, 2020 - ieeexplore.ieee.org
Routing problems play a crucial part in urban transportation network operation and
management. This study addresses the problem of finding a set of non-dominated shortest …

Robust shortest path problem with distributional uncertainty

Y Zhang, S Song, ZJM Shen… - IEEE transactions on …, 2017 - ieeexplore.ieee.org
Routing service considering uncertainty is at the core of intelligent transportation systems
and has attracted increasing attention. Existing stochastic shortest path models require the …

Lagrangian relaxation for the reliable shortest path problem with correlated link travel times

Y Zhang, ZJM Shen, S Song - Transportation Research Part B …, 2017 - Elsevier
Finding a reliable shortest path (RSP) in a stochastic network is a fundamental problem in
transportation science. Link travel time correlation significantly affects path reliability, but …

Robust dynamic train regulation integrated with stop-skipping strategy in urban rail networks: An outer approximation based solution method

Z Chen, A D'Ariano, S Li, ML Tessitore, L Yang - Omega, 2024 - Elsevier
In dense urban rail networks with high passenger demands, uncertain disturbances occur
frequently, and the resulting train delays will likely spread over the whole network rapidly …

The k-th order mean-deviation model for route choice under uncertainty

Y Liu, F Xiao, M Shen, L Zhao, L Li - Transportation Research Part E …, 2024 - Elsevier
This study introduces the k-th order mean-deviation model for optimizing route choice within
large, stochastic, and time-variant networks. This model addresses the limitations of the …

Reliable shortest path finding in stochastic time-dependent road network with spatial-temporal link correlations: A case study from Beijing

P Chen, R Tong, B Yu, Y Wang - Expert Systems with Applications, 2020 - Elsevier
In view of the time-dependent characteristic of travel times in road networks and the travel
time reliability (TTR) requirements by different travelers, it is complicated and time …

A multi-period location-allocation model for nursing home network planning under uncertainty

S Khodaparasti, ME Bruni, P Beraldi, HR Maleki… - Operations Research for …, 2018 - Elsevier
This paper proposes a multi-period location-allocation problem arising in nursing home
network planning. We present a strategic model in which the improvement of service …

Reliable lifelong planning A*: Technique for re-optimizing reliable shortest paths when travel time distribution updating

W Teng, BY Chen - Transportation Research Part E: Logistics and …, 2024 - Elsevier
Re-optimization technique is an efficient approach for solving the shortest path problem in
dynamic deterministic networks, where link travel times are updated in real-time. However …