By Topic

An Ant Colony Optimization Algorithm Based on the Nearest Neighbor Node Choosing Rules and the Crossover Operator

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

3 Author(s)
Shu Yunxing ; Luoyang Inst. of Sci. & Technol., Luoyang ; Guo Junen ; Ge Bo

The ant colony optimization algorithm (ACO) has a powerful capacity to find out solutions to combinatorial optimization problems, but it still has two defects, namely, it is slow in convergence speed and is prone to falling in the local optimal solution. Against the deficiencies of this algorithm, in this study we proposed an ACO based on basic ACO algorithm based on well-distributed on the initiation, the nearest neighbor node choosing rules and with crossover operator. In the initiation of the algorithm, the convergence speed of the ACO is increased by distributing the ant colony evenly in all the cities and adopting the nearest neighbor choosing node rule and making crossover computation among better individual ants at the end of each round of cycle when each ant chooses the next city. The experiment results indicate that the ACO proposed in this study is valid.

Published in:

Computer Science and Software Engineering, 2008 International Conference on  (Volume:1 )

Date of Conference:

12-14 Dec. 2008