ORDERTREE: a new test problem for genetic programming

Authors:
Tuan-Hao Hoang;Nguyen Xuan Hoai;Nguyen Thi Hien;RI McKay;Daryl Essam
Affiliations:
University of New South Wales @ Australian Defence Force Academy, Canberra, Australia;Vietnamese Military Technical Academy, Hanoi, Vietnam;Vietnamese Military Technical Academy, Hanoi, Vietnam;Seoul National University, South Korea;University of New South Wales @ ADFA, Canberra, Australia
Venue:
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Year:
2006

Citing 17
Cited 3

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
Genetic programming: an introduction: on the automatic evolution of computer programs and its applications

Genetic programming: an introduction: on the automatic evolution of computer programs and its applications
Foundations of genetic programming

Foundations of genetic programming
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
The Design of Innovation: Lessons from and for Competent Genetic Algorithms

The Design of Innovation: Lessons from and for Competent Genetic Algorithms
What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming

Genetic Programming and Evolvable Machines
A Representation for the Adaptive Generation of Simple Sequential Programs

Proceedings of the 1st International Conference on Genetic Algorithms
Modeling Building-Block Interdependency

PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
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
A Puzzle to Challenge Genetic Programming

EuroGP '02 Proceedings of the 5th European Conference on Genetic Programming
Genetic Algorithms: Principles and Perspectives: A Guide to GA Theory

Genetic Algorithms: Principles and Perspectives: A Guide to GA Theory
Problem Difficulty and Code Growth in Genetic Programming

Genetic Programming and Evolvable Machines
Solving the symbolic regression problem with tree-adjunct grammar guided genetic programming: the comparative results

CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
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

Program optimization by random tree sampling

Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Genetic programming needs better benchmarks

Proceedings of the 14th annual conference 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

In this paper, we describe a new test problem for genetic programming (GP), ORDERTREE. We argue that it is a natural analogue of ONEMAX, a popular GA test problem, and that it also avoids some of the known weaknesses of other benchmark problems for Genetic Programming. Through experiments, we show that the difficulty of the problem can be tuned not only by increasing the size of the problem, but also by increasing the non-linearity in the fitness structure.