Adaptive Bi-objective Genetic Programming for Data-Driven System Modeling

We propose in this paper a modification of one of the modern state-of-the-art genetic programming algorithms used for data-driven modeling, namely the Bi-objective Genetic Programming (BioGP). The original method is based on a concurrent minimization of both the training error and complexity of multiple candidate models encoded as Genetic Programming trees. Also, BioGP is empowered by a predator-prey co-evolutionary model where virtual predators are used to suppress solutions (preys) characterized by a poor trade-off error vs complexity. In this work, we incorporate in the original BioGP an adaptive mechanism that automatically tunes the mutation rate, based on a characterization of the current population (in terms of entropy) and on the information that can be extracted from it. We show through numerical experiments on two different datasets from the energy domain that the proposed method, named BioAGP (where “A” stands for “Adaptive”), performs better than the original BioGP, allowing the search to maintain a good diversity level in the population, without affecting the convergence rate.