Combinatorial optimization for weighing matrices with the ordering messy genetic algorithm

  • Authors:

  • Christos Koukouvinos;Dimitris E. Simos

  • Affiliations:

  • Department of Mathematics, National Technical University of Athens, Athens, Greece;Department of Mathematics, National Technical University of Athens, Athens, Greece

  • Venue:
  • SEA'11 Proceedings of the 10th international conference on Experimental algorithms
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we demonstrate that the search for weighing matrices constructed from two circulants can be viewed as a permutation problem. To solve it a set of two competent genetic algorithms (CGAs) are used to locate common integers in two sorted arrays. The motivation to deal with the messy genetic algorithm (mGA) is given from the pioneering results of Goldberg, regarding the ability of the mGA to put tight genes together in a solution which points directly to structural patterns in weighing matrices. In order to take into advantage a recent formalism on the support of two sequences with zero autocorrelation we use an adaptation of the ordering messy GA (OmeGA) where we combine the fast mGA with random keys to represent permutations of the two sequences under investigation. This transformation of the weighing matrices problem to an instance of a combinatorial optimization problem seems to be promising since we illustrate that our framework is capable to solve open cases for weighing matrices as these are listed in the second edition of the Handbook of Combinatorial Designs.