Reliability in stochastic time-dependent traffic networks with correlated link travel times

Author(s):  
Wei Dong ◽  
Minyi Li ◽  
Quoc Bao Vo ◽  
Hai L. Vu
2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
Shichao Sun ◽  
Zhengyu Duan ◽  
Dongyuan Yang

This paper addressed the vehicle routing problem (VRP) in large-scale urban transportation networks with stochastic time-dependent (STD) travel times. The subproblem which is how to find the optimal path connecting any pair of customer nodes in a STD network was solved through a robust approach without requiring the probability distributions of link travel times. Based on that, the proposed STD-VRP model can be converted into solving a normal time-dependent VRP (TD-VRP), and algorithms for such TD-VRPs can also be introduced to obtain the solution. Numerical experiments were conducted to address STD-VRPTW of practical sizes on a real world urban network, demonstrated here on the road network of Shenzhen, China. The stochastic time-dependent link travel times of the network were calibrated by historical floating car data. A route construction algorithm was applied to solve the STD problem in 4 delivery scenarios efficiently. The computational results showed that the proposed STD-VRPTW model can improve the level of customer service by satisfying the time-window constraint under any circumstances. The improvement can be very significant especially for large-scale network delivery tasks with no more increase in cost and environmental impacts.


4OR ◽  
2009 ◽  
Vol 7 (4) ◽  
pp. 363-377 ◽  
Author(s):  
C. Lecluyse ◽  
T. Van Woensel ◽  
H. Peremans

Author(s):  
Monika Filipovska ◽  
Hani S. Mahmassani ◽  
Archak Mittal

Transportation research has increasingly focused on the modeling of travel time uncertainty in transportation networks. From a user’s perspective, the performance of the network is experienced at the level of a path, and, as such, knowledge of variability of travel times along paths contemplated by the user is necessary. This paper focuses on developing approaches for the estimation of path travel time distributions in stochastic time-varying networks so as to capture generalized correlations between link travel times. Specifically, the goal is to develop methods to estimate path travel time distributions for any path in the networks by synthesizing available trajectory data from various portions of the path, and this paper addresses that problem in a two-fold manner. Firstly, a Monte Carlo simulation (MCS)-based approach is presented for the convolution of time-varying random variables with general correlation structures and distribution shapes. Secondly, a combinatorial data-mining approach is developed, which aims to utilize sparse trajectory data for the estimation of path travel time distributions by implicitly capturing the complex correlation structure in the network travel times. Numerical results indicate that the MCS approach allowing for time-dependence and a time-varying correlation structure outperforms other approaches, and that its performance is robust with respect to different path travel time distributions. Additionally, using the path segmentations from the segment search approach with a MCS approach with time-dependence also produces accurate and robust estimates of the path travel time distributions with the added benefit of shorter computation times.


2021 ◽  
pp. 105487
Author(s):  
Tobia Calogiuri ◽  
Gianpaolo Ghiani ◽  
Emanuela Guerriero ◽  
Emanuele Manni

Sign in / Sign up

Export Citation Format

Share Document