Runtime analysis in non-elitist evolutionary algorithms via population distribution

DOI10.1007/S11424-025-4261-XMaRDI QIDQ6950610zbMATH OpenFDO

Authors Xuanming Ni, Qiaochu Zhao, Song Huang, Lian Yu

Publication date 30 July 2025

Published in Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11424-025-4261-X

zbMATH Keywords

crossoverevolutionary algorithmspopulation distributionruntime analysis

Mathematics Subject Classification ID

Evolutionary algorithms, genetic algorithms (computational aspects) (68W50)

Cites work

• A study of drift analysis for estimating computation time of evolutionary algorithms
• Adaptive drift analysis
• Does comma selection help to cope with local optima?
• Drift analysis and average time complexity of evolutionary algorithms
• Evolutionary optimization.
• Hitting-time and occupation-time bounds implied by drift analysis with applications
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• Multiplicative drift analysis
• On the analysis of the \((1+1)\) evolutionary algorithm
• The analysis of evolutionary algorithms -- A proof that crossover really can help
• The interplay of population size and mutation probability in the (1+ ) EA on OneMax

This page was built for publication: Runtime analysis in non-elitist evolutionary algorithms via population distribution

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