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.

[1]  Franz Rendl,et al.  QAPLIB – A Quadratic Assignment Problem Library , 1997, J. Glob. Optim..

[2]  Gintaras Palubeckis,et al.  Generating Hard Test Instances with Known Optimal Solution for the Rectilinear Quadratic Assignment Problem , 1999, J. Glob. Optim..

[3]  A. N. Elshafei,et al.  Hospital Layout as a Quadratic Assignment Problem , 1977 .

[4]  Jadranka Skorin-Kapov,et al.  Tabu Search Applied to the Quadratic Assignment Problem , 1990, INFORMS J. Comput..

[5]  Gintaras Palubeckis,et al.  The use of special graphs for obtaining lower bounds in the geometric quadratic assignment problem , 1997 .

[6]  V. Deineko,et al.  The Quadratic Assignment Problem: Theory and Algorithms , 1998 .

[7]  Panos M. Pardalos,et al.  A Greedy Randomized Adaptive Search Procedure for the Quadratic Assignment Problem , 1993, Quadratic Assignment and Related Problems.

[8]  Thomas E. Vollmann,et al.  An Experimental Comparison of Techniques for the Assignment of Facilities to Locations , 1968, Oper. Res..

[9]  Gilbert Laporte,et al.  Balancing hydraulic turbine runners: A quadratic assignment problem , 1988 .

[10]  Robert H. Berk.  Assignment Methods in Combinatorial Data Analysis , 1989 .

[11]  T. L. Ward,et al.  Solving Quadratic Assignment Problems by ‘Simulated Annealing’ , 1987 .

[12]  Panos M. Pardalos,et al.  Generating quadratic assignment test problems with known optimal permutations , 1992, Comput. Optim. Appl..

[13]  David Connolly.  An improved annealing scheme for the QAP , 1990 .

[14]  Jakob Krarup,et al.  Computer-aided layout design , 1978 .

[15]  Laura A. Sanchis,et al.  On the Complexity of Test Case Generation for NP-Hard Problems , 1990, Inf. Process. Lett..

[16]  É. Taillard.  COMPARISON OF ITERATIVE SEARCHES FOR THE QUADRATIC ASSIGNMENT PROBLEM. , 1995 .

[17]  Corso Elvezia.  Ant Colonies for the QAP , 1997 .

[18]  Jens Clausen,et al.  Solving Large Quadratic Assignment Problems in Parallel , 1997, Comput. Optim. Appl..

[19]  Franz Rendl,et al.  On the Applicability of Lower Bounds for Solving Rectilinear Quadratic Assignment Problems in Parallel , 1998, Comput. Optim. Appl..

[20]  F. Rendl,et al.  A thermodynamically motivated simulation procedure for combinatorial optimization problems , 1984 .

[21]  Éric D. Taillard,et al.  Robust taboo search for the quadratic assignment problem , 1991, Parallel Comput..

[22]  R. F. Vaz,et al.  Quadratic assignment problems generated with the Palubetskis algorithm are degenerate , 1994 .

[23]  Panos M. Pardalos,et al.  Algorithm : FORTRAN Subroutines for Approximate Solution of Dense Quadratic Assignment Problems using GRASP , 2008 .

[24]  Panos M. Pardalos,et al.  Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP , 1996, TOMS.

[25]  Panos M. Pardalos,et al.  The Quadratic Assignment Problem: A Survey and Recent Developments , 1993, Quadratic Assignment and Related Problems.

[26]  Roberto Battiti,et al.  The Reactive Tabu Search , 1994, INFORMS J. Comput..

[27]  G. S. Palubetski.  A generator of test quadratic assignment problems with known optimal solution , 1990 .

[28]  Catherine Roucairol,et al.  A New Exact Algorithm for the Solution of Quadratic Assignment Problems , 1994, Discret. Appl. Math..

[29]  Arthur M. Geoffrion,et al.  Scheduling Parallel Production Lines with Changeover Costs: Practical Application of a Quadratic Assignment/LP Approach , 1976, Oper. Res..

[30]  R. Burkard.  Quadratic Assignment Problems , 1984 .

[31]  Alice E. Smith,et al.  A genetic approach to the quadratic assignment problem , 1995, Comput. Oper. Res..

[32]  V. Cung,et al.  A scatter search based approach for the quadratic assignment problem , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[33]  Charles Fleurent,et al.  Genetic Hybrids for the Quadratic Assignment Problem , 1993, Quadratic Assignment and Related Problems.

[34]  Panos M. Pardalos,et al.  A local search algorithm for the quadratic assignment problem , 1992 .