Relationship between Genetic Algorithms and Ant Colony Optimization Algorithms

Osvaldo Gómez (1), Benjamín Barán (1)

e-mails: ogomez@cnc.una.py, bbaran@cnc.una.py

(1) Universidad Nacional de Asunción - Centro Nacional de Computación, Asunción Paraguay

Abstract

Genetic Algorithms (GAs) were introduced by Holland as a computational analogy of adaptive systems. GAs are search procedures based on the mechanics of natural selection and natural genetics. Ant Colony Optimization (ACO) is a metaheuristic inspired in the foraging behavior of ant colonies. ACO was introduced by Dorigo and has evolved significantly in the last years. Both algorithms have shown their effectiveness in the resolution of hard combinatorial optimization problems. This paper shows the relationship between these two evolutionary algorithms. This relationship extends the reasons of ACO's success in TSP to GAs. Finally, the significance of the crossover and the genetic diversity in globally convex structures is explained.

Keywords:Artificial Intelligence, Ant Colony Optimization, Genetic Algorithm, Reasons for Success


BibTex 

@INPROCEEDINGS{gomez04:258,
                  AUTHOR       = {Osvaldo Gómez and Benjamín Barán},
                  TITLE        = {Relationship between Genetic Algorithms and Ant Colony Optimization Algorithms},
                  BOOKTITLE    = {30ma Conferencia Latinoamericana de Informática (CLEI2004)},
                  YEAR         = {2004},
                  editor       = {Mauricio Solar and David Fernández-Baca and Ernesto Cuadros-Vargas},
                  pages        = {766--776},
                  address      = {},
                  month        = Sep,
                  organization = {Sociedad Peruana de Computación},
                  note         = {ISBN 9972-9876-2-0},
                  file         = {http://clei2004.spc.org.pe/es/html/pdfs/258.pdf}
}

pdficon.gif PDF de este artículo
PDF de CLEI2004 (incluye todos los artículos)
Página principal CLEI 2004
Generado por Sociedad Peruana de Computación