Shuffle crossover and mutual information

We introduce a crossover operator that is not dependent on the initial layout of the genome. While maintaining a low positional bias, the MISC (mutual information and shuffle crossover) algorithm is competitive with one-point crossover and works by automatically regrouping bits that are considered t...

Full description

Saved in:
Bibliographic Details
Main Author: Burkowski, F.J.
Format: Conference Proceeding
Language:English
Subjects:
Bayesian methods
Bioinformatics
Character generation
Computer science
Genetic algorithms
Genetic communication
Genomics
Ground penetrating radar
Information theory
Mutual information
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We introduce a crossover operator that is not dependent on the initial layout of the genome. While maintaining a low positional bias, the MISC (mutual information and shuffle crossover) algorithm is competitive with one-point crossover and works by automatically regrouping bits that are considered to be interdependent. The heuristic strategy is to derive an operator that promotes the expansion of building blocks as required by a genetic algorithm.
DOI:10.1109/CEC.1999.782671