Strongly Typed Genetic Programming (1994)
Cached
Download Links
- [ftp.mad-scientist.com]
- [ftp.recherche.enac.fr]
- [vishnu.bbn.com]
- DBLP
Other Repositories/Bibliography
| Venue: | Evolutionary Computation |
| Citations: | 206 - 1 self |
BibTeX
@ARTICLE{Montana94stronglytyped,
author = {David J. Montana},
title = {Strongly Typed Genetic Programming},
journal = {Evolutionary Computation},
year = {1994},
volume = {3},
pages = {199--230}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Genetic programming is a powerful method for automatically generating computer programs via the process of natural selection [Koza 92]. However, it has the limitation known as "closure", i.e. that all the variables, constants, arguments for functions, and values returned from functions must be of the same data type. To correct this deficiency, we introduce a variation of genetic programming called "strongly typed" genetic programming(STGP). In STGP, variables, constants, arguments, and returned values can be of any data type with the provision that the data type for each such value be specified beforehand. This allows the initialization process and the genetic operators to only generate syntactically correct parse trees. Key concepts for STGP are generic functions, which are not true strongly typed functions but rather templates for classes of such functions, and generic data types, which are analogous. To illustrate STGP, we present four examples involving vector/matrix manip...
