DeepAI AI Chat
Log In Sign Up

A Tight Runtime Analysis for the (μ+ λ) EA

by   Denis Antipov, et al.

Despite significant progress in the theory of evolutionary algorithms, the theoretical understanding of true population-based evolutionary algorithms remains challenging and only few rigorous results exist. Already for the most basic problem, the determination of the asymptotic runtime of the (μ+λ) evolutionary algorithm on the simple OneMax benchmark function, only the special cases μ=1 and λ=1 have been solved. In this work, we analyze this long-standing problem and show the asymptotically tight result that the runtime T, the number of iterations until the optimum is found, satisfies E[T] = Θ(n n/λ+n/λ / μ + n^+^+ λ/ μ/^+ λ / μ), where ^+ x := {1, x} for all x > 0. The same methods allow to improve the previous-best O(n n/λ + n λ) runtime guarantee for the (λ+λ) EA with fair parent selection to a tight Θ(n n/λ + n) runtime result.


page 1

page 2

page 3

page 4


Parameterized Runtime Analyses of Evolutionary Algorithms for the Euclidean Traveling Salesperson Problem

Parameterized runtime analysis seeks to understand the influence of prob...

A Tight Runtime Analysis for the cGA on Jump Functions---EDAs Can Cross Fitness Valleys at No Extra Cost

We prove that the compact genetic algorithm (cGA) with hypothetical popu...

Fixed-Target Runtime Analysis

Runtime analysis aims at contributing to our understanding of evolutiona...

The Efficiency Threshold for the Offspring Population Size of the (μ, λ) EA

Understanding when evolutionary algorithms are efficient or not, and how...

Does Comma Selection Help To Cope With Local Optima

One hope of using non-elitism in evolutionary computation is that it aid...

Better Runtime Guarantees Via Stochastic Domination

Apart from few exceptions, the mathematical runtime analysis of evolutio...

More Effective Crossover Operators for the All-Pairs Shortest Path Problem

The all-pairs shortest path problem is the first non-artificial problem ...