Local Search in Selected Crossover Operators

The purpose of the paper is to analyze an incorporation of local search mechanisms into five crossover operators (KPoint, AEX, HGreX, HProX and HRndX) used in genetic algorithms, compare the results depending on various parameters and draw the conclusions. The local search is used randomly with some probability instead of the standard crossover procedure in order to generate a new individual. We analyze injecting the local search in two situations: to resolve the conflicts and also without a conflict with a certain probability. The discussed mechanisms improve the obtained results and significantly accelerate the calculations. Moreover, we show that there exists an optimal degree of the local search component, and it depends on the particular crossover operator.