Does constraining the search space of GA always help?
Luca Manzoni, Luca Mariot, Eva Tuba · Proceedings of the Genetic and Evolutionary Computation Conference Companion · 2019
In this paper, we undertake an investigation on the effect of balanced and unbalanced crossover operators against the problem of finding non-linear balanced Boolean functions: we consider three different balanced crossover operators and compare their performances with classic one-point crossover. The statistical comparison shows that the use of balanced crossover operators gives GA a definite advantage over one-point crossover.