An empirical study on the synergy of multiple crossover operators

Typical evolutionary algorithms (EAs) exploit the different space-search properties of variation operators, such as crossover, mutation and local optimization. There are also various operators in each element. This paper provides an extensive empirical study on the synergy among multiple crossover operators. We choose a number of different crossover operators in an EA and investigate whether or not their combinations outperform the sole usage of the best crossover operator. The traveling salesman problem and the graph bisection problem were chosen for experimentation. Strong synergy effects were observed in both problems