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

Created by W.Langdon from gp-bibliography.bib Revision:1.8051

@Article{KOTZING201494,

• author = "Timo Koetzing and Andrew M. Sutton and Frank Neumann and Una-May O'Reilly",
• title = "The {Max} problem revisited: The importance of mutation in genetic programming",
• journal = "Theoretical Computer Science",
• year = "2014",
• volume = "545",
• pages = "94--107",
• keywords = "genetic algorithms, genetic programming, Mutation, Theory, Runtime analysis",
• ISSN = "0304-3975",
• URL = "http://www.sciencedirect.com/science/article/pii/S0304397513004684",
• DOI = "doi:10.1016/j.tcs.2013.06.014",
• size = "14 pages",
• 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 behaviour of mutation-based genetic programming algorithms.",
• notes = "Genetic and Evolutionary Computation",

}

Genetic Programming entries for Timo Koetzing Andrew M Sutton Frank Neumann Una-May O'Reilly

Citations