Introducing a Perl genetic programming system - and can meta-evolution solve the bloat problem?

Authors:
Robert M. MacCallum
Affiliations:
Stockholm Bioinformatics Center, Stockholm University, Stockholm, Sweden
Venue:
EuroGP'03 Proceedings of the 6th European conference on Genetic programming
Year:
2003

Citing 2
Cited 3

Open BEAGLE: A New C++ Evolutionary Computation Framework

GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Uniform Subtree Mutation

EuroGP '02 Proceedings of the 5th European Conference on Genetic Programming

The 2007 IEEE CEC simulated car racing competition

Genetic Programming and Evolvable Machines
Grammar-based Genetic Programming: a survey

Genetic Programming and Evolvable Machines
A grammatical evolution approach for software effort estimation

Proceedings of the 15th annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

An open source Perl package for genetic programming, called PerlGP, is presented. The supplied algorithm is strongly typed tree-based GP with homologous crossover. User-defined grammars allow any valid Perl to be evolved, including object oriented code and parameters of the PerlGP system itself. Time trials indicate that PerlGP is around 10 times slower than a C based system on a numerical problem, but this is compensated by the speed and ease of implementing new problems, particularly string-based ones. The effect of per-node, fixed and self-adapting crossover and mutation rates on code growth and fitness is studied. On a pi estimation problem, self-adapting rates give both optimal and compact solutions. The source code and manual can be found at http://perlgp.org.