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 o...

Full description

Saved in:
Bibliographic Details
Published in:Evolutionary computation Vol. 16; no. 1; p. 127
Main Author: Eremeev, Anton V
Format: Journal Article
Language:English
Published: United States 01.03.2008
Subjects:
Algorithms
Artificial Intelligence
Biological Evolution
Linear Models
ISSN:1063-6560
Online Access:Get more information
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1063-6560
DOI:10.1162/evco.2008.16.1.127