Ordering Genetic Algorithm Genomes With Reconstructability Analysis: Discrete Models

Authors

Stephen Shervais, Eastern Washington University
Martin Zwick, Portland State UniversityFollow

Document Type

Conference Proceeding

Publication Date

10-2005

Subjects

Genetic algorithms -- Evaluation, occam (Computer program language), Epistasis (Genetics), Data mining

Abstract

The building block hypothesis implies that genetic algorithm effectiveness is influenced by the relative location of epistatic genes on the chromosome. We demonstrate this with a discrete-valued problem, based on Kauffman’s NK model, and show that information-theoretic reconstructability analysis can be used to decide on optimal gene ordering.

Description

Presented at IEEE International Conference on Systems, Man and Cybernetics, Waikoloa, Hawaii, USA, October 10-12, 2005

Persistent Identifier

https://archives.pdx.edu/ds/psu/27747

Citation Details

Shervais, Stephen and Zwick, Martin, "Ordering Genetic Algorithm Genomes With Reconstructability Analysis: Discrete Models" (2005). Systems Science Faculty Publications and Presentations. 141.
https://archives.pdx.edu/ds/psu/27747