The tree-string problem: an artificial domain for structure and content search

Authors:
Steven Gustafson;Edmund K. Burke;Natalio Krasnogor
Affiliations:
School of Computer Science & IT, University of Nottingham, Nottingham, United Kingdom;School of Computer Science & IT, University of Nottingham, Nottingham, United Kingdom;School of Computer Science & IT, University of Nottingham, Nottingham, United Kingdom
Venue:
EuroGP'05 Proceedings of the 8th European conference on Genetic Programming
Year:
2005

Citing 14
Cited 7

How easy is local search?

Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
The royal tree problem, a benchmark for single and multiple population genetic programming

Advances in genetic programming
Foundations of genetic programming

Foundations of genetic programming
A Probabilistic Approach to Collaborative Multi-Robot Localization

Autonomous Robots
What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming

Genetic Programming and Evolvable Machines
An Evaluation of EvolutionaryGeneralisation in Genetic Programming

Artificial Intelligence Review
Induction of Decision Trees

Machine Learning
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
Multi-Objective Methods for Tree Size Control

Genetic Programming and Evolvable Machines
Stochastic Hillclimbing as a Baseline Method for

Stochastic Hillclimbing as a Baseline Method for
Genetic Programming IV: Routine Human-Competitive Machine Intelligence

Genetic Programming IV: Routine Human-Competitive Machine Intelligence
Problem Difficulty and Code Growth in Genetic Programming

Genetic Programming and Evolvable Machines
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
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

The speciating island model: an alternative parallel evolutionary algorithm

Journal of Parallel and Distributed Computing - Special issue on parallel bioinspired algorithms
An island model for high-dimensional genomes using phylogenetic speciation and species barcoding

Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Semantic analysis of program initialisation in genetic programming

Genetic Programming and Evolvable Machines
The K landscapes: a tunably difficult benchmark for genetic programming

Proceedings of the 13th annual conference on Genetic and evolutionary computation
Genetic programming needs better benchmarks

Proceedings of the 14th annual conference on Genetic and evolutionary computation
Autoconstructive evolution for structural problems

Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
Better GP benchmarks: community survey results and proposals

Genetic Programming and Evolvable Machines

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces the Tree-String problem for genetic programming and related search and optimisation methods. To improve the understanding of optimisation and search methods, we aim to capture the complex dynamic created by the interdependencies of solution structure and content. Thus, we created an artificial domain that is amenable for analysis, yet representative of a wide-range of real-world applications. The Tree-String problem provides several benefits, including: the direct control of both structure and content objectives, the production of a rich and representative search space, the ability to create tunably difficult and random instances and the flexibility for specialisation.