E - optimal stopping time for genetic algorithms

• Autorzy: Murthy C.A. , Bhandari D. , Pal S.K.
• Języki publikacji: EN

Abstrakty

EN

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.

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 1998
• Tom: Vol. 35, nr 1-4
• Strony: 91--111
• Opis fizyczny: bibliogr. 29 poz.

Twórcy

autor

Murthy C.A.

autor

Bhandari D.

autor

Pal S.K.

• Machine Intelligence Unit, Indian Statistical Institute, 203 B.T. Road, Calcutta 700 035, India,