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

DOI10.1007/S00453-022-01044-5MaRDI QIDQ6182675zbMATH OpenOpenAlexFDO

Authors Per Kristian Lehre

Publication date 25 January 2024

Published in Algorithmica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

dynamic optimisationnoisy optimisationnon-elitist evolutionary algorithmsruntime analysisuncertain environments

Mathematics Subject Classification ID

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

Cites work

• (1+1) EA on Generalized Dynamic OneMax
• Analysing the robustness of evolutionary algorithms to noise: refined runtime bounds and an example where noise is beneficial
• Analysis of noisy evolutionary optimization when sampling fails
• Efficient optimisation of noisy fitness functions with population-based evolutionary algorithms
• How to escape local optima in black box optimisation: when non-elitism outperforms elitism
• scientific article; zbMATH DE number 1348743 (Why is no real title available?)
• scientific article; zbMATH DE number 2107567 (Why is no real title available?)
• Level-based analysis of the univariate marginal distribution algorithm
• Lower bounds on the worst-case complexity of some oracle algorithms
• Multiplicative drift analysis
• Multiplicative up-drift
• Robustness of populations in stochastic environments
• Run-time analysis of population-based evolutionary algorithm in noisy environments
• Running time analysis of the \((1+1)\)-EA for OneMax and LeadingOnes under bit-wise noise
• Runtime analyses of the population-based univariate estimation of distribution algorithms on LeadingOnes
• Runtime analysis of ant colony optimization on dynamic shortest path problems
• Runtime analysis of non-elitist populations: from classical optimisation to partial information
• Runtime analysis of the ( + 1)-EA on the dynamic BinVal function
• Self-adjusting mutation rates with provably optimal success rules
• Self-adjusting offspring population sizes outperform fixed parameters on the cliff function
• The Benefit of Recombination in Noisy Evolutionary Search
• The benefits and limitations of voting mechanisms in evolutionary optimisation
• Towards a complexity theory of randomized search heuristics: ranking-based black-box complexity
• Upper and lower bounds for randomized search heuristics in black-box optimization

Cited in

(2)

• Stochastic population update can provably be helpful in multi-objective evolutionary algorithms
• Runtime analysis of evolutionary neural architecture search for binary classification

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6182675)