Lower bounds from fitness levels made easy

DOI10.1007/S00453-022-00952-WarXiv2104.03372OpenAlexW4293239237MaRDI QIDQ6182674

Timo Kötzing, Benjamin Doerr

Publication date: 25 January 2024

Published in: Algorithmica (Search for Journal in Brave)

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

zbMATH Keywords

evolutionary computationfirst hitting timefitness level method

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Runtime analysis of non-elitist populations: from classical optimisation to partial information
• The impact of random initialization on the runtime of randomized search heuristics
• The impact of parametrization in memetic evolutionary algorithms
• On the analysis of the \((1+1)\) evolutionary algorithm
• Optimal mutation rates for the \((1+\lambda)\) EA on OneMax through asymptotically tight drift analysis
• Static and self-adjusting mutation strengths for multi-valued decision variables
• The analysis of evolutionary algorithms -- A proof that crossover really can help
• Multiplicative drift analysis
• Optimal parameter choices via precise black-box analysis
• A rigorous runtime analysis of the \((1 + (\lambda, \lambda))\) GA on jump functions
• Self-adjusting evolutionary algorithms for multimodal optimization
• Fixed-target runtime analysis
• When hypermutations and ageing enable artificial immune systems to outperform evolutionary algorithms
• Stagnation detection with randomized local search
• Performance analysis of randomised search heuristics operating with a fixed budget
• The impact of lexicographic parsimony pressure for ORDER/MAJORITY on the run time
• Artificial immune systems can find arbitrarily good approximations for the NP-hard number partitioning problem
• Fitness levels with tail bounds for the analysis of randomized search heuristics
• The interplay of population size and mutation probability in the \((1+\lambda )\) EA on OneMax
• Algorithmic analysis of a basic evolutionary algorithm for continuous optimization
• Analyzing randomized search heuristics via stochastic domination
• When move acceptance selection hyper-heuristics outperform metropolis and elitist evolutionary algorithms and when not
• Concentrated Hitting Times of Randomized Search Heuristics with Variable Drift
• Analysis of Speedups in Parallel Evolutionary Algorithms for Combinatorial Optimization
• Markov Chains and Stochastic Stability
• 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
• Sharp bounds on the runtime of the (1+1) EA via drift analysis and analytic combinatorial tools
• The benefits and limitations of voting mechanisms in evolutionary optimisation
• Theory of Evolutionary Computation
• Optimizing expected path lengths with ant colony optimization using fitness proportional update
• Drift analysis and average time complexity of evolutionary algorithms

This page was built for publication: Lower bounds from fitness levels made easy