Reducing bloat in genetic programming

DOI10.1007/3-540-45493-4_48MaRDI QIDQ4448596zbMATH OpenFDO

Authors Patrick Monsieurs, E. Flerackers

Publication date 18 February 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2206/22060471.htm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• A simple but theoretically-motivated method to control bloat in genetic programming
• Parsimony pressure made easy: solving the problem of bloat in GP
• scientific article; zbMATH DE number 1944897
• The root causes of code growth in genetic programming
• Neutral offspring controlling operators in genetic programming

Cited in

(13)

• Efficient tree traversal to reduce code growth in tree-based genetic programming
• Simplification of genetic programs: a literature survey
• Neutral offspring controlling operators in genetic programming
• Shorter fitness preserving genetic programs
• Parsimony pressure made easy: solving the problem of bloat in GP
• scientific article; zbMATH DE number 1944897 (Why is no real title available?)
• Reducing population size while maintaining diversity
• A simple but theoretically-motivated method to control bloat in genetic programming
• The effect of plagues in genetic programming: A study of variable-size populations
• The root causes of code growth in genetic programming
• Population implosion in genetic programming
• Dynamic maximum tree depth
• Avoiding the bloat with stochastic grammar-based genetic programming

This page was built for publication: Reducing bloat in genetic programming

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