An Algorithm for Construction of Test Cases for the Quadratic Assignment Problem

In this paper we present an algorithm for generating quadratic assignment problem (QAP) instances with known provably optimal solution. The flow matrix of such instances is constructed from the matrices corresponding to special graphs whose size may reach the dimension of the problem. In this respect, the algorithm generalizes some existing algorithms based on the iterative selection of triangles only. The set of instances which can be produced by the algorithm is NP-hard. Using multi-start descent heuristic for the QAP, we compare experimentally such test cases against those created by several existing generators and against Nugent-type problems from the QAPLIB as well. Key words: combinatorial optimization, quadratic assignment problem, test cases.

• Type: Journal
• Year: 2000
• Where: INFORMATICALT
• Authors: Gintaras Palubeckis
• Keywords: Algorithm, INFORMATICALT 2000, Quadratic Assignment Problem, Test Cases