Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers

The Quadratic Assignment Problem (QAP) can be solved by linearization, where one formulates the QAP as a mixed integer linear programming (MILP) problem. On the one hand, most of these linearizations are tight, but rarely exploited within a reasonable computing time because of their size. On the other hand, Kaufman and Broeckx formulation (Eur. J. Oper. Res. 2(3):204–211, 1978) is the smallest of these linearizations, but very weak. In this paper, we analyze how the Kaufman and Broeckx formulation can be tightened to obtain better QAP-MILP formulations. As shown in our numerical experiments, these tightened formulations remain small but computationally effective to solve the QAP by means of general purpose MILP solvers.

[1]  Eranda Çela,et al.  The quadratic assignment problem : theory and algorithms , 1999 .

[2]  Abdel Nasser,et al.  A Survey of the Quadratic Assignment Problem , 2014 .

[3]  Mauro Dell'Amico,et al.  7. Quadratic Assignment Problems: Formulations and Bounds , 2009 .

[4]  Monique Guignard-Spielberg,et al.  A level-2 reformulation-linearization technique bound for the quadratic assignment problem , 2007, Eur. J. Oper. Res..

[5]  Yong Xia,et al.  Gilmore-Lawler bound of quadratic assignment problem , 2008 .

[6]  Peter Hahn,et al.  Lower Bounds for the Quadratic Assignment Problem Based upon a Dual Formulation , 1998, Oper. Res..

[7]  Michael J. Brusco,et al.  Using Quadratic Assignment Methods to Generate Initial Permutations for Least-Squares Unidimensional Scaling of Symmetric Proximity Matrices , 2000, J. Classif..

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

[9]  Yong Xia.  Improved Gilmore-Lawler Bound for Quadratic Assignment Problems , 2007 .

[10]  Zvi Drezner,et al.  Recent Advances for the Quadratic Assignment Problem with Special Emphasis on Instances that are Difficult for Meta-Heuristic Methods , 2005, Ann. Oper. Res..

[11]  George G. Polak.  On A Special Case of the Quadratic Assignment Problem with an Application to Storage-and-Retrieval Devices , 2005, Ann. Oper. Res..

[12]  Clayton W. Commander,et al.  A Survey of the Quadratic Assignment Problem, with Applications , 2003 .

[13]  Teofilo F. Gonzalez,et al.  P-Complete Approximation Problems , 1976, J. ACM.

[14]  Panos M. Pardalos,et al.  Quadratic Assignment Problem , 1997, Encyclopedia of Optimization.

[15]  Ya-Xiang Yuan,et al.  A new linearization method for quadratic assignment problems , 2006, Optim. Methods Softw..

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

[17]  P. Gilmore.  Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem , 1962 .

[18]  Xia Yong.  Gilmore-Lawler bound of quadratic assignment problem , 2008 .

[19]  Jiming Peng,et al.  A new relaxation framework for quadratic assignment problems based on matrix splitting , 2010, Math. Program. Comput..

[20]  Cesar Beltran-Royo,et al.  Effective formulation reductions for the quadratic assignment problem , 2010, Comput. Oper. Res..

[21]  Matteo Fischetti,et al.  Three Ideas for the Quadratic Assignment Problem , 2012, Oper. Res..

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

[23]  Warren P. Adams,et al.  Improved Linear Programming-based Lower Bounds for the Quadratic Assignment Proglem , 1993, Quadratic Assignment and Related Problems.

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

[25]  Edward P. K. Tsang,et al.  Applying an Extended Guided Local Search to the Quadratic Assignment Problem , 2003, Ann. Oper. Res..

[26]  T. Koopmans,et al.  Assignment Problems and the Location of Economic Activities , 1957 .

[27]  Kurt M. Anstreicher,et al.  Recent advances in the solution of quadratic assignment problems , 2003, Math. Program..

[28]  Andrew Whinston,et al.  An Algorithm for the Quadratic Assignment Problem , 1970 .

[29]  L. Kaufman,et al.  An algorithm for the quadratic assignment problem using Bender's decomposition , 1978 .

[30]  Leon Steinberg,et al.  The Backboard Wiring Problem: A Placement Algorithm , 1961 .

[31]  Hans-Joachim Wunderlich,et al.  Optimized synthesis of self-testable finite state machines , 1990, [1990] Digest of Papers. Fault-Tolerant Computing: 20th International Symposium.

[32]  Eranda C Ela,et al.  Assignment Problems , 1964, Comput. J..