Two fast tree-creation algorithms for genetic programming
Luke, S.
Dept. of Comput. Sci., Maryland Univ., College Park, MD;
This paper appears in: Evolutionary Computation, IEEE Transactions on
Publication Date: Sep 2000
Volume: 4,
Issue: 3
On page(s): 274-283
ISSN: 1089-778X
References Cited: 21
CODEN: ITEVF5
INSPEC Accession Number: 6737704
Digital Object Identifier: 10.1109/4235.873237
Current Version Published: 2002-08-06
Abstract
Genetic programming is an evolutionary optimization method that
produces functional programs to solve a given task. These programs
commonly take the form of trees representing LISP s-expressions, and a
typical evolutionary run produces a great many of these trees. For this
reason, a good tree-generation algorithm is very important to genetic
programming. This paper presents two new tree-generation algorithms for
genetic programming and for “strongly typed” genetic
programming, a common variant. These algorithms are fast, allow the user
to request specific tree sizes, and guarantee probabilities of certain
nodes appearing in trees. The paper analyzes these two algorithms, and
compares them with traditional and recently proposed approaches
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
