Abstract
Not so many benchmark problems have been proposed in
the area of Genetic Programming (GP). In this study, a
new artificial benchmark problem is designed for GP.
The different parameters that can be used to tune the
difficulty of the problem are analyzed. Also, the
initial experimental results obtained on different
instances of the problem are presented.
Users
Please
log in to take part in the discussion (add own reviews or comments).