Location of Repository

Hierarchical Crossover in Genetic Algorithms

By Peter J. Bentley and Jonathan P. Wakefield

Abstract

This paper identifies the limitations of conventional crossover in genetic algorithms when operating on two chromosomes of differing lengths. To address these problems, the concept of a Semantic Hierarchy (i.e. tree of meaning) of a genotype within a genetic algorithm is introduced. With this in mind, a new form of crossover operator known as Hierarchical Crossover is presented, capable of performing crossover with genotypes of different sizes, while still being functionally equivalent to standard, single-point crossover (or uniform\ud crossover). Various aspects and advantages of this method are discussed. Finally, an example of some results produced by an implementation is shown

Topics: T1, QA75, TA
Year: 1996
OAI identifier: oai:eprints.hud.ac.uk:3973

Suggested articles

Preview

Citations

  1. (1993). A Study in Set Recombination. doi
  2. (1975). Adaptation in Natural and Artificial Systems. doi
  3. (1984). Adaptive Learning Systems. doi
  4. (1990). Genetic Programming: A paradigm for genetically breeding populations of computer programs to solve problems. doi
  5. Hierarchical Crossover in Genetic Algorithms
  6. (1991). mGA in C: A Messy Genetic Algorithm in C. Illinois Genetic Algorithms Laboratory (IlliGAL), report no.
  7. (1996). Overview of a Generic Evolutionary Design System. doi
  8. (1992). The SAGE Cross: The Mechanics of Recombination for Species with Variable-length Genotypes.

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.