Abstract
Gene Expression Programming (GEP) is a new
evolutionary algorithm that incorporates both the idea
of simple, linear chromosomes of fixed length used in
Genetic Algorithms (GAs) and the structure of different
sizes and shapes used in Genetic Programming (GP). As
with other genetic programming algorithms, GEP has
difficulty finding appropriate numeric constants for
terminal nodes in the expression trees. In this paper,
we describe a new approach of constant generation using
Differential Evolution (DE), which is a simple
real-valued GA that has proven to be robust and
efficient on parameter optimisation problems. Our
experimental results on two symbolic regression
problems show that the approach significantly improves
the performance of the GEP algorithm. The proposed
approach can be easily extended to other Genetic
Programming variants.
Users
Please
log in to take part in the discussion (add own reviews or comments).