An improved ant colony optimization and its application to vehicle routing problem with time windows

Authors:
Qiulei Ding;Xiangpei Hu;Lijun Sun;Yunzeng Wang
Affiliations:
School of Business Administration, Dongbei University of Finance and Economics, Dalian 116025, China and Institute of Systems Engineering, Dalian University of Technology, Dalian 116023, China;Institute of Systems Engineering, Dalian University of Technology, Dalian 116023, China;Institute of Systems Engineering, Dalian University of Technology, Dalian 116023, China;A. Gary Anderson Graduate School of Management, University of California, Riverside, CA 92521, USA
Venue:
Neurocomputing
Year:
2012

Citing 9
Cited 2

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

Annals of Operations Research - Special issue on Tabu search
MAX-MIN Ant system

Future Generation Computer Systems
The vehicle routing problem

The vehicle routing problem
D-Ants: savings based ants divide and conquer the vehicle routing problem

Computers and Operations Research
An improved ant colony algorithm for fuzzy clustering in image segmentation

Neurocomputing
Ant colony optimization for the two-dimensional loading vehicle routing problem

Computers and Operations Research
ACO-based hybrid classification system with feature subset selection and model parameters optimization

Neurocomputing
An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows

Computers and Operations Research
Ant system: optimization by a colony of cooperating agents

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

Optimization of the material flow in a manufacturing plant by use of artificial bee colony algorithm

Expert Systems with Applications: An International Journal
An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

The ant colony optimization (ACO), inspired from the foraging behavior of ant species, is a swarm intelligence algorithm for solving hard combinatorial optimization problems. The algorithm, however, has the weaknesses of premature convergence and low search speed, which greatly hinder its application. To improve the performance of the algorithm, a hybrid ant colony optimization (HACO) is presented in this paper. By adjusting pheromone approach and introducing a disaster operator, the HACO prevents the search process from getting trapped in the local optimal solution. Then, by taking the candidate list into consideration and combining the ACO with the saving algorithm and @l-interchange mechanism, the HACO improves the convergence speed. Furthermore, this paper gives a guideline on how to adjust the parameters to achieve the good performance of the algorithm. Finally, the HACO is applied to solve the vehicle routing problem with time windows. The effectiveness of the HACO on solving combinatorial optimization problems is validated by comparing the computational results with those previously presented in the literature.