The Algebra of Genetic Algorithms (1994)
Cached
Download Links
- [ftp.quadstone.com]
- [ftp.epcc.ed.ac.uk]
- [users.breathemail.net]
- DBLP
Other Repositories/Bibliography
| Citations: | 57 - 10 self |
BibTeX
@MISC{Radcliffe94thealgebra,
author = {Nicholas J. Radcliffe},
title = {The Algebra of Genetic Algorithms},
year = {1994}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
A rigorous formulation of the generalisation of schema analysis known as forma analysis is presented. This is shown to provide a direct mechanism for harnessing knowledge about a search space, codified through the imposition of equivalence relations over that space, to generate a genetic representation and operators. It is shown that a single characterisation of a space leads to a unique genetic representation, and the kinds of representations that are possible are classified and discussed. A relatively new operator, call random assorting recombination (RARw ), is defined rigorously and is shown to be, in an important sense, a universal recombination operator.
