Schema Theorem
- Holland's Schema Theorem states that
where
- instances of schema in population at time .
- average fitness of population at time .
- average fitness of instances of at time .
- probability of single point crossover operator.
- probability of mutation operator.
- length of single bit strings.
- number of defined (non *) bits in .
- distance between leftmost, rightmost defined bits in .
- More fit schemas will tend to grow in influence,
especially those containing a small number of defined bits and
when these bits are close together.
- It is incomplete, e.g., it fails to consider the possitive
effects of crossover and mutation.