Optimal Recombination in Genetic Algorithms

07/21/2013

∙

by   Anton V. Eremeev, et al.

∙

0

∙

share

This paper surveys results on complexity of the optimal recombination problem (ORP), which consists in finding the best possible offspring as a result of a recombination operator in a genetic algorithm, given two parent solutions. We consider efficient reductions of the ORPs, allowing to establish polynomial solvability or NP-hardness of the ORPs, as well as direct proofs of hardness results.