Parsimony pressure made easy: solving the problem of bloat in GP

DOI10.1007/978-3-642-33206-7_9MaRDI QIDQ3459679zbMATH OpenOpenAlexFDO

Authors Riccardo Poli, Nicholas Freitag McPhee

Publication date 11 January 2016

Published in Theory and Principled Methods for the Design of Metaheuristics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-33206-7_9

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 1962053
• scientific article; zbMATH DE number 2044678
• The impact of lexicographic parsimony pressure for ORDER/MAJORITY on the run time
• scientific article; zbMATH DE number 1962076
• Destructiveness of lexicographic parsimony pressure and alleviation by a concatenation crossover in genetic programming

Cited in

(7)

• Destructiveness of lexicographic parsimony pressure and alleviation by a concatenation crossover in genetic programming
• The impact of lexicographic parsimony pressure for ORDER/MAJORITY on the run time
• scientific article; zbMATH DE number 1700032 (Why is no real title available?)
• scientific article; zbMATH DE number 1962053 (Why is no real title available?)
• scientific article; zbMATH DE number 2044678 (Why is no real title available?)
• scientific article; zbMATH DE number 2040716 (Why is no real title available?)
• scientific article; zbMATH DE number 2086452 (Why is no real title available?)

This page was built for publication: Parsimony pressure made easy: solving the problem of bloat in GP

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