Probing for limits to building block mixing with a tunably-difficult problem for genetic programming

Authors:
Jason M. Daida;Michael E. Samples;Matthew J. Byom
Affiliations:
University of Michigan, Ann Arbor, MI;University of Michigan, Ann Arbor, MI;University of Michigan, Ann Arbor, MI
Venue:
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Year:
2005

Citing 12
Cited 2

The royal tree problem, a benchmark for single and multiple population genetic programming

Advances in genetic programming
Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator

ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on uniform random number generation
Analysis of single-node (building) blocks in 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
Calculating the expected loss of diversity of selection schemes

Evolutionary Computation
General Schema Theory for Genetic Programming with Subtree-Swapping Crossover

EuroGP '01 Proceedings of the 4th European Conference on Genetic Programming
Exons and Code Growth in Genetic Programming

EuroGP '02 Proceedings of the 5th European Conference on Genetic Programming
Where Does the Good Stuff Go, and Why? How Contextual Semantics Influences Program Structure in Simple Genetic Programming

EuroGP '98 Proceedings of the First European Workshop on Genetic Programming
Towards identifying populations that increase the likelihood of success in genetic programming

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
An adverse interaction between crossover and restricted tree depth in genetic programming

GECCO '96 Proceedings of the 1st annual conference on Genetic and evolutionary computation
Identifying structural mechanisms in standard genetic programming

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
What makes a problem GP-hard? validating a hypothesis of structural causes

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII

Towards identifying populations that increase the likelihood of success in genetic programming

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
A divide & conquer strategy for improving efficiency and probability of success in genetic programming

EuroGP'06 Proceedings of the 9th European conference on Genetic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes a tunably-difficult problem for genetic programming (GP) that probes for limits to building block mixing and assembly. The existence of such a problem can be used to garner insight into the dynamics of what happens during the course of a GP run. The results indicate that the amount of mixing is fairly low in comparison to the amount of content that could be present in an initial population.