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.
Original language | English (US) |
---|---|
Pages (from-to) | 94-107 |
Number of pages | 14 |
Journal | Theoretical Computer Science |
Volume | 545 |
Issue number | C |
DOIs | |
State | Published - 2014 |
Bibliographical note
Publisher Copyright:© 2013 Elsevier B.V.
Keywords
- Genetic programming
- Mutation
- Runtime analysis
- Theory