On Stopping Criteria for Genetic Algorithms
- Cite this paper as:
- Safe M., Carballido J., Ponzoni I., Brignole N. (2004) On Stopping Criteria for Genetic Algorithms. In: Bazzan A.L.C., Labidi S. (eds) Advances in Artificial Intelligence – SBIA 2004. SBIA 2004. Lecture Notes in Computer Science, vol 3171. Springer, Berlin, Heidelberg
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.
Keywordsstopping rule genetic algorithm Markov chains convergence analysis
Unable to display preview. Download preview PDF.