Sciweavers

Share
GECCO
2003
Springer

An Adaptive Penalty Scheme for Steady-State Genetic Algorithms

10 years 9 months ago
An Adaptive Penalty Scheme for Steady-State Genetic Algorithms
A parameter-less adaptive penalty scheme for steady-state genetic algorithms applied to constrained optimization problems is proposed. For each constraint, a penalty parameter is adaptively computed along the run according to information extracted from the current population such as the existence of feasible individuals and the level of violation of each constraint. Using real coding, rank-based selection, and operators available in the literature, very good results are obtained.
Helio J. C. Barbosa, Afonso C. C. Lemonge
Added 06 Jul 2010
Updated 06 Jul 2010
Type Conference
Year 2003
Where GECCO
Authors Helio J. C. Barbosa, Afonso C. C. Lemonge
Comments (0)
books