2000 character limit reached
Optimal Recombination in Genetic Algorithms (1307.5519v1)
Published 21 Jul 2013 in cs.NE and cs.DS
Abstract: 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.