By Topic

An Ant Colony Algorithm with Stochastic Local Search for the VRP

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)
Chengming Qi ; Coll. of Autom., Beijing Union Univ., Beijing

In recent years there has been growing interest in algorithms inspired by the observation of natural phenomena to define computational procedures which can solve complex problems. In this paper, through an analysis of the constructive procedure of the solution in the ant colony system (ACS), a vehicle routing problem (VRP) is examined and a hybrid ant colony system coupled with a stochastic local search algorithm(SLSACS), is proposed. In SLSACS, only partial customers are randomly chosen to compute the transition probability. Experiments on various aspects of the algorithm and computational results for fourteen benchmark problems are reported. We compare our approach with ACS, some other classic, powerful meta-heuristics and show that our results are competitive.

Published in:

Innovative Computing Information and Control, 2008. ICICIC '08. 3rd International Conference on

Date of Conference:

18-20 June 2008