On complexity of optimal recombination for binary representations of solutions.
We consider the optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The optimal recombination is studied in the case where a vector of binary variables is used as a solution encoding. By means of efficient reductions of the optimal recombination problems (ORPs) we show the polynomial solvability of the ORPs for the maximum weight set packing problem, the minimum weight set partition problem, and for linear Boolean programming problems with at most two variables per inequality, and some other problems. We also identify several NP-hard cases of optimal recombination: the Boolean linear programming problems with three variables per inequality, the knapsack, the set covering, the p-median, and some other problems.
Eremeev
Anton V
AV
Laboratory of Discrete Optimization, Omsk Branch of Sobolev Institute of Mathematics 13 Pevtsov Street, Omsk, 644099, Russia. eremeev@ofim.oscsbras.ru
D000465:Algorithms; D001185:Artificial Intelligence; D005075:Biological Evolution; D016014:Linear Models