Elitism reduces bloat in genetic programming

Authors:
Riccardo Poli;Nicholas Freitag McPhee;Leonardo Vanneschi
Affiliations:
University of Essex, Colchester, United Kngdm;University of Minnesota, Morris, MN, USA;University of Milano-Bicocca, Milan, Italy
Venue:
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Year:
2008

Citing 5
Cited 6

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

Genetic programming: on the programming of computers by means of natural selection
Genetic programming II: automatic discovery of reusable programs

Genetic programming II: automatic discovery of reusable programs
Foundations of genetic programming

Foundations of genetic programming
Dynamics of evolutionary robustness

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

A Field Guide to Genetic Programming

Dynamic limits for bloat control in genetic programming and a review of past and current bloat theories

Genetic Programming and Evolvable Machines
Elitism, fitness, and growth

Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Implicitly controlling bloat in genetic programming

IEEE Transactions on Evolutionary Computation
Reassembling operator equalisation: a secret revealed

Proceedings of the 13th annual conference on Genetic and evolutionary computation
Reassembling operator equalisation: a secret revealed

ACM SIGEVOlution
Operator equalisation for bloat free genetic programming and a survey of bloat control methods

Genetic Programming and Evolvable Machines

Quantified Score

Hi-index	0.00

Visualization

Abstract

Elitism is commonly used in generational GP to ensure that the best individuals discovered in a generation are not lost, and are made available for possible further improvements to new generations. Using two GP systems and four problems, we show how elitism reduces the growth of mean program size.