Extending Local Search in Geometric Semantic Genetic Programming

In this paper we continue the investigation of the effect of local search in geometric semantic genetic programming (GSGP), with the introduction of a new general local search operator that can be easily customized. We show that it is able to obtain results on par with the current best-performing GSGP with local search and, in most cases, better than standard GSGP.