scholarly journals Algorithms for the multi-objective vehicle routing problem with hard time windows and stochastic travel time and service time

2018 ◽  
Vol 70 ◽  
pp. 66-79 ◽  
Author(s):  
Douglas M. Miranda ◽  
Juergen Branke ◽  
Samuel V. Conceição
Keyword(s):  
Travel Time ◽  
Vehicle Routing ◽  
Service Time ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Routing Problem ◽  
Multi Objective ◽  
Hard Time ◽  
Stochastic Travel Time

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.

Sign in / Sign up

Export Citation Format

Share Document