fitness-levels for non-elitist populations
This paper introduces an easy to use technique for deriving upper bounds on the expected runtime of non-elitist population-based evolutionary algorithms (EAs). Applications of the technique show how the efficiency of EAs is critically dependant on having a sufficiently strong selective pressure. Parameter settings that ensure sufficient selective pressure on commonly considered benchmark functions are derived for the most popular selection mechanisms. Together with a recent technique for deriving lower bounds, this paper contributes to a much-needed analytical tool-box for the analysis of evolutionary algorithms with populations.
evolutionary algorithms runtime analysis