Answers are grounded in this paper and cite their sources.
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. Part I presents the basic principles of optimal recombination with a survey of results on Boolean Linear Programming Problems. Part II (to appear in a subsequent issue) is devoted to the ORPs for problems which are naturally formulated in terms of search for an optimal permutation.
No takes yet. Share an insight, caveat, or question.
Eremeev et al. (2013) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: