The choice of the offspring population size in the (1,) evolutionary algorithm

Recommendations

The interplay of population size and mutation probability in the (1+ ) EA on OneMax
Optimizing linear functions with the \((1 + \lambda)\) evolutionary algorithm -- different asymptotic runtimes for different instances
A tight runtime analysis for the \((\mu + \lambda)\) EA
Optimal mutation rates for the (1+) EA on OneMax through asymptotically tight drift analysis
A tight runtime analysis for the (1+(,)) GA on LeadingOnes

Cites work

A study of drift analysis for estimating computation time of evolutionary algorithms
Adaptive population models for offspring populations and parallel evolutionary algorithms
Computing single source shortest paths using single-objective fitness
Design and analysis of migration in parallel evolutionary algorithms
Hitting-time and occupation-time bounds implied by drift analysis with applications
scientific article; zbMATH DE number 3705806 (Why is no real title available?)
scientific article; zbMATH DE number 2107567 (Why is no real title available?)
Introduction to evolutionary computing
Multiplicative drift analysis
On the analysis of the \((1+1)\) evolutionary algorithm
Probability and Computing
Simplified drift analysis for proving lower bounds in evolutionary computation
Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links
Tight bounds on the optimization time of a randomized search heuristic on linear functions

Cited in

(35)

Upper bounds on the running time of the univariate marginal distribution algorithm on OneMax
Running time analysis of the \((1+1)\)-EA for OneMax and LeadingOnes under bit-wise noise
On the choice of the update strength in estimation-of-distribution algorithms and ant colony optimization
How to escape local optima in black box optimisation: when non-elitism outperforms elitism
Optimal mutation rates for the (1+) EA on OneMax through asymptotically tight drift analysis
A rigorous runtime analysis of the \((1 + (\lambda, \lambda))\) GA on jump functions
Does comma selection help to cope with local optima?
Fast mutation in crossover-based algorithms
Exponential upper bounds for the runtime of randomized search heuristics
First-hitting times under drift
The interplay of population size and mutation probability in the (1+ ) EA on OneMax
Towards a runtime comparison of natural and artificial evolution
Population size versus runtime of a simple evolutionary algorithm
Analysing the robustness of evolutionary algorithms to noise: refined runtime bounds and an example where noise is beneficial
Runtime analysis for self-adaptive mutation rates
A tight runtime analysis for the \((\mu + \lambda)\) EA
The complex parameter landscape of the compact genetic algorithm
On the impact of the performance metric on efficient algorithm configuration
Do additional target points speed up evolutionary algorithms?
Runtime analysis of non-elitist populations: from classical optimisation to partial information
Robustness of populations in stochastic environments
Mutation rate control in the \((1+\lambda)\) evolutionary algorithm with a self-adjusting lower bound
An experimental study of operator choices in the \((1+(\lambda,\lambda))\) genetic algorithm
Adaptive population models for offspring populations and parallel evolutionary algorithms
Self-adjusting population sizes for the (1, )-EA on monotone functions
OneMax is not the easiest function for fitness improvements
Two-dimensional drift analysis: optimizing two functions simultaneously can be hard
Choosing the right algorithm with hints from complexity theory
Self-adjusting population sizes for non-elitist evolutionary algorithms: why success rates matter
Runtime analysis for permutation-based evolutionary algorithms
Self-adjusting offspring population sizes outperform fixed parameters on the Cliff function
Hardest monotone functions for evolutionary algorithms
A theoretical investigation of termination criteria for evolutionary algorithms
Plus strategies are exponentially slower for planted optima of random height
Comma selection outperforms plus selection on OneMax with randomly planted optima

This page was built for publication: The choice of the offspring population size in the \((1,\lambda)\) evolutionary algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2250995)