More precise runtime analyses of non-elitist EAs in uncertain environments

Research output: Chapter in Book/Report/Conference proceedingConference contribution


Colleges, School and Institutes


Real-world optimisation problems often involve uncertainties. In the past decade, several rigorous analysis results for evolutionary algorithms (EAs) on discrete problems show that EAs can cope with low-level uncertainties, and sometimes benefit from uncertainties. Using non-elitist EAs with large population size is a promising approach to handle higher levels of uncertainties. However, the performance of non-elitist EAs in some common fitness-uncertainty scenarios is still unknown.

We analyse the runtime of non-elitist EAs on \textsc{OneMax} and \textsc{LeadingOnes} under prior and posterior noise models, and the dynamic binary value problem (\textsc{DynBV}). Our analyses are more extensive and precise than previous analyses of non-elitist EAs. In several settings, we prove that the non-elitist EAs beat the current state of the art results. Previous work shows that the population size and mutation rate can dramatically impact the performance of non-elitist EAs. The optimal choices of these parameters depend on the level of uncertainties in the fitness functions. We provide more precise guidance on how to choose mutation rate and population size as a function of the level of uncertainties.


Original languageEnglish
Title of host publicationGECCO '21: Proceedings of the 2020 Genetic and Evolutionary Computation Conference
Publication statusAccepted/In press - 2021
EventGenetic and Evolutionary Computation Conference -
Duration: 10 Jul 202114 Jul 2021

Publication series

NameGenetic and Evolutionary Computation Conference (GECCO)


ConferenceGenetic and Evolutionary Computation Conference
Abbreviated titleGECCO 2021


  • non-elitist evolutionary algorithms, uncertain environments, noisy optimisation, dynamic optimisation, runtime analysis