Runtime analysis of the (mu+1) EA on simple Pseudo-Boolean functions

Although Evolutionary Algorithms (EAs) have been successfully applied to optimization in discrete search spaces, theoretical developments remain weak, in particular for population-based EAs. This paper presents a first rigorous analysis of the (mu+1) EA on pseudo-Boolean functions. Using three well-known example functions from the analysis of the (1+1) EA, we derive bounds on the expected runtime and success probability. For two of these functions, upper and lower bounds on the expected runtime are tight, and on all three functions, the (mu+1) EA is never more efficient than the (1+1) EA. Moreover, all lower bounds grow with mu. On a more complicated function, however, a small increase of mu probably decreases the expected runtime drastically. This paper develops a new proof technique that bounds the runtime of the (mu+1) EA. It investigates the stochastic process for creating family trees of individuals; the depth of these trees is bounded. Thereby, the progress of the population towards the optimum is captured. This new technique is general enough to be applied to other population-based EAs.