Continuous interacting ant colony algorithm based on dense heterarchy

  • Authors:

  • J. Dréo;P. Siarry

  • Affiliations:

  • Laboratoire d'Étude et de Recherche en Instrumentation Signaux et Systèmes (L.E.R.I.S.S.), Université de Paris XII Val-de-Marne, 61 Avenue du Général de Gaulle, 94010 Cr&# ...;Laboratoire d'Étude et de Recherche en Instrumentation Signaux et Systèmes (L.E.R.I.S.S.), Université de Paris XII Val-de-Marne, 61 Avenue du Général de Gaulle, 94010 Cr&# ...

  • Venue:
  • Future Generation Computer Systems - Special issue: Computational chemistry and molecular dynamics
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

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.