Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics

Authors:
Greg Durrett;Frank Neumann;Una-May O'Reilly
Affiliations:
Massachusetts Institute of Technology, Cambridge, MA, USA;University of Adelaide, Adelaide, Australia;Massachusetts Institute of Technology, Cambridge, MA, USA
Venue:
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms
Year:
2011

Citing 10
Cited 10

A comparative analysis of genetic programming

Advances in genetic programming
On the analysis of the (1+ 1) evolutionary algorithm

Theoretical Computer Science
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
"Balls into Bins" - A Simple and Tight Analysis

RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
An analysis of genetic programming

An analysis of genetic programming
Some New Aspects of the Coupon Collector's Problem

SIAM Journal on Discrete Mathematics
Runtime Analysis of the (μ+1) EA on Simple Pseudo-Boolean Functions

Evolutionary Computation
Theoretical results in genetic programming: the next ten years?

Genetic Programming and Evolvable Machines
Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity

Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity
Evolutionary algorithms - how to cope with plateaus of constantfitness and when to reject strings of the same fitness

IEEE Transactions on Evolutionary Computation

PAC learning and genetic programming

Proceedings of the 13th annual conference on Genetic and evolutionary computation
How far is it from here to there? a distance that is coherent with GP operators

EuroGP'11 Proceedings of the 14th European conference on Genetic programming
Computational complexity analysis of multi-objective genetic programming

Proceedings of the 14th annual conference on Genetic and evolutionary computation
The max problem revisited: the importance of mutation in genetic programming

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
Experimental supplements to the computational complexity analysis of genetic programming for problems modelling isolated program semantics

PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
Parsimony pressure versus multi-objective optimization for variable length representations

PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
Runtime analysis of mutation-based geometric semantic genetic programming on boolean functions

Proceedings of the twelfth workshop on Foundations of genetic algorithms XII
Single- and multi-objective genetic programming: new bounds for weighted order and majority

Proceedings of the twelfth workshop on Foundations of genetic algorithms XII
Runtime analysis of mutation-based geometric semantic genetic programming for basis functions regression

Proceedings of the 15th annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, we start the computational complexity analysis of genetic programming (GP). We set up several simplified GP algorithms and analyze them on two separable model problems, ORDER and MAJORITY, each of which captures a relevant facet of typical GP problems. Both analyses give first rigorous insights into aspects of GP design, highlighting in particular the impact of accepting or rejecting neutral moves and the importance of a local mutation operator.