A hybrid algorithm for time-dependent vehicle routing problem with soft time windows and stochastic factors

2022 ◽  
Vol 109 ◽  
pp. 104606
Author(s):  
Ke-Wei Jie ◽  
San-Yang Liu ◽  
Xiao-Jun Sun
2014 ◽  
Vol 505-506 ◽  
pp. 1071-1075
Author(s):  
Yi Sun ◽  
Yue Chen ◽  
Chang Chun Pan ◽  
Gen Ke Yang

This paper presents a real road network case based on the time dependent vehicle routing problem with time windows (TDVRPTW), which involves optimally routing a fleet of vehicles with fixed capacity when traffic conditions are time dependent and services at customers are only available in their own time tables. A hybrid algorithm based on the Genetic Algorithm (GA) and the Multi Ant Colony System (MACS) is introduced in order to find optimal solutions that minimize two hierarchical objectives: the number of tours and the total travel cost. The test results show that the integrated algorithm outperforms both of its traditional ones in terms of the convergence speed towards optimal solutions.


2020 ◽  
Vol 20 (2) ◽  
pp. 549-598
Author(s):  
Ampol Karoonsoontawong ◽  
Puntipa Punyim ◽  
Wanvara Nueangnitnaraporn ◽  
Vatanavongs Ratanavaraha

2015 ◽  
Vol 36 (3) ◽  
pp. 283-300 ◽  
Author(s):  
Tharinee Manisri ◽  
Anan Mungwattana ◽  
Gerrit K. Janssens ◽  
An Caris

Sign in / Sign up

Export Citation Format

Share Document