DMCA
Continuous interacting ant colony algorithm based on dense heterarchy
| Venue: | Future Generation Computer Systems |
| Citations: | 22 - 2 self |
BibTeX
@ARTICLE{Dréo_continuousinteracting,
author = {J. Dréo and P. Siarry},
title = {Continuous interacting ant colony algorithm based on dense heterarchy},
journal = {Future Generation Computer Systems},
year = {},
volume = {2004},
pages = {841--856}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Ant colony algorithms are a class of metaheuristics which are inspired from the behavior of real ants. The original idea consisted in simulating the stigmergic communication, therefore these algorithms are considered as a form of adaptive memory programming. A new formalization is proposed for the design of ant colony algorithms, introducing the biological notions of heterarchy and communication channels. We are interested in the way ant colonies handle the information. According to these issues, a heterarchical algorithm called “Continuous Interacting Ant Colony ” (CIAC) is designed for the optimization of multiminima continuous functions. CIAC uses two communication channels showing the properties of trail and direct communications. CIAC presents interesting emergent properties as it was shown through some analytical test functions.
Keyphrases
ant colony algorithm dense heterarchy communication channel direct communication continuous interacting ant colony analytical test function original idea heterarchical algorithm way ant colony biological notion real ant multiminima continuous function interesting emergent property new formalization stigmergic communication adaptive memory programming
