Elsevier

Theoretical Computer Science

Volume 545, 14 August 2014, Pages 94-107
Theoretical Computer Science

The Max problem revisited: The importance of mutation in genetic programming

https://doi.org/10.1016/j.tcs.2013.06.014Get rights and content
Under an Elsevier user license
open archive

Abstract

We study the importance of mutation in genetic programming and contribute to the rigorous understanding of genetic programming algorithms by providing runtime complexity analyses for the well-known Max problem. Several experimental studies have indicated that it is hard to solve the Max problem with crossover-based algorithms. Our analyses show that different variants of the Max problem can provably be solved efficiently using simple mutation-based genetic programming algorithms.

Our results advance the body of computational complexity analyses of genetic programming, indicate the importance of mutation in genetic programming, and reveal new insights into the behavior of mutation-based genetic programming algorithms.

Keywords

Genetic programming
Mutation
Theory
Runtime analysis

Cited by (0)