2008 · 30 citations · 19 references
Life SciencesEvolutionary BiologyEvolutionary TheoryMicroevolutionOptimizationEvolutionary ComputationEvolutionary OptimizationPopulation-based SearchSelection In PopulationsSelection TheoryEstimation Of Distribution AlgorithmsPopulation-based OptimizationTruncationTruncation BiasTruncation Selection
Selection is one of the defining characteristics of an evolutionary algorithm, yet inherent in the selection process is the loss of some information from a population. Poor solutions may provide information about how to bias the search toward good solutions. Many Estimation of Distribution Algorithms (EDAs) use truncation selection which discards all solutions below a certain fitness, thus losing this information. Our previous work on Distribution Estimation using Markov networks (DEUM) has described an EDA which constructs a model of the fitness function; a unique feature of this approach is that because selective pressure is built into the model itself selection becomes optional. This paper outlines a series of experiments which make use of this property to examine the effects of selection on the population. We look at the impact of selecting only highly fit solutions, only poor solutions, selecting a mixture of highly fit and poor solutions, and abandoning selection altogether. We show that in some circumstances, particularly where some information about the problem is already known, selection of the fittest only is suboptimal.
19
Numerical Recipes: The Art of Scientific Computing
Eric R. Ziegel · Technometrics · 1987 · 2.3K citations
SATLIB: An Online Resource for Research on SAT
Holger H. Hoos, Thomas Stützle, Ian P. Gent et al. · 2000 · 312 citations