Sciweavers

Share
GECCO
2010
Springer

Generalized crowding for genetic algorithms

9 years 4 months ago
Generalized crowding for genetic algorithms
Crowding is a technique used in genetic algorithms to preserve diversity in the population and to prevent premature convergence to local optima. It consists of pairing each offspring with a similar individual in the current population (pairing phase) and deciding which of the two will remain in the population (replacement phase). The present work focuses on the replacement phase of crowding, which usually has been carried out by one of the following three approaches: Deterministic, Probabilistic, and Simulated Annealing. These approaches present some limitations regarding the way replacement is conducted. On the one hand, the first two apply the same selective pressure regardless of the problem being solved or the stage of the genetic algorithm. On the other hand, the third does not apply a uniform selective pressure over all the individuals in the population, which makes the control of selective pressure over the generations somewhat difficult. This work presents a Generalized Crow...
Severino F. Galán, Ole J. Mengshoel
Added 19 Jul 2010
Updated 19 Jul 2010
Type Conference
Year 2010
Where GECCO
Authors Severino F. Galán, Ole J. Mengshoel
Comments (0)
books