We compare the search power of crossover and mutation in genetic algorithms. Our discussion is framed within a model of computation using search space structures induced by these operators. Isomorphisms between the search spaces generated by these operators on small populations are identified and explored. These are closely related to the binary reflected Gray code. Using these we generate discriminating functions that are hard for one operator but easy for the other and show how to transform from one case to the other.

We use these functions to provide theoretical evidence that traditional GAs use mutation more effectively than crossover, but dispute claims that mutation is a better search mechanism than crossover. To the contrary, we show that methods that exploit crossover more effectively can be designed and give evidence that these are powerful search mechanisms. Experimental results using GIGA, the Gene Invariant Genetic Algorithm, and the well-known GENESIS program support these theoretical claims.

Finally, this paper provides the initial approach to a different method of analysis of GAs that does not depend on schema analysis or the notions of increased allocations of trials to hyperplanes of above-average fitness. Instead it focuses on the search space structure induced by the operators and the effect of a population search using them.

This content is only available as a PDF.