Self-adjusting population sizes for non-elitist evolutionary algorithms: why success rates matter

DOI10.1007/S00453-023-01153-9arXiv2104.05624OpenAlexW3159892185MaRDI QIDQ6182679

Dirk Sudholt, Mario Alejandro Hevia Fajardo

Publication date: 25 January 2024

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2104.05624

zbMATH Keywords

evolutionary algorithmstheorynon-elitismruntime analysisparameter control

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• From black-box complexity to designing new genetic algorithms
• Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
• Analyzing evolutionary algorithms. The computer science perspective.
• Simplified drift analysis for proving lower bounds in evolutionary computation
• Parameter setting in evolutionary algorithms.
• Improved time complexity analysis of the simple genetic algorithm
• The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate
• Optimal static and self-adjusting parameter choices for the \((1+(\lambda ,\lambda ))\) genetic algorithm
• Static and self-adjusting mutation strengths for multi-valued decision variables
• A study of drift analysis for estimating computation time of evolutionary algorithms
• Learning probability distributions in continuous evolutionary algorithms -- a comparative review
• Black-box search by unbiased variation
• Optimal parameter choices via precise black-box analysis
• Exponential slowdown for larger populations: the \(( \mu + 1)\)-EA on monotone functions
• Runtime analysis of the \((\mu + 1)\)-EA on the dynamic BinVal function
• Self-adjusting mutation rates with provably optimal success rules
• The choice of the offspring population size in the \((1,\lambda)\) evolutionary algorithm
• Towards a runtime comparison of natural and artificial evolution
• Runtime analysis for self-adaptive mutation rates
• Black-box Complexity of Parallel Search with Distributed Populations
• Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions
• Self-adjusting offspring population sizes outperform fixed parameters on the cliff function
• Do additional optima speed up evolutionary algorithms?
• Generalized drift analysis in continuous domain
• Theory of Evolutionary Computation
• Adaptive population models for offspring populations and parallel evolutionary algorithms
• Introduction to evolutionary computing
• Self-adjusting population sizes for the (1,\( \lambda )\)-EA on monotone functions
• OneMax is not the easiest function for fitness improvements

This page was built for publication: Self-adjusting population sizes for non-elitist evolutionary algorithms: why success rates matter