Improved directed acyclic graph evaluation and the combine operator in genetic programming

Authors:
Herman Ehrenburg
Affiliations:
CWI, SJ, Amsterdam
Venue:
GECCO '96 Proceedings of the 1st annual conference on Genetic and evolutionary computation
Year:
1996

Citing 3
Cited 2

Introduction to algorithms

Introduction to algorithms
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 in C++: implementation issues

Advances in genetic programming

Analyzing Directed Acyclic Graph Recombination

Proceedings of the International Conference, 7th Fuzzy Days on Computational Intelligence, Theory and Applications
The effectiveness of cost based subtree caching mechanisms in typed genetic programming for image segmentation

EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The use of a directed acyclic graph (DAG) to represent a population in genetic programming offers several advantages, only one of which is the efficient use of space. We improve on existing methods to evaluate a DAG and offer two new ways of evaluating a population. The first method uses a linked list and a negligible amount of space. In the second method, each node is evaluated only once on all fitness cases and the results are cached. We also introduce two genetic operators in connection to the use of a DAG. The first is a simpler alternative to crossover. The second is a context-preserving genetic operator based on the building block hypothesis, which accurately combines two similar trees.