Multistart tabu search and diversification strategies for the quadratic assignment problem

IEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans

Volumn 39, Issue 3, 2009, Pages 579-596

  James, Tabitha ^a   Rego, César ^b   Glover, Fred ^c,d  

^a PAMPLIN COLLEGE OF BUSINESS   (United States)

^b UNIVERSITY OF MISSISSIPPI   (United States)

^c UNIVERSITY OF COLORADO   (United States)

^d OptTek Systems Inc   (United States)

Author keywords

Combinatorial optimization; Quadratic assignment problem (QAP); Tabu search (TS)

Indexed keywords

BENCHMARK TEST PROBLEM; COMBINATORIAL OPTIMIZATION PROBLEMS; COMPUTATIONAL RESULTS; DIVERSIFICATION STRATEGIES; FACILITY LOCATION PROBLEM; HYBRID APPROACH; METAHEURISTIC; MULTISTART; MULTISTART TABU SEARCHES; QUADRATIC ASSIGNMENT PROBLEM (QAP); QUADRATIC ASSIGNMENT PROBLEMS; SOLUTION APPROACH; STRATEGIC DIVERSIFICATION;

COMBINATORIAL OPTIMIZATION; FACILITIES; TRAVELING SALESMAN PROBLEM;

TABU SEARCH;

EID: 65649114426     PISSN: 10834427     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCA.2009.2014556     Document Type: Article

References (87)

