The schema theorem considered insufficient

Abstract

The purpose of this paper is to attempt to verify how the schema theorem affects the behavior of a genetic algorithm (GA) and uncover the relationships between building blocks and increasing schemata. From the analysis of schema tracing, the schema theorem should be interpreted carefully with precise definitions of building block and increasing schema. In addition, we find that an important type of above-average schemata that are not building blocks, which we call phenotypic schemata, always exists among the schemata receiving increasing evaluations during the GA search.<>