A priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times

2016 ◽  
Vol 249 (1) ◽  
pp. 55-66 ◽  
Author(s):  
F. Errico ◽  
G. Desaulniers ◽  
M. Gendreau ◽  
W. Rei ◽  
L.-M. Rousseau
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
A Priori ◽  
Routing Problem ◽  
Hard Time ◽  
Service Times

scholarly journals The vehicle routing problem with hard time windows and stochastic service times

2018 ◽  
Vol 7 (3) ◽  
pp. 223-251 ◽  
Author(s):  
F. Errico ◽  
G. Desaulniers ◽  
M. Gendreau ◽  
W. Rei ◽  
L.-M. Rousseau
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Routing Problem ◽  
Hard Time ◽  
Service Times

scholarly journals A hybrid ant colony algorithm based on multiple strategies for the vehicle routing problem with time windows

2021 ◽  
Author(s):  
Hongguang Wu ◽  
Yuelin Gao ◽  
Wanting Wang ◽  
Ziyu Zhang
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Ant Colony Algorithm ◽  
Time Window ◽  
Time Windows ◽  
Ant Colony ◽  
Routing Problem ◽  
Multiple Strategies ◽  
Hard Time ◽  
Mutation Operation

AbstractIn this paper, we propose a vehicle routing problem with time windows (TWVRP). In this problem, we consider a hard time constraint that the fleet can only serve customers within a specific time window. To solve this problem, a hybrid ant colony (HACO) algorithm is proposed based on ant colony algorithm and mutation operation. The HACO algorithm proposed has three innovations: the first is to update pheromones with a new method; the second is the introduction of adaptive parameters; and the third is to add the mutation operation. A famous Solomon instance is used to evaluate the performance of the proposed algorithm. Experimental results show that HACO algorithm is effective against solving the problem of vehicle routing with time windows. Besides, the proposed algorithm also has practical implications for vehicle routing problem and the results show that it is applicable and effective in practical problems.

scholarly journals Skill Vehicle Routing Problem With Time Windows Considering Dynamic Service Times and Time-Skill-Dependent Costs

IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 77208-77221 ◽  
Author(s):  
Xiaoyuan Yan ◽  
Boping Xiao ◽  
Yiyong Xiao ◽  
Zhonghao Zhao ◽  
Lin Ma ◽  
...  
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Routing Problem ◽  
Service Times
Sign in / Sign up

Export Citation Format

Share Document