Analysing equilibrium states for population diversity

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Analysis of diversity mechanisms for optimisation in dynamic environments with low frequencies of change
Toward a unifying framework for evolutionary processes
Convergence to equilibrium in the classical model of population genetics
Neutral two-locus multiple allele models with recombination
Solving problems with unknown solution length at almost no extra cost
The analysis of evolutionary algorithms -- A proof that crossover really can help
The algebra of genetic algorithms
Adaptive drift analysis
Multiplicative drift analysis
Black-box search by unbiased variation
Running time analysis of the (1+1)-EA for robust linear optimization
Exponential slowdown for larger populations: the \(( \mu + 1)\)-EA on monotone functions
Tight bounds on the expected runtime of a standard steady state genetic algorithm
Fixed-target runtime analysis
On the benefits of populations for the exploitation speed of standard steady-state genetic algorithms
Memetic algorithms outperform evolutionary algorithms in multimodal optimisation
The linear hidden subset problem for the \((1 + 1)\) EA with scheduled and adaptive mutation rates
A runtime analysis of parallel evolutionary algorithms in dynamic optimization
Populations can be essential in tracking dynamic optima
Real royal road functions -- where crossover provably is essential
On the benefits and risks of using fitness sharing for multimodal optimisation
On non-elitist evolutionary algorithms optimizing fitness functions with a plateau
Exploration and exploitation in evolutionary algorithms
Non-uniform mutation rates for problems with unknown solution lengths

This page was built for publication: Analysing equilibrium states for population diversity