|
Diskretnyi Analiz i Issledovanie Operatsii, 2012, Volume 19, Issue 2, Pages 41–53
(Mi da681)
|
|
|
|
This article is cited in 11 scientific papers (total in 11 papers)
Genetic algorithm with tournament selection as a local search method
A. V. Eremeev Omsk department of S. L. Sobolev Institute of Mathematics, SB RAS, Omsk, Russia
Abstract:
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.
Received: 18.06.2011 Revised: 02.08.2011
Citation:
A. V. Eremeev, “Genetic algorithm with tournament selection as a local search method”, Diskretn. Anal. Issled. Oper., 19:2 (2012), 41–53; J. Appl. Industr. Math., 6:3 (2012), 286–294
Linking options:
https://www.mathnet.ru/eng/da681 https://www.mathnet.ru/eng/da/v19/i2/p41
|
Statistics & downloads: |
Abstract page: | 455 | Full-text PDF : | 172 | References: | 60 | First page: | 7 |
|