Spacing memetic algorithms - Université d'Angers Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Spacing memetic algorithms

Résumé

We introduce the Spacing Memetic Algorithm (SMA), a formal evolutionary model devoted to a systematic control of spacing (distances) among individuals. SMA uses search space distance information to decide what individuals are acceptable in the population, what individuals need to be replaced and when to apply mutations. By ensuring a "healthy" spacing (and thus diversity), SMA substantially reduces the risk of premature convergence and helps the search process to continuously discover new high-quality search areas. Generally speaking, the number of distance calculations represents a limited computational overhead compared to the number of local search iterations. Most existing memetic algorithms can be "upgraded" to a spacing memetic algorithm, provided that a suitable distance measure can be specified. The impact of the main SMA components is assessed within several case studies on different problems.

Dates et versions

hal-01167105 , version 1 (23-06-2015)

Licence

Paternité

Identifiants

Citer

Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz-Cosperec. Spacing memetic algorithms. Genetic and Evolutionary Computation Conference, Gecco 2011, 2011, Dublin, Ireland. pp.1061-1068, ⟨10.1145/2001576.2001720⟩. ⟨hal-01167105⟩
126 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More