1. S. Ahmadi and I. H. Osman, "Greedy random adaptive memory programming for the capacitated clustering problem," Eur. J. Oper. Res., vol. 162, no. 1, pp. 30-44, Apr. 2005.
2. R. K. Ahuja, K. C. Jha, J. B. Orlin, and D. Sharma, "Very large-scale neighborhood search for the quadratic assignment problem," INFORMS J. Comput., vol. 19, no. 4, pp. 646-657, 2007.
3. R. K. Ahuja, J. B. Orlin, and A. Tiwari, "A descent genetic algorithm for the quadratic assignment problem," Comput. Oper. Res., vol. 27, no. 10, pp. 917-934, Sep. 2000.
4. K. Anstreicher, "Recent advances in the solution of quadratic assignment problems," Math. Program., vol. 97, no. 1/2, pp. 27-42, Jul. 2003.
5. K. Anstreicher and N. W. Brixius, "Solving quadratic assignment problems using convex quadratic programming relaxations," Optim. Methods Softw., vol. 16, no. 1-4, pp. 49-68, 2001.
6. K. Anstreicher, N. W. Brixius, J.-P. Goux, and J. Linderoth, "Solving large quadratic assignment problems on computational grids," Math. Program., vol. 91, no. 3, pp. 563-588, Feb. 2002.
7. A. A. Assad and W. Xu, "On lower bounds for a class of quadratic 0, 1 programs," Oper. Res. Lett., vol. 4, no. 4, pp. 175-180, Dec. 1985.
8. R. Battiti and G. Tecchiolli, "The reactive tabu search," ORSA J. Comput., vol. 6, no. 2, pp. 126-140, 1994.
9. R. P. Beausoleil, G. Baldoquin, and R. A. Montejo, "Multi-start and path relinking methods to deal with multiobjective knapsack problems," Ann. Oper. Res., vol. 157, no. 1, pp. 105-133, Jan. 2008.
10. R. S. Bhaba, E. W. Wilbert, and L. H. Gary, "Locating sets of identical machines in a linear layout," Ann. Oper. Res., vol. 77, pp. 183-207, Jan. 1998.
11. K. D. Boese, A. B. Kahng, and S. Muddu, "New adaptive multistart techniques for combinatorial global optimizations," Oper. Res. Lett. vol. 16, no. 2, pp. 101-113, Sep. 1994.
12. C. Bousono-Calzon and M. R. W. Manning, "The hopfield neural network applied to the quadratic assignment problem," Neural Comput. Appl. vol. 3, no. 2, pp. 64-72, Jun. 1995.
13. R. E. Burkard and F. Rendl, "A thermodynamically motivated simulation procedure for combinatorial optimization problems," Eur. J. Oper. Res., vol. 17, no. 2, pp. 169-174, Aug. 1984.
14. P. Carraresi and F. Malucelli, "A new lower bound for the quadratic assignment problem," Oper. Res., vol. 40, no. 1, pp. 22-27, Jan./Feb. 1992.
15. E. Cela, The Quadratic Assignment Problem: Theory and Algorithms. Boston, MA: Kluwer, 1998.
16. J. Clausen and M. Perregaard, "Solving large quadratic assignment problems in parallel," Comput. Optim. Appl., vol. 8, no. 2, pp. 111-127, Sep. 1997.
17. B. Codenotti, G. Manzini, L. Margara, and G. Resta, "Perturbation: An efficient technique for the solution of very large instances of the Euclidean TSP," INFORMS J. Comput., vol. 8, no. 2, pp. 125-133, 1996.
18. J. P. Cohoon and W. D. Paris, "Genetic placement," IEEE Trans. Comput. - Aided Design Integr. Circuits Syst., vol. CAD-6, no. 6, pp. 956-964, Nov. 1987.
19. D. T. Connolly, "An improved annealing scheme for the QAP," Eur. J. Oper. Res., vol. 46, no. 1, pp. 93-100, May 1990.
20. S. P. Coy, B. L. Golden, G. C. Runger, and E. A. Wasil, "See the forest before the trees: Fine-tuned learning and its application to the traveling salesman problem," IEEE Trans. Syst., Man, Cybern. A, Syst., Humans, vol. 28, no. 4, pp. 454-464, Jul. 1998.
21. V.-D. Cung, T. Mautor, P. Michelon, and A. Tavares, "Scatter search for the quadratic assignment problem," in Proc. IEEE Int. Conf. Evol. Comput., 1996, pp. 165-169.
22. M. Dorigo, V. Maniezzo, and A. Colorni, "Ant system: Optimization by a colony of cooperating agents," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 26, no. 1, pp. 29-41, Feb. 1996.
23. Z. Drezner, "A new genetic algorithm for the quadratic assignment problem," INFORMS J. Comput., vol. 15, no. 3, pp. 320-330, Jul. 2003.
24. Z. Drezner, "The extended concentric tabu for the quadratic assignment problem," Eur. J. Oper. Res., vol. 160, no. 2, pp. 416-422, Jan. 2005.
25. J. A. Ferland, S. Ichoua, A. Lavoie, and E. Gagné, "Scheduling using tabu search methods with intensification and diversification," Comput. Oper. Res., vol. 28, no. 11, pp. 1075-1092, Sep. 2001.
26. C. Fleurent and J. A. Ferland, "Genetic hybrids for the quadratic assignment problem," in Quadratic Assignment and Related Problems ser. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 16, P. Pardalos and H. Wolkowicz, Eds. Baltimore, MD: Amer. Math. Soc., 1994, pp. 173-187.
27. C. Fleurent and F. Glover, "Improved constructive multi-start strategies for the quadratic assignment problem using adaptive memory," INFORMS J. Comput., vol. 11, no. 2, pp. 198-204, Feb. 1999.
28. L. M. Gambardella, E. D. Taillard, and M. Dorigo, "Ant colonies for the quadratic assignment problem," J. Oper. Res. Soc., vol. 50, no. 2, pp. 167-176, Feb. 1999.
29. D. Gamboa, C. Rego, and F. Glover, "Implementation analysis of efficient heuristic algorithms for the traveling salesman problem," Comput. Oper. Res., vol. 33, no. 4, pp. 1154-1172, Apr. 2006.
30. P. C. Gilmore, "Optimal and suboptimal algorithms for the quadratic assignment problem," J. Soc. Ind. Appl. Math., vol. 10, no. 2, pp. 305-313, Jun. 1962.
31. F. Glover, "A template for scatter search and path relinking," in Lecture Notes in Computer Science, vol. 1363, J.-K. Hao, E. Lutton, E. Ronald, M. Schoenauer, and D. Snyers, Eds. London, U.K.: Springer-Verlag, 1998, pp. 13-54.
32. F. Glover, "Scatter search and path relinking," in New Ideas in Optimization, D. Corne, M. Dorigo, and F. Glover, Eds. New York: McGraw-Hill, 1999, pp. 297-316.
33. F. Glover, "Multi-start and strategic oscillation methods - Principles to exploit adaptive memory," in Computing Tools for Modeling, Optimization, and Simulation: Interfaces in Computer Science and Operations Research, M. Laguna and J. L. Gozales Verlade, Eds. Boston, MA: Kluwer, 2000, pp. 1-24.
34. F. Glover and M. Laguna, Tabu Search. Boston, MA: Kluwer, 1997.
35. L. W. Hagen and A. B. Kahng, "Combining problem reduction and adaptive multistart: A new technique for superior iterative partitioning," IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. 16, no. 7, pp. 709-717, Jul. 1997.
36. P. Hahn and J. Krarup, "A hospital facility layout problem finally solved," J. Intell. Manuf., vol. 12, no. 5/6, pp. 487-496, Oct. 2001.
37. M. Hasegawa, T. Ikeguchi, and K. Aihara, "Exponential and chaotic neurodynamical tabu searches for quadratic assignment problems," Control Cybern., vol. 29, no. 3, pp. 773-788, 2000.
38. R. Hübscher and F. Glover, "Applying tabu search with influential diversification to multiprocessor scheduling," Comput. Oper. Res. vol. 21, no. 8, pp. 877-884, Oct. 1994.
39. T. James, C. Rego, and F. Glover, "Sequential and parallel path-relinking algorithms for the quadratic assignment problem," IEEE Intell. Syst., vol. 20, no. 4, pp. 58-65, Jul./Aug. 2005.
40. D. S. Johnson and L. A. McGeoch, "The traveling salesman problem: A case study in local optimization," in Local Search in Combinatorial Optimization, E. H. L. Aarts and J. K. Lenstra, Eds. New York: Wiley, 1997, pp. 215-310.
41. P. Kadłuczka and K. Wala, "Tabu search and genetic algorithms for the generalized graph partitioning problem," Control Cybern., vol. 24, no. 4, pp. 459-476, 1995.
42. K. Katayama, M. Sadamatsu, and H. Narihisa, "Iterated k-opt local search for the maximum clique problem," in Proc. EvoCOP, 2007, vol. 4446, pp. 84-95.
43. J. P. Kelly, M. Laguna, and F. Glover, "A study of diversification strategies for the quadratic assignment problem," Comput. Oper. Res. vol. 21, no. 8, pp. 885-893, Oct. 1994.
44. T. Koopmans and M. Beckmann, "Assignment problems and the location of economic activities," Econometrica, vol. 25, no. 1, pp. 53-76, 1957.
45. G. Lan and G. DePuy, "On the effectiveness of incorporating randomness and memory into a multi-start metaheuristic with application to the set covering problem," Comput. Ind. Eng., vol. 51, no. 3, pp. 362-374, Nov. 2006.
46. M. Laguna, R. Marti, and V. Campos, "Intensification and diversification with elite tabu search solutions for the linear ordering problem," Comput. Oper. Res., vol. 26, no. 12, pp. 1217-1230, Oct. 1999.
47. E. L. Lawler, "The quadratic assignment problem," Manage. Sci., vol. 9, no. 4, pp. 586-599, Jul. 1963.
48. Y. Li, P. M. Pardalos, and M. G. C. Resende, "A greedy randomized adaptive search procedure for the quadratic assignment problem," in Quadratic Assignment and Related Problems, ser. DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol. 16, P. M. Pardalos and H. Wolkowicz, Eds. Baltimore, MD: Amer. Math. Soc., 1994, pp. 237-261.
49. F.-T. Lin, C.-Y. Kao, and C.-C. Hsu, "Applying the genetic approach to simulated annealing in solving some NP-hard problems," IEEE Trans. Syst., Man, Cybern., vol. 23, no. 6, pp. 1752-1767, Nov./Dec. 1993.
50. H. R. Lourenco, O. C. Martin, and T. Stützle, "Iterated local search," in Handbook of Metaheuristics, ser. International Series in Operations Research and Management Sciences, vol. 57, F. Glover and G. Kochenberger, Eds. Boston, MA: Kluwer, 2003, pp. 321-353.
51. V. Maniezzo and A. Colorni, "The ant system applied to the quadratic assignment problem," IEEE Trans. Knowl. Data Eng., vol. 11, no. 5, pp. 769-778, Sep./Oct. 1999.
52. O. Martin, S. W. Otto, and E. W. Felten, "Large-step Markov chains for the traveling salesman problem," Complex Syst., vol. 5, no. 3, pp. 299-326, Jun. 1991.
53. A. Marzetta and A. Brungger, "A dynamic-programming bound for the quadratic assignment problem," in Proc. COCOON, 1999, vol. 1627, pp. 339-348.
54. T. Mautor and C. Roucairol, "A new exact algorithm for the solution of quadratic assignment problems," Discrete Appl. Math., vol. 55, no. 3, pp. 281-293, Dec. 1994.
55. A. Misevicius, "Genetic algorithm hybridized with ruin and recreate procedure: Application to the quadratic assignment problem," Knowl.-Based Syst., vol. 16, no. 5/6, pp. 261-268, Jul. 2003.
56. A. Misevicius, "An improved hybrid genetic algorithm: New results for the quadratic assignment problem," Knowl.-Based Syst., vol. 17, no. 2-4, pp. 65-73, May 2004.
57. A. Misevicius, "A tabu search algorithm for the quadratic assignment problem," Comput. Optim. Appl., vol. 30, no. 1, pp. 95-111, Jan. 2005.
58. V. Nissen and H. Paul, "A modification of threshold accepting and its application to the quadratic assignment problem," OR Spektrum, vol. 17, no. 2/3, pp. 205-210, Jun. 1995.
59. V. Nissen, "Solving the quadratic assignment problem with clues from nature," IEEE Trans. Neural Netw., vol. 5, no. 1, pp. 66-72, Jan. 1994.
60. M. Nystrom, "Solving certain large instances of the quadratic assignment problem: Steinberg's examples," California Inst. Technol., Pasadena, CA, Tech. Rep. CaltechCSTR:2001.010, 1999.
61. C. A. Oliveira, P. M. Pardalos, and M. G. C. Resende, "GRASP with path-relinking for the quadratic assignment problem," in Efficient and Experimental Algorithms, vol. 3059, C. C. Ribeiro and S. L. Martins, Eds. London, U.K.: Springer-Verlag, 2004, pp. 356-368.
62. G. Palubeckis, "Multistart tabu search strategies for the unconstrained binary quadratic optimization problem," Ann. Oper. Res., vol. 131, no. 1-4, pp. 259-282, Oct. 2004.
63. G. Palubeckis, "A multistart tabu search approach for graph coloring," Inf. Technol. Control, vol. 21, pp. 7-15, 2001.
64. G. Palubeckis and V. Krivickiene, "Application of multistart tabu search to the MAX-CUT problem," Informaacines Technologijos Ir Valdymas, vol. 2, no. 31, pp. 29-35, 2004.
65. P. M. Pardalos, L. S. Pitsoulis, and M. G. C. Resende, "A parallel GRASP implementation for the quadratic assignment problem," in Parallel Algorithms for Irregular Structured Problems - Irregular'94, A. Ferreira and J. Rolim, Eds. Boston, MA: Kluwer, 1995, pp. 111-130.
66. P. M. Pardalos, F. Rendl, and H. Wolkowicz, "The quadratic assignment problem: A survey and recent developments," in Quadratic Assignment and Related Problems, ser. DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol. 16, P. M. Pardalos and H. Wolkowicz, Eds. Baltimore, MD: Amer. Math. Soc., 1994, pp. 1-42.
67. J. W. Pepper, B. L. Golden, and E. A. Wasil, "Solving the traveling salesman problem with annealing-based heuristics: A computational study," IEEE Trans. Syst., Man, Cybern. A, Syst., Humans, vol. 32, no. 1, pp. 72-77, Jan. 2002.
68. G. G. Polak, "On a special case of the quadratic assignment problem with an application to storage-and-retrieval devices," Ann. Oper. Res., vol. 138, no. 1, pp. 223-233, Sep. 2005.
69. M. Queyranne, "Performance ratio of heuristics for triangle inequality - quadratic assignment problems," Oper. Res. Lett., vol. 4, no. 5, pp. 231-234, Feb. 1986.
70. C. Rego, "Relaxed tours and path ejections for the traveling salesman problem," Eur. J. Oper. Res., vol. 106, no. 2/3, pp. 522-538, Apr. 1998.
71. C. Rego, "RAMP: A new metaheuristic framework for combinatorial optimization," in Metaheuristic Optimization via Memory and Evolution: Tabu Search and Scatter Search, C. Rego and B. Alidaee, Eds. Boston, MA: Kluwer, 2005, pp. 441-460.
72. C. Rego and R. Duarte, "A filter and fan approach to the job shop scheduling problem," Eur. J. Oper. Res., vol. 194, no. 3, pp. 650-662, May 2009.
73. C. Rego and F. Glover, "Local search and metaheuristics for the traveling salesman problem," in The Traveling Salesman Problem and Its Variations, G. Gutin and A. P. Punnen, Eds. Boston, MA: Kluwer, 2002, pp. 309-368.
74. C. Rego, T. James, and F. Glover, "An ejection chain algorithm for the quadratic assignment problem," Univ. Mississippi, University, MS, Tech. Rep.
75. S. Sahni and T. Gonzalez, "P-complete approximation problems," J. Assoc. Comput. Mach., vol. 23, no. 3, pp. 555-565, Jul. 1976.
76. P. D. Simic, "Constrained nets for graph matching and other quadratic assignment problems," Neural Comput., vol. 3, no. 2, pp. 268-281, 1991.
77. J. Skorin-Kapov, "Tabu search applied to the quadratic assignment problem," ORSA J. Comput., vol. 2, no. 1, pp. 33-45, 1990.
78. P. Soriano and M. Gendreau, "Diversification strategies in tabu search algorithms for the maximum clique problem," Ann. Oper. Res., vol. 63, no. 2, pp. 189-207, Apr. 1996.
79. T. Stützle, "Iterated local search for the quadratic assignment problem," Eur. J. Oper. Res., vol. 174, no. 3, pp. 1519-1539, Nov. 2006.
80. T. Stützle and M. Dorigo, "ACO algorithms for the quadratic assignment problem," in New Ideas for Optimization, D. Corne, M. Dorigo, and F. Glover, Eds. New York: McGraw-Hill, 1999, pp. 33-50.
81. E. Taillard, "Robust taboo search for the quadratic assignment problem," Parallel Comput., vol. 17, pp. 443-455, 1991.
82. D. M. Tate and A. E. Smith, "A genetic approach to the quadratic assignment problem," Comput. Oper. Res., vol. 22, no. 1, pp. 73-83, Jan. 1995.
83. L. Tseng and S. Liang, "A hybrid metaheuristic for the quadratic assignment problem," Comput. Optim. Appl., vol. 34, no. 1, pp. 85-113, May 2006.
84. M. R. Wilhelm and T. L. Ward, "Solving quadratic assignment problems by simulated annealing," IIE Trans., vol. 19, no. 1, pp. 107-119, 1987.
85. D. L. Woodruff, "Proposals for chunking and tabu search," Eur. J. Oper. Res., vol. 106, no. 2/3, pp. 585-598, Apr. 1998.
86. D. L. Woodruff and E. Zemel, "Hashing vectors for tabu search," Ann. Oper. Res., vol. 41, no. 2, pp. 123-137, Jun. 1993.
87. Q. Zhang, J. Sun, and E. Tsang, "An evolutionary algorithm with guided mutation for the maximum clique problem," IEEE Trans. Evol. Comput. vol. 9, no. 2, pp. 192-200, Apr. 2005.