Skip to main content

A comparative study of steady state and generational genetic algorithms for use in nonstationary environments

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1143))

Abstract

The objective of this study is a comparison of two models of a genetic algorithm — the generational and incremental/steady state genetic algorithms — for use in the nonstationary/dynamic environments. It is experimentally shown that selection of a suitable version of the genetic algorithm can improve performance of the genetic algorithm in such environments.This can extend ability of the genetic algorithm to track the environmental changes which are relatively small and occur with a low frequency without need to implement an additional technique for tracking changing optima.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Baker J E (1987) “Reducing Bias and Inefficiency in the Selection Algorithm”-Proceedings of the second international conference on Genetic Algorithms, (Lawrence Earlbaum Publishing).

    Google Scholar 

  • Cobb H, Grefenstette J(1993) “GA for Tracking Changing Environments”-5th International Conference on GA, (Morgan Kaufmann Publishers, Inc.).

    Google Scholar 

  • Davidor Y, Ben-Kiki O (1992) “The Interplay Among the Genetic Algorithm Operators: Information Theory Tools Used in a Holistic Way”-Parallel Problem Solving From Nature 2 (Elsevier Science Publisher).

    Google Scholar 

  • De Jong K A (1992) “Are Genetics Algorithms Function Optimizers?”-Parallel Problem Solving From Nature 2, (Elsevier Science Publisher).

    Google Scholar 

  • Fogarty T C, Vavak F, Cheng P (1995) “Use of the Genetic Algorithm for Load Balancing in the Process Industry”-6th International Conference on GA, (Morgan Kaufmann Publishers, Inc.).

    Google Scholar 

  • Goldberg D E (1989) “Genetic Algorithms in Search, Optimisation and Machine Learning”-(Addison Wesley).

    Google Scholar 

  • Hancock P J B, (1994) “An Empirical Comparison of Selection Methods in Evolutionary Algorithms”-AISB Workshop Leeds 1994 — Selected Papers in Lecture Notes in Computer Science 865, Fogarty T C-editor, (Springer Verlag).

    Google Scholar 

  • Holland J H, (1975) “Adaptation in Natural and Artificial Systems”, (University of Michigan Press, Ann Arbor).

    Google Scholar 

  • Vavak F, Fogarty T C, K Jukes (1995) “Application of the Genetic Algorithm for Load Balancing of Sugar Beet Presses”-1st International Mendelian Conference on GA, (PC-DIR Publishing, s.r.o.-Brno).

    Google Scholar 

  • Whitley D, Kauth J (1988) “.GENITOR: A different Genetic Algorithm”-Proc. of the Rocky Mountain Conf. on Artificial Intelligence”, Denver.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Terence C. Fogarty

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vavak, F., Fogarty, T.C. (1996). A comparative study of steady state and generational genetic algorithms for use in nonstationary environments. In: Fogarty, T.C. (eds) Evolutionary Computing. AISB EC 1996. Lecture Notes in Computer Science, vol 1143. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032791

Download citation

  • DOI: https://doi.org/10.1007/BFb0032791

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61749-5

  • Online ISBN: 978-3-540-70671-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics