Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH scholarly article en Eremeev, Anton License
when quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-5932

On Complexity of Optimized Crossover for Binary Representations



We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the class of Boolean linear programming problems, where the Boolean vector of variables is used as the solution representation. By means of efficient reductions of the optimized gene transmitting crossover problems (OGTC) we show the polynomial solvability of the OGTC for the maximum weight set packing problem, the minimum weight set partition problem and for one of the versions of the simple plant location problem. We study a connection between the OGTC for linear Boolean programming problem and the maximum weight independent set problem on 2-colorable hypergraph and prove the NP-hardness of several special cases of the OGTC problem in Boolean linear programming.

BibTeX - Entry

  author =	{Anton Eremeev},
  title =	{On Complexity of Optimized Crossover for Binary Representations},
  booktitle =	{Theory of Evolutionary Algorithms},
  year =	{2006},
  editor =	{Dirk V. Arnold and Thomas Jansen and Michael D. Vose and Jonathan E. Rowe},
  number =	{06061},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{},
  annote =	{Keywords: Genetic Algorithm, Optimized Crossover, Complexity}

Keywords: Genetic Algorithm, Optimized Crossover, Complexity
Seminar: 06061 - Theory of Evolutionary Algorithms
Issue date: 2006
Date of publication: 07.07.2006

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI