Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Characterizing crossover in genetic algorithms

Characterizing crossover in genetic algorithms We characterize crossover and schemata; crossover is a binary operator that preserves schemata and commutes with addition and projection. Moreover, for any setS of chromosomes and familyF of crossover operators, we fully characterize the reachable chromosomes. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Annals of Mathematics and Artificial Intelligence Springer Journals

Characterizing crossover in genetic algorithms

Loading next page...
 
/lp/springer-journals/characterizing-crossover-in-genetic-algorithms-A7Aa4ngEyN

References (16)

Publisher
Springer Journals
Copyright
Copyright
Subject
Computer Science; Artificial Intelligence; Mathematics, general; Computer Science, general; Complex Systems
ISSN
1012-2443
eISSN
1573-7470
DOI
10.1007/BF01530778
Publisher site
See Article on Publisher Site

Abstract

We characterize crossover and schemata; crossover is a binary operator that preserves schemata and commutes with addition and projection. Moreover, for any setS of chromosomes and familyF of crossover operators, we fully characterize the reachable chromosomes.

Journal

Annals of Mathematics and Artificial IntelligenceSpringer Journals

Published: Apr 5, 2005

There are no references for this article.