RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Subscription

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Diskretn. Anal. Issled. Oper., 2012, Volume 19, Number 2, Pages 41–53 (Mi da681)  

This article is cited in 1 scientific paper (total in 1 paper)

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.

Full text: PDF file (280 kB)
References: PDF file   HTML file

English version:
Journal of Applied and Industrial Mathematics, 2012, 6:3, 286–294

Bibliographic databases:

UDC: 519.7
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

Citation in format AMSBIB
\Bibitem{Ere12}
\by A.~V.~Eremeev
\paper Genetic algorithm with tournament selection as a~local search method
\jour Diskretn. Anal. Issled. Oper.
\yr 2012
\vol 19
\issue 2
\pages 41--53
\mathnet{http://mi.mathnet.ru/da681}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2978611}
\transl
\jour J. Appl. Industr. Math.
\yr 2012
\vol 6
\issue 3
\pages 286--294
\crossref{https://doi.org/10.1134/S1990478912030039}


Linking options:
  • http://mi.mathnet.ru/eng/da681
  • http://mi.mathnet.ru/eng/da/v19/i2/p41

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. Su Yu., Chu X., Chen D., Sun X., “A Genetic Algorithm For Operation Sequencing in Capp Using Edge Selection Based Encoding Strategy”, J. Intell. Manuf., 29:2 (2018), 313–332  crossref  isi  scopus
  • Дискретный анализ и исследование операций
    Number of views:
    This page:309
    Full text:113
    References:37
    First page:7

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020