Evolutionary Optimization in Dynamic Environments
Evolutionary Optimization in Dynamic Environments
Genetic diversity as an objective in multi-objective evolutionary algorithms
Evolutionary Computation
GECCO '05 Proceedings of the 7th annual workshop on Genetic and evolutionary computation
Building Blocks, Cohort Genetic Algorithms, and Hyperplane-Defined Functions
Evolutionary Computation
Controlled observations of the genetic algorithm in a changing environment: case studies using the shaky ladder hyperplane-defined functions
EuroGP'06 Proceedings of the 2006 international conference on Applications of Evolutionary Computing
EC'05 Proceedings of the 3rd European conference on Applications of Evolutionary Computing
Hi-index | 0.00 |
Researchers examining genetic algorithms (GAs) in applied settings rarely have access to anything other than fitness values of the best individuals to observe the behavior of the GA. In particular, researchers do not know what schemata are present in the population. Even when researchers look beyond best fitness values, they concentrate on either performance related measures like average fitness and robustness, or low-level descriptions like bit-level diversity measures. To understand the behavior of the GA on dynamic problems, it would be useful to track what is occurring on the "semantic" level of schemata. Thus in this paper we examine the evolving "content" in terms of schemata, as the GA solves dynamic problems. This allows us to better understand the behavior of the GA in dynamic environments. We finish by summarizing this knowledge and speculate about future work to address some of the new problems that we discovered during these experiments.