Generalizing the notion of schema in genetic algorithms

摘要

In this paper we examine some of the fundamental assumptions which are frequently used to explain the practical success which Genetic Algorithms (GAs) have enjoyed. Specifically, the concept of schema and the Schema Theorem are interpreted from a new perspective. This allows GAs to be regarded as a constrained random walk, and offers a view which is amenable to generalization. The minimal deceptive problem (a problem designed to mislead the genetic paradigm) is analyzed in the context provided by our interpretation, where a different aspect of its difficulty emerges.