GRASP with path-relinking for the generalized quadratic assignment problem

The generalized quadratic assignment problem (GQAP) is a generalization of the NP-hard quadratic assignment problem (QAP) that allows multiple facilities to be assigned to a single location as long as the capacity of the location allows. The GQAP has numerous applications, including facility design, scheduling, and network design. In this paper, we propose several GRASP with path-relinking heuristics for the GQAP using different construction, local search, and path-relinking procedures. We introduce a novel approximate local search scheme, as well as a new variant of path-relinking that deals with infeasibilities. Extensive experiments on a large set of test instances show that the best of the proposed variants is both effective and efficient.

[1]  Toshihide Ibaraki,et al.  Metaheuristics : progress as real problem solvers , 2005 .

[2]  Mauricio G. C. Resende,et al.  Grasp: An Annotated Bibliography , 2002 .

[3]  Fred S. Roberts,et al.  DIMACS Series in Discrete Mathematics and Theoretical Computer Science , 2001 .

[4]  M. Resende,et al.  Greedy Randomized Adaptive Search Procedures. , 2003 .

[5]  Panos M. Pardalos,et al.  Global optimization by continuous grasp , 2007, Optim. Lett..

[6]  Celso C. Ribeiro,et al.  A Parallel GRASP Heuristic for the 2-Path Network Design Problem (Research Note) , 2002, Euro-Par.

[7]  Celso C. Ribeiro,et al.  Greedy Randomized Adaptive Search Procedures , 2003, Handbook of Metaheuristics.

[8]  F. Glover,et al.  Fundamentals of Scatter Search and Path Relinking , 2000 .

[9]  Celso C. Ribeiro,et al.  TTT plots: a perl program to create time-to-target plots , 2007, Optim. Lett..

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

[11]  Frédéric Roupin,et al.  COMPARISON OF DIFFERENT LOWER BOUNDS FOR THE CONSTRAINED MODULE ALLOCATION PROBLEM , .

[12]  F. Glover,et al.  Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.

[13]  Manfred Padberg,et al.  Location, Scheduling, Design and Integer Programming , 2011, J. Oper. Res. Soc..

[14]  Frédéric Roupin,et al.  From Linear to Semidefinite Programming: An Algorithm to Obtain Semidefinite Relaxations for Bivalent Quadratic Problems , 2004, J. Comb. Optim..

[15]  Chi-Guhn Lee,et al.  The Generalized Quadratic Assignment Problem , 2003 .

[16]  Panos M. Pardalos,et al.  GRASP with Path Relinking for Three-Index Assignment , 2005, INFORMS J. Comput..

[17]  Takuji Nishimura,et al.  Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator , 1998, TOMC.

[18]  Gilbert Laporte,et al.  A Memetic Heuristic for the Generalized Quadratic Assignment Problem , 2006, INFORMS J. Comput..

[19]  Jeffery L. Kennington,et al.  Interfaces in Computer Science and Operations Research , 1997 .

[20]  Jeff T. Linderoth,et al.  Solving large quadratic assignment problems on computational grids , 2002, Math. Program..

[21]  Mauricio G. C. Resende,et al.  POWER TRANSMISSION NETWORK DESIGN BY A GREEDY RANDOMIZED ADAPTIVE PATH RELINKING APPROACH , 2022 .

[22]  Panos M. Pardalos,et al.  Quadratic Assignment and Related Problems , 1994 .

[23]  Bhaba R. Sarker,et al.  Discrete location theory , 1991 .

[24]  A. Pessoa,et al.  An Improved Algorithm for the Generalized Quadratic Assignment Problem , 2008 .

[25]  Celso C. Ribeiro,et al.  GRASP with Path-Relinking: Recent Advances and Applications , 2005 .

[26]  S. Binato,et al.  Power transmission network design by greedy randomized adaptive path relinking , 2005, IEEE Transactions on Power Systems.

[27]  Fred Glover,et al.  Tabu Search and Adaptive Memory Programming — Advances, Applications and Challenges , 1997 .

[28]  Celso C. Ribeiro,et al.  A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs , 2002, INFORMS J. Comput..

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

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

[31]  M. Resende,et al.  A probabilistic heuristic for a computationally difficult set covering problem , 1989 .

[32]  Mauricio G. C. Resende,et al.  An Annotated Bibliography of Grasp Part I: Algorithms , 2022 .

[33]  Celso C. Ribeiro,et al.  A GRASP with path‐relinking for private virtual circuit routing , 2003, Networks.

[34]  Monique Guignard-Spielberg,et al.  An algorithm for the generalized quadratic assignment problem , 2008, Comput. Optim. Appl..

[35]  Rafael Martí,et al.  GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization , 1999, INFORMS J. Comput..

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

[37]  Mauricio G. C. Resende,et al.  An Annotated Bibliography of Grasp Part Ii: Applications , 2022 .

[38]  Francisco Barahona,et al.  The volume algorithm: producing primal solutions with a subgradient method , 2000, Math. Program..

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

[40]  Celso C. Ribeiro,et al.  Probability Distribution of Solution Time in GRASP: An Experimental Investigation , 2002, J. Heuristics.

[41]  Renata M. Aiex,et al.  Parallel GRASP with path-relinking for job shop scheduling , 2003, Parallel Comput..

[42]  Alan M. Frieze,et al.  On the quadratic assignment problem , 1983, Discret. Appl. Math..