Resource-limited Genetic Programming: Replacing tree depth limits

被引:7
作者
Silva, S [1 ]
Silva, PJN [1 ]
Costa, E [1 ]
机构
[1] Univ Coimbra, Ctr Informat & Sist, P-3030 Coimbra, Portugal
来源
ADAPTIVE AND NATURAL COMPUTING ALGORITHMS | 2005年
关键词
D O I
10.1007/3-211-27389-1_58
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We propose replacing the traditional tree depth limit in Genetic Programming by a single limit on the amount of resources available to the whole population, where resources are the tree nodes. The resource-limited technique removes the disadvantages of using depth limits at the individual level, while introducing automatic population resizing, a natural side-effect of using an approach at the population level. The results show that the replacement of individual depth limits by a population resource limit can be done without impairing performance, thus validating this first and important step towards a new approach to improving the efficiency of GP.
引用
收藏
页码:243 / 246
页数:4
相关论文
共 16 条
[1]  
[Anonymous], 1998, Genetic programming: an introduction
[2]  
Fernandez F, 2003, LECT NOTES COMPUT SC, V2610, P317
[3]  
Fernández F, 2003, IEEE C EVOL COMPUTAT, P2042
[4]  
KENNEDY CJ, 1999, P 4 INT C ART NEUR N, P1
[5]  
Koza J.R., 1992, GENETIC PROGRAMMING
[6]   Size Fair and Homologous Tree Crossovers for Tree Genetic Programming [J].
W. B. Langdon .
Genetic Programming and Evolvable Machines, 2000, 1 (1-2) :95-119
[7]  
Luke S, 2003, LECT NOTES COMPUT SC, V2724, P1729
[8]  
Panait L, 2004, LECT NOTES COMPUT SC, V3103, P630
[9]  
Poli R, 2003, LECT NOTES COMPUT SC, V2610, P204
[10]  
Sean Luke, 2002, P 4 ANN C GENETIC EV, P829