ε - Optimal Stopping Time for Genetic Algorithms
C.A. Murthy, Dinabandhu Bhandari, Sankar Kumar Pal · Fundamenta Informaticae · 1998
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 approa