Optimal Recombination in Genetic Algorithms for Combinatorial Optimiyation Problems Part II

Anton V. Eremeev, Julia V. Kovalenko

Abstract: This paper surveys results on complexity of the optimal recombination problem (ORP), which consists in nding the best possible o spring as a result of a recombination operator in a genetic algorithm, given two parent solutions. In Part II, we consider the computational complexity of ORPs arising in genetic algorithms for problems on permutations: the Travelling Salesman Problem, the Short- est Hamilton Path Problem and the Makespan Minimization on Single Machine and some other related problems. The analysis indicates that the corresponding ORPs are NP-hard, but solvable by faster algorithms, compared to the problems they are derived from.