Urban Freight Management with Stochastic Time-Dependent Travel Times and Application to Large-Scale Transportation Networks

Abstract

This paper addressed the vehicle routing problem (VRP) in large-scale urban transportation networks with stochastic timedependent (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 timedependent 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.

A stochastic time-dependent green capacitated vehicle routing and scheduling problem with time window, resiliency and reliability: a case study

“…Traffic time can be affected by different accidents such as raining, car accident and other reasons (Duan et al, 2015). There are few studies considering both stochastic and time dependency (Lecluyse et al, 2009;Taş et al, 2014;Sun et al, 2015;Zhang et al, 2016). The green objective is directly associated with the elapsed time in traffic, thus considering this objective together makes sense.…”

Review of Urban Transportation Network Design Problems Based on CiteSpace

“…In reality, multiple paths consideration in urban network design is able to decrease a large number of emissions. Sun and Duan et al [63] provided vehicle routing problem solution for large-scale urban transportation networks without increase in freight cost and environmental impacts.…”

Discrete Optimization Model and Algorithm for Driver Planning in Periodic Driver Routing Problem

“…And this problem is the extension of the vehicle routing problem. Other extension problems include dynamic vehicle routing problem and stochastic time-dependent vehicle routing problem (see, e.g., Xu, Pu, and Duan [6]; Sun, Duan, and Yang [7]). In order to improve customers' satisfaction, many smallpackage shipping companies focus on service consistency, which attracts scholars' attention as well.…”