System Maintenance:
There may be intermittent impact on performance while updates are in progress. We apologize for the inconvenience.
By Topic

A modified Ant Colony Algorithm with local search for capacitated vehicle routing problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Mingping Xia ; Beijing Union Univ., Beijing, China

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.

Published in:

Computational Intelligence and Industrial Applications, 2009. PACIIA 2009. Asia-Pacific Conference on  (Volume:2 )

Date of Conference:

28-29 Nov. 2009