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
The royal tree problem, a benchmark for single and multiple population genetic programming
Advances in genetic programming
What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming
Genetic Programming and Evolvable Machines
An Analysis of the Causes of Code Growth in Genetic Programming
Genetic Programming and Evolvable Machines
PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
ORDERTREE: a new test problem for genetic programming
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Using context-aware crossover to improve the performance of GP
Proceedings of the 8th annual conference on Genetic and evolutionary computation
On the behavioral diversity of random programs
Proceedings of the 9th annual conference on Genetic and evolutionary computation
The impact of population size on code growth in GP: analysis and empirical validation
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Symbolic regression using nearest neighbor indexing
Proceedings of the 12th annual conference companion on Genetic and evolutionary computation
Hi-index | 0.00 |
This paper describes a new program evolution method named PORTS (Program Optimization by Random Tree Sampling) which is motivated by the idea of preservation and control of tree fragments. We hypothesize that to reconstruct building blocks efficiently, tree fragments of any size should be preserved into the next generation, according to their differential fitnesses. PORTS creates a new individual by sampling from the promising trees by traversing and transition between trees instead of subtree crossover and mutation. Because the size of a fragment preserved during a generation update follows a geometric distribution, merits of the method are that it is relatively easy to predict the behavior of tree fragments over time and to control sampling size, by changing a single parameter. Our experimental results on three benchmark problems show that the performance of PORTS is competitive with SGP (Simple Genetic Programming). And we observed that there is a significant difference of fragment distribution between PORTS and simple GP.