Analysis and performance measurement of existing solution methods of quadratic assignment problem

Quadratic Assignment Problem (QAP) is known as one of the most difficult combinatorial optimization problems that is classified in the category of NP-hard problems. Quadratic Assignment Problem Library (QAPLIB) is a full database of QAPs which contains several problems from different authors and different sizes. Many exact and meta-heuristic solution methods have been introduced to solve QAP. In this study we focus on previously introduced solution methods of QAP e.g. Branch and Bound (B&B), Simulated Annealing (SA) Algorithm, Greedy Randomized Adaptive Search Procedure (GRASP) for dense and sparse QAPs. The codes of FORTRAN for these methods were downloaded from QAPLIB. All problems of QAPLIB were solved by the abovementioned methods. Several results were obtained from the computational experiments part. The Results show that the Branch and Bound method is able to introduce a feasible solution for all problems while Simulated Annealing Algorithm and GRASP methods are not able to find any solution for some problems. On the other hand, Simulated Annealing and GRASP methods have shorter run time comparing to the Branch and Bound method. In addition, the performance of the methods on the objective function value is discussed.

[1]  L. Hubert,et al.  Quadratic assignment as a general data analysis strategy. , 1976 .

[2]  Karen A. F. Copeland.  Design and Analysis of Experiments, 5th Ed. , 2001 .

[3]  E. Lawler.  The Quadratic Assignment Problem , 1963 .

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

[5]  Giovanni Rinaldi,et al.  A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems , 1991, SIAM Rev..

[6]  J. W. Gavett,et al.  The Optimal Assignment of Facilities to Locations by Branch and Bound , 1966, Oper. Res..

[7]  Michael Jünger,et al.  On the SQAP-Polytope , 2000, SIAM J. Optim..

[8]  Ting Rui,et al.  Simulated annealing ant colony algorithm for QAP , 2012, ICNC.

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

[10]  T. Peng,et al.  Simulated annealing for the quadratic assignment problem: A further study , 1996 .

[11]  Panos M. Pardalos,et al.  A parallel algorithm for the quadratic assignment problem , 1989, Proceedings of the 1989 ACM/IEEE Conference on Supercomputing (Supercomputing '89).

[12]  Franz Rendl,et al.  Lower bounds for the quadratic assignment problem via triangle decompositions , 1995, Math. Program..

[13]  Zvi Drezner,et al.  Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming , 1995, Oper. Res..

[14]  Teodor Gabriel Crainic,et al.  PARALLEL BRANCH-AND-BOUND ALGORITHMS: SURVEY AND SYNTHESIS , 1993 .

[15]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[16]  Franz Rendl,et al.  Semidefinite Programming Relaxations for the Quadratic Assignment Problem , 1998, J. Comb. Optim..

[17]  Panos M. Pardalos,et al.  GRASP with Path-Relinking for the Quadratic Assignment Problem , 2004, WEA.

[18]  Volker Nissen,et al.  A modification of threshold accepting and its application to the quadratic assignment problem , 1995 .

[19]  Thomas Zeitlhofer,et al.  On the Phase Coupling Problem Between Data Memory Layout Generation and Address Pointer Assignment , 2004, SCOPES.

[20]  Z. Drezner,et al.  A distance-based selection of parents in genetic algorithms , 2004 .

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

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

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

[24]  Michael Jünger,et al.  The QAP-polytope and the star transformation , 2001, Discret. Appl. Math..

[25]  Esther M. Arkin,et al.  Approximating the maximum quadratic assignment problem , 2000, SODA '00.

[26]  John W. Dickey,et al.  Campus building arrangement using topaz , 1972 .

[27]  Gerhard J. Woeginger,et al.  A study of exponential neighborhoods for the Travelling Salesman Problem and for the Quadratic Assignment Problem , 2000, Math. Program..

[28]  Nicos Christofides,et al.  An Exact Algorithm for the Quadratic Assignment Problem on a Tree , 1989, Oper. Res..

[29]  Catherine Roucairol,et al.  A parallel branch and bound algorithm for the quadratic assignment problem , 1987, Discret. Appl. Math..

[30]  R. Burkard,et al.  A heuristic for quadratic Boolean programs with applications to quadratic assignment problems , 1983 .

[31]  Bernard Gendron,et al.  Parallel Branch-and-Branch Algorithms: Survey and Synthesis , 1994, Oper. Res..

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

[33]  Qian Zhao,et al.  Analyzing Lanthanide-Induced Shifts in the NMR Spectra of Lanthanide(III) Complexes Derived from 1,4,7,10-Tetrakis(N,N-diethylacetamido)-1,4,7,10-tetraazacyclododecane , 1995 .

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

[35]  S. Elloumi,et al.  Un Algorithme De Génération De Coupes Pour Le Problème De L’Affectation Quadratique , 2003 .

[36]  Geraldo Robson Mateus,et al.  A performance guarantee heuristic for electronic components placement problems including thermal effects , 2005, Comput. Oper. Res..

[37]  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).

[38]  Adl Baykasoğlu.  A meta-heuristic algorithm to solve quadratic assignment formulations of cell formation problems without presetting number of cells , 2004, J. Intell. Manuf..

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

[40]  A. H. Land,et al.  A Problem of Assignment with Inter-Related Costs , 1963 .

[41]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[42]  F. Glover.  HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS , 1977 .

[43]  Rong Long Wang,et al.  Solving Facility Layout Problem Using an Improved Genetic Algorithm , 2005, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

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

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

[46]  S. P. Singh,et al.  Two-level modified simulated annealing based approach for solving facility layout problem , 2008 .

[47]  Jaime Simão Sichman,et al.  Using A-Teams to optimize automatic insertion of electronic components , 2003, Adv. Eng. Informatics.

[48]  Franz Rendl,et al.  A New Lower Bound Via Projection for the Quadratic Assignment Problem , 1992, Math. Oper. Res..

[49]  Alfonsas Misevicius,et al.  A Tabu Search Algorithm for the Quadratic Assignment Problem , 2005, Comput. Optim. Appl..

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

[51]  Ashish Tiwari,et al.  A greedy genetic algorithm for the quadratic assignment problem , 2000, Comput. Oper. Res..

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

[53]  Gregory Gutin,et al.  Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number , 2002, Discret. Appl. Math..