Non-Elitist Genetic Algorithm as a Local Search Method
Neural and Evolutionary Computing
2014-03-31 v4
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.
Keywords
Cite
@article{arxiv.1307.3463,
title = {Non-Elitist Genetic Algorithm as a Local Search Method},
author = {Anton Eremeev},
journal= {arXiv preprint arXiv:1307.3463},
year = {2014}
}
Comments
Extended abstract of the talk presented at Dagstuhl Seminar "Theory of Evolutionary Algorithms" (Dagstuhl, Germany, 30 June - 5 July 2013)