GRASP with path-relinking for the generalized quadratic assignment problem

Journal of Heuristics

Volumn 17, Issue 5, 2011, Pages 527-565

  Mateus, Geraldo R ^a   Resende, Mauricio G C ^b   Silva, Ricardo M A ^c,d  

^a FEDERAL UNIVERSITY OF MINAS GERAIS   (Brazil)

^b AT AND T LABS RESEARCH   (United States)

^c FEDERAL UNIVERSITY OF LAVRAS   (Brazil)

^d FEDERAL UNIVERSITY OF PERNAMBUCO   (Brazil)

Author keywords

Experimental algorithm; Generalized quadratic assignment problem; GRASP; Heuristic; Path relinking

Indexed keywords

LOCAL SEARCH (OPTIMIZATION);

EXPERIMENTAL ALGORITHMS; GRASP; HEURISTIC; PATH RELINKING; QUADRATIC ASSIGNMENT PROBLEMS;

COMBINATORIAL OPTIMIZATION;

EID: 80053575553     PISSN: 13811231     EISSN: 15729397     Source Type: Journal    
DOI: 10.1007/s10732-010-9144-0     Document Type: Article

References (36)

1. R.M. Aiex M.G.C. Resende C.C. Ribeiro 2002 Probability distribution of solution time in GRASP: An experimental investigation J. Heuristics 8 343 373 1012.68795 10.1023/A:1015061802659 (Pubitemid 34536965)
2. R.M. Aiex S. Binato M.G.C. Resende 2003 Parallel GRASP with path-relinking for job shop scheduling Parallel Comput. 29 393 430 1987222 10.1016/S0167-8191(03)00014-0
3. R.M. Aiex P.M. Pardalos M.G.C. Resende G. Toraldo 2005 GRASP with path-relinking for three-index assignment INFORMS J. Comput. 17 224 247 2142221 10.1287/ijoc.1030.0059 (Pubitemid 40891131)
4. R.M. Aiex M.G.C. Resende C.C. Ribeiro 2007 TTTPLOTS: A Perl program to create time-to-target plots Opt. Lett. 1 201 212 2340684 10.1007/s11590-006- 0021-6 (Pubitemid 47551876)
5. K. Anstreicher N. Brixius J.P. Goux J. Linderoth 2002 Solving large quadratic assignment problems on computational grids Math. Program. 91 563 588 1888992 1030.90105 10.1007/s101070100255 (Pubitemid 44773351)
6. F. Barahona R. Anbil 2000 The volume algorithm: producing primal solutions with a subgradient method Math. Program. 87 385 399 1757554 0961.90058 10.1007/s101070050002
7. Burkard, R.E.: Locations with spatial interactions: the quadratic assignment problem. In: Discrete Location Theory, pp. 89-98. Wiley, New York (1991)
8. J.-F. Cordeau M. Gaudioso G. Laporte L. Moccia 2006 A memetic heuristic for the generalized quadratic assignment problem INFORMS J. Comput. 18 433 443 2274710 10.1287/ijoc.1040.0128
9. Elloumi, S.: Contribution à la résolution des programmes non linéaires en variables 0-1, application aux problèmes de placement de tâches dans les systèmes distribués (thèse de doctorat in informatique). Technical report, Conservatoire National des Arts et Métiers, Paris (1991)
10. Elloumi, S., Roupin, F., Soutif, E.: Comparison of different lower bounds for the constrained module allocation problem. Technical Report 473, CNAM-Laboratoire Cédric, 292 Rue St Martin, 75141 Paris Cedex 03, France (2003)
11. H. Faria Jr. S. Binato M.G.C. Resende D.J. Falcão 2005 Transmission network design by a greedy randomized adaptive path relinking approach IEEE Trans. Power Syst. 20 1 43 49 10.1109/TPWRS.2004.835627 (Pubitemid 40259418)
12. T.A. Feo M.G.C. Resende 1989 A probabilistic heuristic for a computationally difficult set covering problem Oper. Res. Lett. 8 67 71 995962 0675.90073 10.1016/0167-6377(89)90002-3
13. T.A. Feo M.G.C. Resende 1995 Greedy randomized adaptive search procedures J. Global Optim. 6 109 133 1322875 0822.90110 10.1007/BF01096763
14. Festa, P., Resende, M.G.C.: GRASP: An annotated bibliography. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and Surveys on Metaheuristics, pp. 325-367. Kluwer Academic, Norwell (2002)
15. P. Festa M.G.C. Resende 2009 An annotated bibliography of GRASP-Part I: Algorithms Int. Trans. Oper. Res. 16 1 24 2478305 1153.90553 10.1111/j.1475-3995.2009.00663.x
16. P. Festa M.G.C. Resende 2009 An annotated bibliography of GRASP-Part II: Applications Int. Trans. Oper. Res. 16 131 172 2503007 1168.90582 10.1111/j.1475-3995.2009.00664.x
17. A. Frieze J. Yadegar 1983 On the quadratic assignment problem Discrete Appl. Math. 5 89 98 678819 0502.90062 10.1016/0166-218X(83)90018-5
18. Glover, F.: Tabu search and adaptive memory programing-Advances, applications and challenges. In: Barr, R.S., Helgason, R.V., Kennington, J.L. (eds.) Interfaces in Computer Science and Operations Research, pp. 1-75. Kluwer Academic, Norwell (1996)
19. F. Glover M. Laguna R. Martí 2000 Fundamentals of scatter search and path relinking Control Cybern. 39 653 684
20. P.M. Hahn B.-J. Kim M. Guignard J. MacGregor Smith Y.-R. Zhu 2008 An algorithm for the generalized quadratic assignment problem Comput. Optim. Appl. 401 351 372 10.1007/s10589-007-9093-1
21. L. Kaufman F. Broeckx 1978 An algorithm for the quadratic assignment problem using benders decomposition Eur. J. Oper. Res. 2 204 211 10.1016/0377-2217(78)90095-4 (Pubitemid 8619225)
22. M. Laguna R. Martí 1999 GRASP and path relinking for 2-layer straight line crossing minimization INFORMS J. Comput. 11 44 52 1092.90544 10.1287/ijoc.11.1.44
23. Lee, C.-G., Ma, Z.: The generalized quadratic assignment problem. Technical Report MIEOR TR2005-01, Department of Mechanical and Industrial Engineering at the University of Toronto (2005)
24. Li, Y., Pardalos, P.M., Resende, M.G.C.: A greedy randomized adaptive search procedure for the quadratic assignment problem. In: Pardalos, P.M., Wolkowicz, H. (eds.) Quadratic Assignment and Related Problems. DIMACS Series in Discrete Matehematics and Theoretical Computer Science, vol. 16, pp. 237-261. American Mathematical Society, Providence (1994)
25. M. Matsumoto T. Nishimura 1998 Mersenne twister: A 623-dimensionally equidistributed uniform pseudo-random number generator ACM Trans. Model. Comput. Simul. 8 3 30 0917.65005 10.1145/272991.272995
26. Oliveira, C.A.S., Pardalos, P.M., Resende, M.G.C.: GRASP with path-relinking for the quadratic assignment problem. In: Ribeiro, C.C., Martins, S.L. (eds.) Efficient and Experimental Algorithms. Lecture Notes in Computer Science, vol. 3059, pp. 356-368. Springer-Verlag, Berlin (2004)
27. Padberg, M., Rijal, M.: Location, Scheduling, Design and Integer Programming. Kluwer Academic, Norwell (1996)
28. Pardalos, P.M., Rendl, F., Wolkowicz, H.: The quadratic assignment problem: A survey and recent development. In: Pardalos, P.M., Wolkowicz, H. (eds.) The Quadratic Assignment and Related Problems. DIMACS Series in Discrete Matehematics and Theoretical Computer Science, vol. 16, pp. 1-42. American Mathematical Society, Providence (1994)
29. Pessoa, A.A., Hahn, P.M., Guignard, M., Zhu, Y.-R.: An improved algorithm for the generalized quadratic assignment problem. Technical Report MIEOR TR2005-01, Electrical and Systems Engineering at the University of Pennsylvania (2008)
30. Resende, M.G.C., Ribeiro, C.C.: Greedy randomized adaptive search procedures. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 219-249. Kluwer Academic, Norwell (2002)
31. M.G.C. Resende C.C. Ribeiro 2003 A GRASP with path-relinking for private virtual circuit routing Networks 41 1 104 114 1959090 1028.90502 10.1002/net.10065
32. Resende, M.G.C., Ribeiro, C.C.: GRASP with path-relinking: Recent advances and applications. In: Ibaraki, T., Nonobe, K., Yagiura, M. (eds.) Metaheuristics: Progress as Real Problem Solvers, pp. 29-63. Springer-Verlag, Berlin (2005)
33. Resende, M.G.C., Ribeiro, C.C.: Greedy randomized adaptive search procedures: Advances and applications. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics, 2nd edn. Springer Science+Business Media, Berlin (2010)
34. Ribeiro, C.C., Rosseti, I.: A parallel GRASP for the 2-path network design problem. In: Lecture Notes in Computer Science, vol. 2004, pp. 922-926. Springer-Verlag, Berlin (2002)
35. C.C. Ribeiro E. Uchoa R.F. Werneck 2002 A hybrid GRASP with perturbations for the Steiner problem in graphs INFORMS J. Comput. 14 228 246 1918924 10.1287/ijoc.14.3.228.116
36. F. Roupin 2004 From linear to semidefinite programming: An algorithm to obtain semidefinite relaxations for bivalent quadratic problems J. Combin. Optim. 8 469 493 2112917 1079.90085 10.1007/s10878-004-4838-6 (Pubitemid 40356729)