Size Fair and Homologous Tree Crossovers for Tree Genetic Programming

被引：85

作者：

W. B. Langdon

机构：

[1] Centrum voor Wiskunde en Informatica,

来源：

Genetic Programming and Evolvable Machines | 2000年 / 1卷 / 1-2期

关键词：

genetic algorithms; genetic programming; bloat reduction; evolution of shape; subquadratic length growth; linear depth growth; uniform initialization; binary tree search spaces;

D O I：

10.1023/A:1010024515191

中图分类号：

学科分类号：

摘要：

Size fair and homologous crossover genetic operators for tree based genetic programming are described and tested. Both produce considerably reduced increases in program size (i.e., less bloat) and no detrimental effect on GP performance.

引用

页码：95 / 119

页数：24

共 7 条

[1]

Chellapilla K.(1997)Evolving computer programs without subtree crossover IEEE Transactions on Evolutionary Computation 1 209-216

[2]

Flajolet P.(1982)The average height of binary trees and other simple trees Journal of Computer and System Sciences 25 171-213

[3]

Oldyzko A.(1998)Schema theory for genetic programming with one-point crossover and point mutation Evolutionary Computation 6 231-252

[4]

Poli R.(1995)Balancing accuracy and parsimony in genetic programming Evolutionary Computation 3 17-38

[5]

Langdon W. B.(undefined)undefined undefined undefined undefined-undefined

[6]

Zhang B.-T.(undefined)undefined undefined undefined undefined-undefined

[7]

Mühlenbein H.(undefined)undefined undefined undefined undefined-undefined

← 1 →