The choice of the offspring population size in the (1,) evolutionary algorithm
From MaRDI portal
Publication:2250995
DOI10.1016/J.TCS.2013.09.036zbMATH Open1360.68788OpenAlexW1981303977MaRDI QIDQ2250995FDOQ2250995
Authors: Jonathan E. Rowe, Dirk Sudholt 
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
Recommendations
- The interplay of population size and mutation probability in the \((1+\lambda )\) 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+\lambda)\) EA on OneMax through asymptotically tight drift analysis
- A tight runtime analysis for the \((1+(\lambda,\lambda))\) GA on LeadingOnes
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms (68W40)
Cites Work
- Title not available (Why is that?)
- Introduction to evolutionary computing
- Probability and Computing
- 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
- Simplified drift analysis for proving lower bounds in evolutionary computation
- Computing single source shortest paths using single-objective fitness
- Adaptive population models for offspring populations and parallel evolutionary algorithms
- On the analysis of the \((1+1)\) evolutionary algorithm
- Design and analysis of migration in parallel evolutionary algorithms
- Title not available (Why is that?)
Cited In (33)
- A tight runtime analysis for the \((\mu + \lambda)\) EA
- Adaptive population models for offspring populations and parallel evolutionary algorithms
- Upper bounds on the running time of the univariate marginal distribution algorithm on OneMax
- 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
- Population size versus runtime of a simple evolutionary algorithm
- OneMax is not the easiest function for fitness improvements
- 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 for self-adaptive mutation rates
- Exponential upper bounds for the runtime of randomized search heuristics
- Runtime analysis of non-elitist populations: from classical optimisation to partial information
- Robustness of populations in stochastic environments
- The complex parameter landscape of the compact genetic algorithm
- 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
- 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 the (1,\( \lambda )\)-EA on monotone functions
- An experimental study of operator choices in the \((1+(\lambda,\lambda))\) genetic algorithm
- First-hitting times under drift
- Self-adjusting population sizes for non-elitist evolutionary algorithms: why success rates matter
- Runtime analysis for permutation-based evolutionary algorithms
- Mutation rate control in the \((1+\lambda)\) evolutionary algorithm with a self-adjusting lower bound
- On the impact of the performance metric on efficient algorithm configuration
- A theoretical investigation of termination criteria for evolutionary algorithms
- Hardest monotone functions for evolutionary algorithms
- Self-adjusting offspring population sizes outperform fixed parameters on the Cliff function
- Running time analysis of the \((1+1)\)-EA for OneMax and LeadingOnes under bit-wise noise
- Do additional target points speed up evolutionary algorithms?
- Analysing the robustness of evolutionary algorithms to noise: refined runtime bounds and an example where noise is beneficial
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)
