Run-time analysis of population-based evolutionary algorithm in noisy environments

DOI10.1145/2725494.2725498MaRDI QIDQ2981884zbMATH OpenOpenAlexFDO

Authors A. Prügel-Bennett, Jonathan L. Shapiro, Jonathan E. Rowe

Publication date 10 May 2017

Published in Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII (Search for Journal in Brave)

Full work available at URL https://www.research.manchester.ac.uk/portal/en/publications/runtime-analysis-of-populationbased-evolutionary-algorithm-in-noisy-environments(b0d1bb36-5d9d-4e0d-b6c4-3ddb0cdeb363).html

zbMATH Keywords

noisy optimisationruntime analysisuniform crossover

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Efficient optimisation of noisy fitness functions with population-based evolutionary algorithms
• Robustness of populations in stochastic environments
• scientific article; zbMATH DE number 2038813
• Running time analysis of the \((1+1)\)-EA for OneMax and LeadingOnes under bit-wise noise
• Analysing the robustness of evolutionary algorithms to noise: refined runtime bounds and an example where noise is beneficial

Cites work

• Absorption time of the Moran process
• Approximating fixation probabilities in the generalized Moran process
• scientific article; zbMATH DE number 3148873 (Why is no real title available?)
• On the fixation probability of superstars

Cited in

(12)

• Running time analysis of the \((1+1)\)-EA for OneMax and LeadingOnes under bit-wise noise
• Running time analysis of the (1+1)-EA for robust linear optimization
• Memetic algorithms outperform evolutionary algorithms in multimodal optimisation
• 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
• The voting algorithm is robust to various noise models
• Efficient optimisation of noisy fitness functions with population-based evolutionary algorithms
• scientific article; zbMATH DE number 1784916 (Why is no real title available?)
• scientific article; zbMATH DE number 2086442 (Why is no real title available?)
• More precise runtime analyses of non-elitist evolutionary algorithms in uncertain environments
• Plus strategies are exponentially slower for planted optima of random height
• Comma selection outperforms plus selection on OneMax with randomly planted optima

This page was built for publication: Run-time analysis of population-based evolutionary algorithm in noisy environments

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