Czasopismo
1998
|
Vol. 35, nr 1-4
|
91-111
Tytuł artykułu
Autorzy
Wybrane pełne teksty z tego czasopisma
Warianty tytułu
Języki publikacji
Abstrakty
In this article, the concept of e-optimal stopping time of a genetic algorithm with elitist model (EGA) has been introduced. The probability of performing mutation plays an important role in the computation of the Î-optimal stopping times. Two approaches, namely, pessimistic and optimistic have been considered here to find out the e-optimal stopping time. It has been found that the total number of strings to be searched in the optimistic approach to obtain e-optimal string is less than the number of all possible strings for sufficiently large string length. This observation validates the use of genetic algorithms in solving complex optimization problems.
Słowa kluczowe
Czasopismo
Rocznik
Tom
Strony
91-111
Opis fizyczny
bibliogr. 29 poz.
Twórcy
autor
autor
autor
- Machine Intelligence Unit, Indian Statistical Institute, 203 B.T. Road, Calcutta 700 035, India, sankar@isical.ac.in
Bibliografia
Typ dokumentu
Bibliografia
Identyfikatory
Identyfikator YADDA
bwmeta1.element.baztech-article-BUS1-0003-0061