Multi-objective optimal path finding in stochastic time-dependent transportation networks considering timeliness reliability and travel expense

2016 ◽  
Author(s):  
Yuting Li ◽  
Linhan Guo
Keyword(s):  
Transportation Networks ◽  
Optimal Path ◽  
Time Dependent ◽  
Path Finding ◽  
Multi Objective ◽  
Stochastic Time ◽  
Travel Expense

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

2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
Shichao Sun ◽  
Zhengyu Duan ◽  
Dongyuan Yang
Keyword(s):  
Large Scale ◽  
Time Window ◽  
Transportation Networks ◽  
Optimal Path ◽  
Time Dependent ◽  
Travel Times ◽  
Urban Network ◽  
Routing Problem ◽  
On The Road ◽  
Stochastic Time

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.

Multi-objective path finding in stochastic time-dependent road networks using non-dominated sorting genetic algorithm

2015 ◽  
Vol 42 (12) ◽  
pp. 5056-5064 ◽  
Author(s):  
Mojtaba Rajabi-Bahaabadi ◽  
Afshin Shariat-Mohaymany ◽  
Mohsen Babaei ◽  
Chang Wook Ahn
Keyword(s):  
Genetic Algorithm ◽  
Road Networks ◽  
Time Dependent ◽  
Path Finding ◽  
Multi Objective ◽  
Stochastic Time
Sign in / Sign up

Export Citation Format

Share Document