More precise runtime analyses of non-elitist evolutionary algorithms in uncertain environments

DOI10.1007/s00453-022-01044-5OpenAlexW4300002842MaRDI QIDQ6182675

Per Kristian Lehre, Unnamed Author

Publication date: 25 January 2024

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-022-01044-5

zbMATH Keywords

runtime analysisuncertain environmentsdynamic optimisationnoisy optimisationnon-elitist evolutionary algorithms

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Runtime analysis of non-elitist populations: from classical optimisation to partial information
• Robustness of populations in stochastic environments
• Runtime analysis of ant colony optimization on dynamic shortest path problems
• Lower bounds on the worst-case complexity of some oracle algorithms
• Level-based analysis of the univariate marginal distribution algorithm
• Running time analysis of the \((1+1)\)-EA for OneMax and LeadingOnes under bit-wise noise
• How to escape local optima in black box optimisation: when non-elitism outperforms elitism
• Multiplicative drift analysis
• Runtime analysis of the \((\mu + 1)\)-EA on the dynamic BinVal function
• Multiplicative up-drift
• Self-adjusting mutation rates with provably optimal success rules
• Runtime analyses of the population-based univariate estimation of distribution algorithms on LeadingOnes
• Upper and lower bounds for randomized search heuristics in black-box optimization
• Analysis of noisy evolutionary optimization when sampling fails
• Analysing the robustness of evolutionary algorithms to noise: refined runtime bounds and an example where noise is beneficial
• (1+1) EA on Generalized Dynamic OneMax
• Efficient Optimisation of Noisy Fitness Functions with Population-based Evolutionary Algorithms
• Run-Time Analysis of Population-Based Evolutionary Algorithm in Noisy Environments
• Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity
• The Benefit of Recombination in Noisy Evolutionary Search
• Self-adjusting offspring population sizes outperform fixed parameters on the cliff function
• The benefits and limitations of voting mechanisms in evolutionary optimisation

This page was built for publication: More precise runtime analyses of non-elitist evolutionary algorithms in uncertain environments