Analysis of Adaptive Operator Selection Techniques on the Royal Road and Long K-Path Problems

Álvaro Fialho 1 Marc Schoenauer 1, 2, 3 Michèle Sebag 1, 2, 3
1 MSR - INRIA - Microsoft Research - Inria Joint Centre
2 LRI - Laboratoire de Recherche en Informatique
3 TAO - Machine Learning and Optimisation
CNRS - Centre National de la Recherche Scientifique : UMR8623, Inria Saclay - Ile de France, UP11 - Université Paris-Sud - Paris 11, LRI - Laboratoire de Recherche en Informatique
Abstract : One of the choices that most affect the performance of Evolutionary Algorithms is the selection of the variation operators that are efficient to solve the problem at hand. This work presents an empirical analysis of different Adaptive Operator Selection (AOS) methods, i.e., techniques that automatically select the operator to be applied among the available ones, while searching for the solution. Four previously published operator selection rules are combined to four different credit assignment mechanisms. These 16 AOS combinations are analyzed and compared in the light of two well-known benchmark problems in Evolutionary Computation, the Royal Road and the Long K-Path.
Document type :
Conference papers
Complete list of metadatas
https://hal.inria.fr/inria-00377449
Contributor : Álvaro Fialho <>
Submitted on : Thursday, July 16, 2009 - 4:49:05 PM
Last modification on : Monday, December 9, 2019 - 5:24:06 PM
Long-term archiving on: Wednesday, September 22, 2010 - 1:28:56 PM

Files

banditGECCO09.pdf
Files produced by the author(s)

Identifiers

Collections

CNRS | INRIA | UMR8623 | LRI-AO

Citation

Álvaro Fialho, Marc Schoenauer, Michèle Sebag. Analysis of Adaptive Operator Selection Techniques on the Royal Road and Long K-Path Problems. Genetic and Evolutionary Computation Conference (GECCO), ACM, Jul 2009, Montreal, Canada. pp.779-786, ⟨10.1145/1569901.1570009⟩. ⟨inria-00377449v2⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

561

Files downloads

1073

 

 

Contact

archive-ouverte@inria.fr