Optimal Recombination in Genetic Algorithms
Neural and Evolutionary Computing
2013-07-23 v1 Data Structures and Algorithms
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.
Cite
@article{arxiv.1307.5519,
title = {Optimal Recombination in Genetic Algorithms},
author = {Anton V. Eremeev and Julia V. Kovalenko},
journal= {arXiv preprint arXiv:1307.5519},
year = {2013}
}