GAs: Why Do They Work?

The theoretical foundations of genetic algorithms rely on a binary string representation of solutions, and on the notion of a schema (see e.g., [142]) — a template allowing exploration of similarities among chromosomes. A schema is built by introducing a don’t care symbol (*) into the alphabet of genes. A schema represents all strings (a hyperplane, or subset of the search space), which match it on all positions other than ‘*’.