Hierarchical Crossover in Genetic Algorithms

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

Similar works

This paper was published in University of Huddersfield Repository.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.