Generating Hard Test Instances with Known Optimal Solution for the Rectilinear Quadratic Assignment Problem

  • Authors:

  • G. Palubeckis

  • Affiliations:

  • Associate Professor, Department of Practical Informatics, Kaunas University of Technology, Studentu 50, 3031 Kaunas, Lithuania (e-mail: gintaras@soften.ktu.lt)

  • Venue:
  • Journal of Global Optimization
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we consider the rectilinear version of the quadratic assignment problem (QAP). We define a class of edge-weighted graphs with nonnegatively valued bisections. For one important type of such graphs we provide a characterization of point sets on the plane for which the optimal value of the related QAP is zero. These graphs are used in the algorithms for generating rectilinear QAP instances with known provably optimal solutions. The basic algorithm of such type uses only triangles. Making a reduction from 3-dimensional matching, it is shown that the set of instances which can be generated by this algorithm is hard. The basic algorithm is extended to process graphs larger than triangles. We give implementation details of this extension and of four other variations of the basic algorithm. We compare these five and also two existing generators experimentally employing multi-start descent heuristic for the QAP as an examiner. The graphs with nonnegatively valued bisections can also be used in the construction of lower bounds on the optimal value for the rectilinear QAP.