DeepAI AI Chat
Log In Sign Up

On Non-Elitist Evolutionary Algorithms Optimizing Fitness Functions with a Plateau

by   Anton V. Eremeev, et al.

We consider the expected runtime of non-elitist evolutionary algorithms (EAs), when they are applied to a family of fitness functions with a plateau of second-best fitness in a Hamming ball of radius r around a unique global optimum. On one hand, using the level-based theorems, we obtain polynomial upper bounds on the expected runtime for some modes of non-elitist EA based on unbiased mutation and the bitwise mutation in particular. On the other hand, we show that the EA with fitness proportionate selection is inefficient if the bitwise mutation is used with the standard settings of mutation probability.


page 1

page 2

page 3

page 4


Runtime Analysis of Fitness-Proportionate Selection on Linear Functions

This paper extends the runtime analysis of non-elitist evolutionary algo...

On Proportions of Fit Individuals in Population of Evolutionary Algorithm with Tournament Selection

In this paper, we consider a fitness-level model of a non-elitist mutati...

Precise Runtime Analysis for Plateaus

To gain a better theoretical understanding of how evolutionary algorithm...

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

We present a new method for proving lower bounds on the expected running...

When Hypermutations and Ageing Enable Artificial Immune Systems to Outperform Evolutionary Algorithms

We present a time complexity analysis of the Opt-IA artificial immune sy...

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

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

Better Runtime Guarantees Via Stochastic Domination

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