Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Holland, J.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, MI (1975)
Holland, J.H.: Building blocks, cohort genetic algorithms, and hyperplane-defined functions. Evolutionary Computation 8, 373–391 (2000)
Rand, W., Riolo, R.: Shaky ladders, hyperplane-defined functions and genetic algorithms: Systematic controlled observation in dynamic environments. In: Rothlauf, F., Branke, J., Cagnoni, S., Corne, D.W., Drechsler, R., Jin, Y., Machado, P., Marchiori, E., Romero, J., Smith, G.D., Squillero, G. (eds.) Applications of Evolutionary Computing. LNCS, vol. 3449, Springer, Berlin Heidelberg New York (2005)
Rand, W.: Controlled Observations of the Genetic Algorithm in a Changing Environment: Case Studies Using the Shaky Ladder Hyperplane-Defined Functions. PhD thesis, University of Michigan (2005)
Rand, W., Riolo, R.L.: The effect of building block construction on the behavior of the ga in dynamic environments: A case study using the shaky ladder hyperplane-defined functions. In: EvoWorkshops, pp. 776–787 (2006)
Rosca, J.P.: Analysis of complexity drift in genetic programming. In: Koza, J.R. (ed.) Genetic Programming, pp. 286–294. Morgan Kaufmann, Stanford University, CA, USA (1997)
Toffolo, A., Benini, E.: Genetic diversity as an objective in multi-objective evolutionary algorithms. Evolutionary Computation 11, 151–167 (2003)
Branke, J.: Evolutionary Optimization in Dynamic Environments. Kluwer, Dordrecht (2001)
Rand, W., Riolo, R.: Measurements for understanding the behavior of the genetic algorithm in dynamic environments. In: Beyer, H.G. (ed.) GECCO, ACM Press, New York (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alharbi, A., Rand, W., Riolo, R. (2007). Understanding the Semantics of the Genetic Algorithm in Dynamic Environments. In: Giacobini, M. (eds) Applications of Evolutionary Computing. EvoWorkshops 2007. Lecture Notes in Computer Science, vol 4448. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71805-5_72
Download citation
DOI: https://doi.org/10.1007/978-3-540-71805-5_72
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71804-8
Online ISBN: 978-3-540-71805-5
eBook Packages: Computer ScienceComputer Science (R0)