The choice of the offspring population size in the \((1,\lambda)\) evolutionary algorithm
From MaRDI portal
Publication:2250995
DOI10.1016/j.tcs.2013.09.036zbMath1360.68788OpenAlexW1981303977MaRDI QIDQ2250995
Dirk Sudholt, Jonathan E. Rowe
Publication date: 10 July 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.09.036
Analysis of algorithms (68W40) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (27)
The interplay of population size and mutation probability in the \((1+\lambda )\) EA on OneMax ⋮ Towards a runtime comparison of natural and artificial evolution ⋮ Runtime analysis of non-elitist populations: from classical optimisation to partial information ⋮ Robustness of populations in stochastic environments ⋮ 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 ⋮ 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 ⋮ Analyzing randomized search heuristics via stochastic domination ⋮ Self-adjusting population sizes for the (1,\( \lambda )\)-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 ⋮ Do additional target points speed up evolutionary algorithms? ⋮ Exponential upper bounds for the runtime of randomized search heuristics ⋮ 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+\lambda)\) EA on OneMax through asymptotically tight drift analysis ⋮ First-hitting times under drift
Cites Work
- Simplified drift analysis for proving lower bounds in evolutionary computation
- Design and analysis of migration in parallel evolutionary algorithms
- On the analysis of the \((1+1)\) evolutionary algorithm
- A study of drift analysis for estimating computation time of evolutionary algorithms
- Multiplicative drift analysis
- Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links
- Hitting-time and occupation-time bounds implied by drift analysis with applications
- Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions
- Computing single source shortest paths using single-objective fitness
- Adaptive population models for offspring populations and parallel evolutionary algorithms
- Probability and Computing
- Introduction to evolutionary computing
- Unnamed Item
- Unnamed Item
This page was built for publication: The choice of the offspring population size in the \((1,\lambda)\) evolutionary algorithm
