Applying a hybrid ant colony system to the vehicle routing problem

Authors:
Chia-Ho Chen;Ching-Jung Ting;Pei-Chann Chang
Affiliations:
Department of Industrial Engineering and Management, Yuan Ze University, Taoyuan, Taiwan,R.O.C.;Department of Industrial Engineering and Management, Yuan Ze University, Taoyuan, Taiwan,R.O.C.;Department of Industrial Engineering and Management, Yuan Ze University, Taoyuan, Taiwan,R.O.C.
Venue:
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
Year:
2005

Citing 6
Cited 1

Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem

Annals of Operations Research - Special issue on Tabu search
A Subpath Ejection Method for the Vehicle Routing Problem

Management Science
A tabu search algorithm for the vehicle routing problem

Computers and Operations Research
A genetic algorithm for the vehicle routing problem

Computers and Operations Research
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Two composite methods for soft drink distribution problem

Advances in Engineering Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

The vehicle routing problem (VRP) has been extensively studied because of the interest in its application in logistics and supply chain management. In this paper, we develop a hybrid algorithm (IACS-SA) that combines the strengths of improved ant colony system (IACS) and simulated annealing (SA) algorithm. The results of computational experiments on fourteen VRP benchmark problems show that our IACS-SA produces better solutions than those of other ACS in the literature. The results also indicate that such a hybrid algorithm is comparable with other meta-heuristic algorithms.