Skip to main content
Springer Nature Link
Log in

On Stopping Criteria for Genetic Algorithms

  • Conference paper
Advances in Artificial Intelligence – SBIA 2004 (SBIA 2004)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3171))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Brassard, G., Bratley, P.: Algorithmics: Theory and Practice. Prentice-Hall, Inc., New Jersey (1988)

    MATH  Google Scholar 

  2. Bäck, T., Hammel, U., Schwefel, H.P.: Evolutionary computation: Comments on the history and current state. IEEE Transactions on Evolutionary Computation 1, 3–17 (1997)

    Article  Google Scholar 

  3. Eiben, Á.E., Hinterding, R., Michalewicz, Z.: Parameter control in evolutionary algorithms. IEEE Transactions on Evolutionary Computation 3, 124–141 (1999)

    Article  Google Scholar 

  4. Meyer, L., Feng, X.: A fuzzy stop criterion for genetic algorithms using performance estimation. In: Proceedings of the Third IEEE Conference on Fuzzy Systems, pp. 1990–1995 (1994)

    Google Scholar 

  5. Howell, M., Gordon, T., Brandao, F.: Genetic learning automata for function optimization. IEEE Transactions on Systems, Man, and Cybernetics-Part B: Cybernetics 32, 804–815 (2002)

    Article  Google Scholar 

  6. Carballido, J.A., Ponzoni, I., Brignole, N.B.: Evolutionary techniques for the travelling salesman problem. In: Rosales, M.B., Cortínez, V.H., Bambill, D.V. (eds.) Mecánica Computacional. Volume XXII. Asociación Argentina de Mecánica Computacional, pp. 1286–1294 (2003)

    Google Scholar 

  7. Aytug, H., Koehler, G.J.: Stopping criterion for finite length genetic algorithms. INFORMS Journal on Computing 8, 183–191 (1996)

    Article  MATH  Google Scholar 

  8. Aytug, H., Koehler, G.J.: New stopping criterion for genetic algorithms. European Journal of Operational Research 126, 662–674 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  9. Greenhalgh, D., Marshall, S.: Convergence criteria for genetic algorithms. SIAM Journal on Computing 20, 269–282 (2000)

    Article  MathSciNet  Google Scholar 

  10. Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs. Springer, New York (1996)

    MATH  Google Scholar 

  11. Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley Longman, Inc., Reading (1989)

    MATH  Google Scholar 

  12. Nix, A.E., Vose, M.D.: Modeling genetic algorithms with Markov chains. Annals of Mathematics and Artificial Intelligence 5, 79–88 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  13. Davis, T.E., Príncipe, J.C.: A Markov chain framework for the simple genetic algorithm. Evolutionary Computation 1, 269–288 (1993)

    Article  Google Scholar 

  14. Rudolph, G.: Convergence analysis of canonical genetic algorithms. IEEE Transactions on Neural Networks 5, 96–101 (1994)

    Article  Google Scholar 

  15. Poli, R.: Exact schema theorem and effective fitness for GP with one-point crossover. In: Whitley, L.D., Goldberg, D.E., Cantú-Paz, E., Spector, L., Parmee, I.C., Beyer, H.G. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference, pp. 469–476. Morgan Kaufmann, San Francisco (2000)

    Google Scholar 

  16. Çínlar, E.: Introduction to Stochastic Processes. Prentice-Hall, Inc., Englewood Cliffs (1975)

    MATH  Google Scholar 

  17. De Jong, K.A., Spears, W.M., Gordon, D.F.: Using Markov chains to analyze GAFOs. In: Whitley, L.D., Vose, M.D. (eds.) Proceedings of the Third Workshop on Foundations of Genetic Algorithms, pp. 115–137. Morgan Kaufmann, San Francisco (1995)

    Google Scholar 

  18. Hart, W.E., Baden, S., Belew, R.K., Kohn, S.: Analysis of the numerical effects of parallelism on a parallel genetic algorithm. In: Proceedings of the 10th International Parallel Processing Symposium, pp. 606–612. IEEE Computer Society, Los Alamitos (1996)

    Google Scholar 

  19. Sena, G.A., Megherbi, D., Isern, G.: Implementation of a parallel genetic algorithm on a cluster of workstations: travelling salesman problem, a case study. Future Generation Computer Systems 17, 477–488 (2001)

    Article  MATH  Google Scholar 

  20. Alba, E., Tomassini, M.: Parallelism and evolutionary algorithms. IEEE Transactions on Evolutionary Computation 6, 443–462 (2002)

    Article  Google Scholar 

  21. Veldhuizen, D.A.V., Zydallis, J.B., Lamont, G.B.: Considerations in engineering parallel multiobjetive evolutionary algorithms. IEEE Transactions on Evolutionary Computation 7, 144–173 (2003)

    Article  Google Scholar 

  22. De Jong, K.A.: Genetic algorithms are NOT function optimizers. In: Whitley, L.D. (ed.) Proceedings of the Second Workshop on Foundations of Genetic Algorithms, pp. 5–17. Morgan Kaufmann, San Francisco (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Grupo de Investigación y Desarrollo en Computación Científica (GIDeCC), Departamento de Ciencias e Ingeniería de la Computación, Universidad Nacional del Sur, Av. Alem 1253, 8000, Bahía Blanca, Argentina

    Martín Safe, Jessica Carballido, Ignacio Ponzoni & Nélida Brignole

  2. Planta Piloto de Ingeniería Química – CONICET, Complejo CRIBABB, Camino La Carrindanga km.7, CC 717, Bahía Blanca, Argentina

    Jessica Carballido, Ignacio Ponzoni & Nélida Brignole

Authors
  1. Martín Safe
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jessica Carballido
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ignacio Ponzoni
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Nélida Brignole
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Instituto de Informática, UFRGS, Porto Alegre, RS, Brasil

    Ana L. C. Bazzan

  2. Intelligent Systems Laboratory LSI, Center of Technology, Federal University of Maranao UFMA, Bacanga Campus, 65080-040, Sao Luis, MA, Brazil

    Sofiane Labidi

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

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. https://doi.org/10.1007/978-3-540-28645-5_41

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-28645-5_41

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23237-7

  • Online ISBN: 978-3-540-28645-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics