A Study of Reproduction in Generational and Steady-State Genetic Algorithms

https://doi.org/10.1016/B978-0-08-050684-5.50009-4Get rights and content

Abstract

Two techniques of population control are currently used in the field of serial genetic algorithms: generational and steady state. Although they have been used somewhat interchangeably in the past, it has become apparent that the two techniques are actually quite different. In this paper, I study the behavior of each with regard to reproduction, and show that while each can be made similar with respect to the schema theorem, in practice their behavior is quite different.

References (8)

  • Baker, E. J. Reducing bias and inefficiency in the selection algorithm. In Proceedings of the Second Int'l. Conference...
  • GoldbergD.E.

    Genetic Algorithms in Search, Optimization, and Machine Learning

    (1989)
  • HollandJ.H.

    Adaptation in Natural and Artificial Systems

    (1975)
There are more references available in the full text version of this article.

Cited by (0)

View full text