Genetic algorithms with sharing for multimodal function optimization
Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
An introduction to genetic algorithms
An introduction to genetic algorithms
Evaluating evolutionary algorithms
Artificial Intelligence - Special volume on empirical methods
Evolutionary Optimization in Dynamic Environments
Evolutionary Optimization in Dynamic Environments
Optimal Mutation and Crossover Rates for a Genetic Algorithm Operating in a Dynamic Environment
EP '98 Proceedings of the 7th International Conference on Evolutionary Programming VII
Genetic diversity as an objective in multi-objective evolutionary algorithms
Evolutionary Computation
Towards an analysis of dynamic environments
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Building Blocks, Cohort Genetic Algorithms, and Hyperplane-Defined Functions
Evolutionary Computation
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Understanding the Semantics of the Genetic Algorithm in Dynamic Environments
Proceedings of the 2007 EvoWorkshops 2007 on EvoCoMnet, EvoFIN, EvoIASP,EvoINTERACTION, EvoMUSART, EvoSTOC and EvoTransLog: Applications of Evolutionary Computing
EuroGP'06 Proceedings of the 2006 international conference on Applications of Evolutionary Computing
How long should we run in dynamic optimization?
Proceedings of the 14th annual conference on Genetic and evolutionary computation
A benchmark generator for dynamic permutation-encoded problems
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part II
Hi-index | 0.00 |
We describe a set of measures to examine the behavior of the Genetic Algorithm (GA) in dynamic environments. We describe how to use both average and best measures to look at performance, satisficability, robustness, and diversity. We use these measures to examine GA behavior with a recently devised dynamic test suite, the Shaky Ladder Hyperplane-Defined Functions (sl-hdf's). This test suite can generate random problems with similar levels of difficulty and provides a platform allowing systematic controlled observations of the GA in dynamic environments. We examine the results of these measures in two different versions of the sl-hdf's, one static and one regularly-changing. We provide explanations for the observations in these two different environments, and give suggestions as to future work.