By Topic

Binary and Continuous Ant Colony Algorithms Research for Solving Continuous Global Optimization 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

2 Author(s)
Zhang Qin ; Dept. of Electr. Eng., Zhejiang Univ., Hangzhou ; Wang Xiong-hai

The paper presents two formalizations, called binary (BACO) and continuous (CACO) ant colony optimization, for the design of ant colony algorithm (ACOA) to solve continuous global optimization problem. With different coding methods and ACOA decision policies, BACO and CACO have distinct characters. In this paper, BACO adopts disturbance factor and CACO uses adaptive search steps to avoid premature convergence, and both of them combine with dynamic evaporation factor to find the best solution, then a convergence proof is presented. The differences of performance between them are compared in the optimization problem of multi-dimension and multi-minima continuous function, especially with the adaptive genetic algorithm (AGA), and experimental result shows that CACO is effective as it outperforms BACO and AGA.

Published in:

Intelligent Networks and Intelligent Systems, 2008. ICINIS '08. First International Conference on

Date of Conference:

1-3 Nov. 2008