A tight runtime analysis of the (1 + (Λ, Λ)) genetic algorithm on onemax

Understanding how crossover works is still one of the big challenges in evolutionary computation research, and making our understanding precise and proven by mathematical means might be an even bigger one. As one of few examples where crossover provably is useful, the (1 + (Λ, Λ)) Genetic Algorithm (GA) was proposed recently in [Doerr, Doerr, Ebel. Lessons From the Black-Box: Fast Crossover-Based Genetic Algorithms. TCS 2015]. Using the fitness level method, the expected optimization time on general One-Max functions was analyzed and a O(max{nlog(n)/Λ, Λn}) bound was proven for any offspring population size Λ ∈ [1..n]. We improve this work in several ways, leading to sharper bounds and a better understanding of how the use of crossover speeds up the runtime in this algorithm. We first improve the upper bound on the runtime to O(max{nlog(n)/Λ,nΛloglog(Λ)/log(Λ)}). This improvement is made possible from observing that in the parallel generation of Λ offspring via crossover (but not mutation), the best of these often is better than the expected value, and hence several fitness levels can be gained in one iteration. We then present the first lower bound for this problem. It matches our upper bound for all values of Λ. This allows to determine the asymptotically optimal value for the population size. It is Λ = √ log (n) log log (n)/log log log (n)), which gives an optimization time of (n √log(n) log log log(n)/log log(n)). Hence the improved runtime analysis both gives a runtime guarantee improved by a super-constant factor and yields a better actual runtime (faster by more than a constant factor) by suggesting a better value for the parameter Λ. We finally give a tail bound for the upper tail of the runtime distribution, which shows that the actual runtime exceeds our runtime guarantee by a factor of (1 +δ) with probability O((n/Λ²)^-δ) only.