Fitness distributions in evolutionary computation: motivation and examples in the continuous domain.

Abstract excerpt

Evolutionary algorithms are, fundamentally, stochastic search procedures. Each next population is a probabilistic function of the current population. Various controls are available to adjust the probability mass function that is used to sample the space of candidate solutions at each generation. For example, the step size of a single-parent variation operator can be adjusted with a corresponding effect on the...

Topics

Share this publication in a Topic to start or enrich a Post.

• Share to Algorithms
• Share to Biological Evolution
• Share to Models, Genetic