Optimal One-Max Strategy with Dynamic Island Models - Université d'Angers Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Optimal One-Max Strategy with Dynamic Island Models

Résumé

In this paper, we recall the dynamic island model concept, in order to dynamically select local search operators within a multi-operator genetic algorithm. We use a fully-connected island model, where each island is assigned to a local search operator. Selection of operators is simulated by migration steps, whose policies depend on a learning process. The efficiency of this approach is assessed in comparing, for the One-Max Problem, theoretical and ideal results to those obtained by the model. Experiments show that the model has the expected behavior and is able to regain the optimal local search strategy for this well-known problem.

Fichier principal
Vignette du fichier
islandSHORT.pdf (185.27 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03255426 , version 1 (14-10-2021)

Identifiants

Citer

Adrien Goëffon, Frédéric Lardeux. Optimal One-Max Strategy with Dynamic Island Models. 23rd IEEE International Conference on Tools with Artificial Intelligence, ICTAI, 2011, Boca Raton, United States. pp.485-488, ⟨10.1109/ICTAI.2011.79⟩. ⟨hal-03255426⟩

Collections

UNIV-ANGERS LERIA
22 Consultations
43 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More