Understanding the semantics of the genetic algorithm in dynamic environments - A case study using the shaky ladder hyperplane-defined functions

Alharbi A., Rand W., Riolo R.

EvoWorkshops 2007, Valencia, Spain, 11 - 13 April 2007, vol.4448, pp.657-658 identifier

  • Publication Type: Conference Paper / Full Text
  • Volume: 4448
  • City: Valencia
  • Country: Spain
  • Page Numbers: pp.657-658
  • Istanbul Technical University Affiliated: No


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 CA 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 CA solves dynamic problems. This allows us to better understand the behavior of the CA 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.