Can I read A Hybrid Ant Colony Algorithm Based on Multiple Strategies for the Vehicle Routing Problem with Time Windows on EtoBox?

A Hybrid Ant Colony Algorithm Based on Multiple Strategies for the Vehicle Routing Problem with Time Windows by Hongguang Wu; Yuelin Gao; Wanting Wang; Ziyu Zhang is a Computer Science article available to read on EtoBox.

What is A Hybrid Ant Colony Algorithm Based on Multiple Strategies for the Vehicle Routing Problem with Time Windows about?

Abstract In 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.

Who reads A Hybrid Ant Colony Algorithm Based on Multiple Strategies for the Vehicle Routing Problem with Time Windows?

Author

Hongguang Wu; Yuelin Gao; Wanting Wang; Ziyu Zhang

Publisher

Springer Science and Business Media LLC

Published

2021

Language

EN

Field

Computer Science (Physical Sciences)