Geodesic
Genetic algorithm with tournament selection as a~local search method
Diskretnyj analiz i issledovanie operacij, Tome 19 (2012) no. 2, pp. 41-53

Voir la notice de l'article provenant de la source Math-Net.Ru

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. 
@article{DA_2012_19_2_a2,
     author = {A. V. Eremeev},
     title = {Genetic algorithm with tournament selection as a~local search method},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {41--53},
     publisher = {mathdoc},
     volume = {19},
     number = {2},
     year = {2012},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2012_19_2_a2/}
}
TY  - JOUR
AU  - A. V. Eremeev
TI  - Genetic algorithm with tournament selection as a~local search method
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2012
SP  - 41
EP  - 53
VL  - 19
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2012_19_2_a2/
LA  - ru
ID  - DA_2012_19_2_a2
ER  - 
%0 Journal Article
%A A. V. Eremeev
%T Genetic algorithm with tournament selection as a~local search method
%J Diskretnyj analiz i issledovanie operacij
%D 2012
%P 41-53
%V 19
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2012_19_2_a2/
%G ru
%F DA_2012_19_2_a2
A. V. Eremeev. Genetic algorithm with tournament selection as a~local search method. Diskretnyj analiz i issledovanie operacij, Tome 19 (2012) no. 2, pp. 41-53. http://geodesic.mathdoc.fr/item/DA_2012_19_2_a2/