Runtime Analysis of Non-elitist Populations: From Classical Optimisation to Partial Information

The choice of the offspring population size in the (1,λ) evolutionary algorithm

(2013) Jonathan E. Rowe et al.   THEORETICAL COMPUTER SCIENCE

Multiplicative Drift Analysis

(2012) Benjamin Doerr et al.   ALGORITHMICA

A New Method for Lower Bounds on the Running Time of Evolutionary Algorithms

(2012) Dirk Sudholt   IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION

On the Impact of Mutation-Selection Balance on the Runtime of Evolutionary Algorithms

(2011) P. K. Lehre et al.   IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION

Surrogate-assisted evolutionary computation: Recent advances and future challenges

(2011) Yaochu Jin   Swarm and Evolutionary Computation

A New Approach for Analyzing Average Time Complexity of Population-Based Evolutionary Algorithms on Unimodal Problems

(2009) Tianshi Chen et al.   IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS