DocumentCode
1641395
Title
Comparison of steady state and generational genetic algorithms for use in nonstationary environments
Author
Vavak, Frank ; Fogarty, Terence C.
Author_Institution
Fac. of Comput. Studies & Math., Univ. of the West of England, Bristol, UK
fYear
1996
Firstpage
192
Lastpage
195
Abstract
The objective of this study is a comparison of two models of the genetic algorithm, the generational and incremental/steady state genetic algorithms, for use in nonstationary/dynamic environments. It is experimentally shown that the choice of a suitable version of the genetic algorithm can improve its performance in such environments. This can extend the ability of the genetic algorithm to track environmental changes which are relatively small and occur with low frequency without the need to implement an additional technique for tracking changing optima
Keywords
genetic algorithms; search problems; changing optima tracking; dynamic environments; environmental changes; generational genetic algorithms; incremental genetic algorithms; nonstationary environments; performance; search problem; steady state genetic algorithms; Biological cells; Convergence; Genetic algorithms; Genetic mutations; Mathematical model; Mathematics; Sampling methods; Steady-state; Testing; Wheels;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 1996., Proceedings of IEEE International Conference on
Conference_Location
Nagoya
Print_ISBN
0-7803-2902-3
Type
conf
DOI
10.1109/ICEC.1996.542359
Filename
542359
Link To Document