title: A comparison of bloat control methods for genetic programming.
abstract: Genetic programming has highlighted the problem of bloat, the uncontrolled growth of the average size of an individual in the population. The most common approach to dealing with bloat in tree-based genetic programming individuals is to limit their maximal allowed depth. An alternative to depth limiting is to punish individuals in some way based on excess size, and our experiments have shown that the combination of depth limiting with such a punitive method is generally more effective than either alone. Which such combinations are most effective at reducing bloat? In this article we augment depth limiting with nine bloat control methods and compare them with one another. These methods are chosen from past literature and from techniques of our own devising. esting with four genetic programming problems, we identify where each bloat control method performs well on a per-problem basis, and under what settings various methods are effective independent of problem. We report on the results of these tests, and discover an unexpected winner in the cross-platform category.
authors.affiliation: Department of Computer Science, George Mason University, Fairfax, VA 22030, USA. sean@cs.gmu.edu
authors.forename: Sean
authors.initials: S
authors.lastname: Luke
authors.forename: Liviu
authors.initials: L
authors.lastname: Panait
mesh_terms: D000818:Animals; D001000:Ants / Q000502:physiology; D005828:Genetics, Population; D016014:Linear Models; D008957:Models, Genetic; D011156:Population Density; D012044:Regression Analysis; D012984:Software; D014197:Trees