By Topic

An ant colony optimization algorithm based on dynamic evaporation rate fitting

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
$33 $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

2 Author(s)
Chen Hao ; Institute of Computer Science and Technology, Soochow University, Suzhou, China ; Liu Quan

The study of swarm intelligence is more and more popular, much study have been done on swarm intelligence such as ACO (Ant Colony Optimization), and many applications also have been made in the field of combinatorial optimization. However, when solving combinatorial optimization problems, especially these problems with large scale, slow convergence and easy to fall into stagnation still restraint algorithm to be much more widely used. This paper presents the DERFACO (An ACO Algorithm Based on Dynamic Evaporation Rate Fitting) algorithm, using a mechanism of dynamic evaporation rate, which can achieve better balance between solution efficiency and solution quality, avoiding algorithm falling into local optimal. Experiments show that the DERFACO algorithm has better performance, its convergence rate increase by 12% or more. Furthermore, the DERFACO on other classic TSP instances also shows good performance.

Published in:

Communication Software and Networks (ICCSN), 2011 IEEE 3rd International Conference on

Date of Conference:

27-29 May 2011