Title :
A modified Ant Colony Algorithm with local search for capacitated vehicle routing problem
Author_Institution :
Beijing Union Univ., Beijing, China
Abstract :
The ant system is a metaheuristic developed for the solution of hard combinatorial optimization problems. Capacitated vehicle routing problem(CVRP) is an important combinatorial optimization problem which has received considerable attention in the last decades. In this paper, through an analysis of the constructive procedure of the solution in the Ant Colony Algorithm (ACA), a CVRP is examined and a hybrid ant colony system coupled with a stochastic local search algorithm(ACAPLS), is proposed. We compare our approach with ACA, some other classic, powerful meta-heuristics and show that our results are competitive.
Keywords :
optimisation; search problems; transportation; ant colony algorithm; ant system; capacitated vehicle routing problem; hard combinatorial optimization problem; hybrid ant colony system; stochastic local search algorithm; Algorithm design and analysis; Ant colony optimization; Computational intelligence; Computer industry; Costs; Intelligent vehicles; Routing; Stochastic systems; Testing; Traveling salesman problems; Ant colony algorithm; Capacitated vehicle routing problem; Combinatorial optimization; Pareto local search;
Conference_Titel :
Computational Intelligence and Industrial Applications, 2009. PACIIA 2009. Asia-Pacific Conference on
Conference_Location :
Wuhan
Print_ISBN :
978-1-4244-4606-3
DOI :
10.1109/PACIIA.2009.5406543
