Bloat control in genetic programming by evaluating contribution of nodes

Authors:
Andy Song;Dunhai Chen;Mengjie Zhang
Affiliations:
RMIT University, Melbourne, Australia;RMIT University, Melbourne, Australia;Victoria University of Wellington, Wellington, New Zealand
Venue:
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Year:
2009

Citing 3
Cited 1

A comparison of bloat control methods for genetic programming

Evolutionary Computation
Robust method of detecting moving objects in videos evolved by genetic programming

Proceedings of the 10th annual conference on Genetic and evolutionary computation
A Field Guide to Genetic Programming

A Field Guide to Genetic Programming

A relaxed approach to simplification in genetic programming

EuroGP'10 Proceedings of the 13th European conference on Genetic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Unnecessary growth in program size is known as bloat problem in Genetic Programming. There are a large number of studies addressing this problem. In this paper, we propose an effective bloat control mechanism which is based on examining the contribution of each function node in the selected programs. Nodes without contribution will be removed before generating offspring. The results show that the method can significantly reduce program size without compromising fitness. Furthermore it speeds up evolution processes because of the saving in evaluation costs.