Application of ant colony algorithm for continuous space optimization

Aim to the disadvantages that ant colony optimization is not applied to continuous optimization problems and easy to get into local optimum, a fast global ant colony algorithm is proposed. In this algorithm the searching way that searches near the best solution and makes the best solution as the ini...

Full description

Saved in:
Bibliographic Details
Published in2009 Chinese Control and Decision Conference pp. 1993 - 1996
Main Authors Gao Hong, Hou Li-gang, Su Cheng-li
Format Conference Proceeding
LanguageChinese
English
Published IEEE 01.06.2009
Subjects
Ant colony algorithm
Ant colony optimization
Continuous optimization
Control engineering
Global optimization
Local optimum
Testing
Online AccessGet full text

Cover

More Information
Summary:Aim to the disadvantages that ant colony optimization is not applied to continuous optimization problems and easy to get into local optimum, a fast global ant colony algorithm is proposed. In this algorithm the searching way that searches near the best solution and makes the best solution as the initial solution is adopted in order to widen searching scope to avoid getting into local optimum, and then it is applied to test some typical functions. The result that compares with other optimizations on testing these functions showed that the improved algorithm is not only applied to continuous optimization problems, but also has fast global optimization, fast searching rate and high optimizing precision.
ISBN:9781424427222
1424427223
ISSN:1948-9439
1948-9447
DOI:10.1109/CCDC.2009.5191839