Get our free extension to see links to code for papers anywhere online!Free add-on: code for papers everywhere!Free add-on: See code for papers anywhere!
Add to Chrome
Add to Firefox
Add to EdgeNon-Elitist Genetic Algorithm as a Local Search Method
Paper and Code
Mar 28, 2014
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)
View paper on