Memory in ants colony algorithms : applications to optimization and automatic programming
Created by W.Langdon from
gp-bibliography.bib Revision:1.8194
- @PhdThesis{roux:tel-00008597,
-
author = "Olivier Roux",
-
title = "Memory in ants colony algorithms : applications to
optimization and automatic programming",
-
title_fr = "La memoire dans les algorithmes a colonie de fourmis :
applications a l'optimisation combinatoire et a la
programmation automatique",
-
school = "Universite du Littoral Cote d'Opale",
-
year = "2001",
-
address = "France",
-
month = Dec,
-
keywords = "genetic algorithms, genetic programming, ACO,
Artificial ants, swarm algorithms, memory,
optimization, automatic programming, programmation
automatique, fourmis artificielles, algorithme {\`a}
essaims, m{\'e}moire, optimisation, QAP, programmation
automatique",
-
hal_id = "tel-00008597",
-
hal_version = "v1",
-
URL = "https://tel.archives-ouvertes.fr/tel-00008597/file/tel-00008597.pdf",
-
URL = "https://tel.archives-ouvertes.fr/tel-00008597",
-
size = "165 pages",
-
abstract = "This thesis presents meta-heuristic based on the
behaviour of natural ants looking for food. These
heuristics are known as Ants Colony Optimization or
ACO. We propose to compare the ACO paradigm with other
well-known heuristics with regards to the use of the
memory. Then, we introduce two applications of the ACO
algorithms.
The First application, ANTabu is an ACO scheme for the
QAP. ANTabu combines the ants' paradigm with a robust
local search technique (Tabu search). A parallel model
developed for ANTabu is introduced. The second
application lies in the machine-learning field. This
scheme called AP (Automatic Programming) applies the
cooperative behaviour of ants to automatically build
programs. This method is then compared to the classical
automatic generation of programs : Genetic
Programming.",
-
notes = "In French. Francais
Comparison with GP. Santa Fe Ant, Mux 11, 6
parity
Comparaison avec la PG",
- }
Genetic Programming entries for
Olivier Roux
Citations