A genetic algorithm with tournament selection as a local search method
Anton V. Eremeev · Journal of Applied and Industrial Mathematics · 2012
Some sufficient conditions are found under which the generational genetic algorithm with tournament selection first visits a local optimum in polynomially bounded time on average. These conditions are satisfied on a class of problems with guaranteed local optima if the appropriate parameters of the algorithm are chosen.