Reducing Bloat in Genetic Programming

Authors:
Patrick Monsieurs;Eddy Flerackers
Affiliations:
-;-
Venue:
Proceedings of the International Conference, 7th Fuzzy Days on Computational Intelligence, Theory and Applications
Year:
2001

Citing 5
Cited 3

Genetic programming: on the programming of computers by means of natural selection

Genetic programming: on the programming of computers by means of natural selection
Pygmies and civil servants

Advances in genetic programming
Recombination, selection, and the genetic construction of computer programs

Recombination, selection, and the genetic construction of computer programs
An analysis of genetic programming

An analysis of genetic programming
Effects of code growth and parsimony pressure on populations in genetic programming

Evolutionary Computation

A survey and taxonomy of performance improvement of canonical genetic programming

Knowledge and Information Systems
Reducing population size while maintaining diversity

EuroGP'03 Proceedings of the 6th European conference on Genetic programming
Long memory time series forecasting by using genetic programming

Genetic Programming and Evolvable Machines

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, several techniques will be presented to constrain the growth of solutions that are constructed by genetic programming. The most successful technique imposes a maximum size on the created individuals of the population that depends solely on the size of the best individual of the population. This method will be compared with other methods to reduce bloat, demonstrating that this method reduces bloat significantly better than the other methods.