Abstract
Bloat is a common and well studied problem in genetic
programming. Size and depth limits are often used to
combat bloat, but to date there has been little
detailed exploration of the effects and biases of such
limits. In this paper we present empirical analysis of
the effects of size and depth limits on binary tree
genetic programs. We find that size limits control
population average size in much the same way as depth
limits do. Our data suggests, however that size limits
provide finer and more reliable control than depth
limits, which has less of an impact upon tree shapes.
Users
Please
log in to take part in the discussion (add own reviews or comments).