Skip to main content
Article
Ordering Genetic Algorithm Genomes with Reconstructability Analysis
International Journal of General Systems
  • Stephen Shervais, Eastern Washington University
  • Martin Zwick, Portland State University
Document Type
Post-Print
Publication Date
1-1-2003
Subjects
  • Genetic algorithms -- Evaluation,
  • occam (Computer program language),
  • Epistasis (Genetics)
Abstract
The building block hypothesis implies that genetic algorithm effectiveness is influenced by the relative location of epistatic genes on the chromosome. We find that this influence exists, but depends on the generation in which it is measured. Early in the search process it may be more effective to have epistatic genes widely separated. Late in the search process, effectiveness is improved when they are close together. The early search effect is weak but still statistically significant; the late search effect is much stronger and plainly visible. We demonstrate both effects with a set of simple problems, and show that infonnation-theoretic reconstructability analysis can be used to decide on optimal gene ordering.
Description

This is the authors' version of an article that subsequently appeared in the International Journal of General Systems, Vol. 32(5), pp. 491-502.

The version of record may be found at http://www.tandfonline.com/doi/abs/10.1080/0308107031000152513

DOI
10.1080/0308107031000152513
Persistent Identifier
http://archives.pdx.edu/ds/psu/16577
Citation Information
Shervais, Stephen, and Martin Zwick†. "Ordering genetic algorithm genomes with reconstructability analysis." International Journal of General Systems 32.5 (2003): 491-502.