Volume 19, No 2, 2012, P. 41-54

UDC 519.7
A. V. Eremeev
Genetic algorithm with tournament selection as a local search method

Sufficient conditions are found ensuring that the populational genetic algorithm with tournament selection visits a local optimum within polynomial time on average. These conditions are proven to hold for the class of problems with guaranteed local optima, provided that parameters of the algorithm are chosen appropriately.
Bibliogr. 17.

Keywords: genetic algorithm, local search, approximate solution.

Eremeev Anton Valentinovich 1
1. Omsk department of S. L. Sobolev Institute of Mathematics, SB RAS,
13 Pevtsova str., 644099 Omsk, Russia
e-mail: eremeev@ofim.oscsbras.ru

 © Sobolev Institute of Mathematics, 2015