Dynamic Maximum Tree Depth

author = "Sara Silva and Jonas Almeida",

title = "Dynamic Maximum Tree Depth",

title2 = "A Simple Technique for Avoiding Bloat in Tree-Based GP",

booktitle = "Genetic and Evolutionary Computation -- GECCO-2003",

editor = "E. Cant{\'u}-Paz and J. A. Foster and K. Deb and D. Davis and R. Roy and U.-M. O'Reilly and H.-G. Beyer and R. Standish and G. Kendall and S. Wilson and M. Harman and J. Wegener and D. Dasgupta and M. A. Potter and A. C. Schultz and K. Dowsland and N. Jonoska and J. Miller",

year = "2003",

pages = "1776--1787",

address = "Chicago",

publisher_address = "Berlin",

month = "12-16 " # jul,

volume = "2724",

series = "LNCS",

ISBN = "3-540-40603-4",

publisher = "Springer-Verlag",

keywords = "genetic algorithms, genetic programming",

URL = "

http://cisuc.dei.uc.pt/ecos/dlfile.php?fn=109_pub_27241776.pdf",

URL = "

http://cisuc.dei.uc.pt/ecos/dlfile.php?fn=109_pub_27241776.pdf&idp=109",

DOI = "

doi:10.1007/3-540-45110-2_69",

abstract = "We present a technique, designated as dynamic maximum tree depth, for avoiding excessive growth of tree-based GP individuals during the evolutionary process. This technique introduces a dynamic tree depth limit, very similar to the Koza-style strict limit except in two aspects: it is initially set with a low value; it is increased when needed to accommodate an individual that is deeper than the limit but is better than any other individual found during the run. The results show that the dynamic maximum tree depth technique efficiently avoids the growth of trees beyond the necessary size to solve the problem, maintaining the ability to find individuals with good fitness values. When compared to lexicographic parsimony pressure, dynamic maximum tree depth proves to be significantly superior. When both techniques are coupled, the results are even better.",

notes = "GECCO-2003. A joint meeting of the twelfth International Conference on Genetic Algorithms (ICGA-2003) and the eighth Annual Genetic Programming Conference (GP-2003)",