Hierarchical Crossover in Genetic Algorithms

Bentley, Peter J. and Wakefield, Jonathan P. (1996) Hierarchical Crossover in Genetic Algorithms. In: Proceedings of the 1st On-line Workshop on Soft Computing (WSC1), 19-30 August 1996, Nagoya University, Japan.

PDF - Published Version Download (255kB)

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
crossover). Various aspects and advantages of this method are discussed. Finally, an example of some results produced by an implementation is shown.

Item Type:	Conference or Workshop Item (Paper)
Uncontrolled Keywords:	hierarchical crossover, semantic hierarchy, variable-length chromosome, genetic algorithm, evolutionary design
Subjects:	T Technology > T Technology (General) Q Science > QA Mathematics > QA75 Electronic computers. Computer science T Technology > TA Engineering (General). Civil engineering (General)
Schools:	School of Computing and Engineering School of Computing and Engineering > Pedagogical Research Group School of Computing and Engineering > Music Technology and Production Research Group
Related URLs:	Author Conference
Depositing User:	Jonathan Wakefield
Date Deposited:	24 Apr 2009 08:21
Last Modified:	28 Aug 2021 23:11
URI:	http://eprints.hud.ac.uk/id/eprint/3973

Downloads

Repository Staff Only: item control page

View Item