Related Experiment Video
Updated: May 20, 2026

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm
Published on: December 9, 2012
Resampling versus repair in evolution strategies applied to a constrained linear problem
1Faculty of Computer Science, Dalhousie University, Halifax, Nova Scotia, Canada B3H 4R2. dirk@cs.dal.ca
Abstract:
We study the behaviour of multi-recombination evolution strategies for the problem of maximising a linear function with a single linear constraint. Two variants of the algorithm are considered: a strategy that resamples infeasible candidate solutions and one that applies a simple repair mechanism. Integral expressions that describe the strategies' one-generation behaviour are derived and used in a simple zeroth order model for the steady state attained when operating with constant step size. Applied to the analysis of cumulative step size adaptation, the approach provides an intuitive explanation for the qualitative difference in the algorithm variants' behaviour. The findings have implications for the design of constraint handling techniques to be used in connection with cumulative step size adaptation.
Related Concept Videos
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Reconstruction of Signal using Interpolation
Upsampling
Homologous Recombination
Gene Conversion
Trial and Error and Algorithm