4.7 Article

Building Blocks, Cohort Genetic Algorithms, and Hyperplane-Defined Functions

Journal

EVOLUTIONARY COMPUTATION
Volume 8, Issue 4, Pages 373-391

Publisher

MIT PRESS
DOI: 10.1162/106365600568220

Keywords

Building blocks; chromosome-like strings; crossover; fitness; genetic algorithms; schema; search spaces; robustness; selection; test functions

Ask authors/readers for more resources

Building blocks are a ubiquitous feature at all levels of human understanding, from perception through science and innovation. Genetic algorithms are designed to exploit this prevalence. A new, more robust class of genetic algorithms, cohort genetic algorithms (cGA's), provides substantial advantages in exploring search spaces for building blocks while exploiting building blocks already found. To test these capabilities, a new, general class of test functions, the hyperplane-defined functions (hdf's), has been designed. Hdf's offer the means of tracing the origin of each advance in performance; at the same time hdf's are resistant to reverse engineering, so that algorithms cannot be designed to take advantage of the characteristics of particular examples.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available