On stopping criteria for genetic algorithms

MARTÍN DARÍO SAFE; JESSICA ANDREA CARBALLIDO; IGNACIO PONZONI; NÉLIDA BEATRIZ BRIGNOLE

Advances in Artificial Intelligence - SBIA 2004

Springer

Año: 2004; p. 405 - 413

In this work we present a critical analysis of various aspects associated with the specification of termination conditions for simple genetic algorithms. The study, which is based on the use of Markov chains, identifies the main difficulties that arise when one wishes to set meaningful upper bounds for the number of iterations required to guarantee the convergence of such algorithms with a given confidence level. The latest trends in the design of stopping rules for evolutionary algorithms in general are also put forward and some proposals to overcome existing limitations in this respect are suggested.