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

DOI10.1016/J.TCS.2013.06.014MaRDI QIDQ2250999zbMATH OpenOpenAlexFDO

Authors Timo Kötzing, Andrew M. Sutton, F. Neumann, Una-May O'Reilly

Publication date 10 July 2014

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2013.06.014

zbMATH Keywords

genetic programmingmutationruntime analysistheory

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms (68W40) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A max-plus model for genetic algorithms
• Optimal mutation probability for genetic algorithms
• AI*IA 2005: Advances in Artificial Intelligence
• scientific article; zbMATH DE number 1887344
• A new dynamic population variation in genetic programming
• scientific article; zbMATH DE number 1962052

Cites work

• Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
• Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
• Evolvability
• scientific article; zbMATH DE number 795587 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• scientific article; zbMATH DE number 5485575 (Why is no real title available?)
• scientific article; zbMATH DE number 5686753 (Why is no real title available?)
• Limit Theorems in an Occupancy Problem
• Non-uniform mutation rates for problems with unknown solution lengths

Cited in

(6)

• scientific article; zbMATH DE number 1962072 (Why is no real title available?)
• scientific article; zbMATH DE number 1962077 (Why is no real title available?)
• Mathematical analysis of the cumulative effect of novel ternary crossover operator and mutation on probability of survival of a schema
• Runtime analysis of mutation-based geometric semantic genetic programming on Boolean functions
• (1+1) genetic programming with functionally complete instruction sets can evolve Boolean conjunctions and disjunctions with arbitrarily small error
• Runtime analysis of evolutionary neural architecture search for binary classification

This page was built for publication: The Max problem revisited: the importance of mutation in genetic programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2250999)