Non-Elitist Genetic Algorithm as a Local Search Method

Abstract

Sufficient conditions are found under which the iterated non-elitist genetic algorithm with tournament selection first visits a local optimum in polynomially bounded time on average. It is shown that these conditions are satisfied on a class of problems with guaranteed local optima (GLO) if appropriate parameters of the algorithm are chosen.

Extended abstract of the talk presented at Dagstuhl Seminar "Theory of Evolutionary Algorithms" (Dagstuhl, Germany, 30 June - 5 July 2013)

Cited by in corpus (2)

• Level-Based Analysis of Genetic Algorithms for Combinatorial Optimization
• On Proportions of Fit Individuals in Population of Evolutionary Algorithm with Tournament Selection