A hybrid algorithm for the quadratic assignment problem

Proceedings of the 2008 International Conference on Scientific Computing, CSC 2008

Volumn , Issue , 2008, Pages 261-265

  Ng, Kien Ming ^a   Gunawan, Aldy ^a   Poh, Kim Leng ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

GRASP; Hybrid Algorithm; Quadratic assignment problem; Simulated annealing; Tabu search

Indexed keywords

COMPUTATION TIME; COMPUTATIONAL RESULTS; GRASP; GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURES; HYBRID ALGORITHM; INITIAL SOLUTIONS; NP-HARD; QUADRATIC ASSIGNMENT PROBLEM; TABU SEARCH ALGORITHMS; TEST PROBLEMS;

ADAPTIVE ALGORITHMS; ANNEALING; CIRCUIT THEORY; CRYOGENIC LIQUIDS; TABU SEARCH; TRAVELING SALESMAN PROBLEM;

SIMULATED ANNEALING;

EID: 62649122432     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. T.C. Koopmans and M.J. Beckmann. Assignment problems and the location of economic activities. Econometrica, 25, pp. 53-76, 1957.
2. S. Sahni and T. Gonzales. P-complete approximation problems. Journal of the Association for Computing Machinery, 23(3), pp. 555-565, 1976.
3. L. Steinberg. The backboard wiring problem: A placement algorithm. SIAM Review, 3, pp. 37-50, 1961.
4. J.W. Dickey and J.W. Hopkins. Campus building arrangement using Topaz. Transportation Research, 6, pp. 59-68, 1972.
5. A.N. Elshafei. Hospital layout as a quadratic assignment problem. Operations Research Quarterly, 28(1), pp. 167-179, 1977.
6. A.M. Geoffrion and G.W. Graves. Scheduling parallel production lines with changeover costs: Practical applications of a quadratic assignment/LP approach. Operations Research, 24, pp. 595-610, 1976.
7. E.M. Loiola, N.M.M. de Abreu, P.O. Boaventura-Netto, P. Hahn and T. Querido. A survey for the quadratic assignment problem. European Journal of Operational Research, 176, pp. 657-690, 2007.
8. M.R. Wilhelm and T.L.Ward. Solving quadratic assignment problem by 'simulated annealing'. IIE Transactions, 19(1), pp. 107-119, 1987.
9. D.F. Rossin, M.C. Springer, B.D. Klein. New complexity measures for the facility layout problem: An empirical study using traditional and neural network analysis. Computers and Industrial Engineering, 36(3), pp.585-602, 1999.
10. C.A. Fedjki, S.O. Duffuaa. An extreme point algorithm for a local minimum solution to the quadratic assignment problem. European Journal of Operational Research, 156(3), pp. 566-578, 2004.
11. E.L. Lawler. The quadratic assignment problem. Management Science, 9, pp. 586-599, 1963.
12. A.M. Frieze and J. Yadegar. On the quadratic assignment problem. Discrete Applied Mathematics, 5(1), pp. 89-98, 1983.
13. É.D. Taillard. Robust taboo search for the quadratic assignment problem. Parallel Computing, 17, pp. 443-455, 1991.
14. M.H. Lim, Y. Yuan and S. Omatu. Efficient genetic algorithms using simple genes exchange local search policy for the quadratic assignment problem. Computational Optimization and Applications, 15, pp. 249-268, 2000.
15. M.H. Lim, Y. Yuan and S. Omatu. Extensive testing of a hybrid genetic algorithm for solving quadratic assignment problems. Computational Optimization and Applications, 23, pp. 47-64, 2002.
16. R.K. Ahuja, J.B. Orlin and A. Tiwari. A greedy genetic algorithm for the quadratic assignment problem. Computers and Operations Research, 27, pp. 917-934, 2000.
17. Z. Drezner. The extended concentric tabu for the quadratic assignment problem. European Journal of Operational Research, 160, pp. 416-422, 2005.
18. D.T. Connolly. An improved annealing scheme for the QAP. European Journal of Operational Research, 46, pp. 93-100, 1990.
19. P. Tian, H. Wang and D. Zhang. Simulated annealing for the quadratic assignment problem: A further study. Computers and Industrial Engineering, 31 (3-4), pp. 925-928, 1996.
20. R.E. Burkard, S.E. Karisch and F. Rendl. QAPLIB - A quadratic assignment problem library. Journal of Global Optimization, 10, pp. 391-403, 1997.
21. L. Yong, P.M. Pardalos and M.G.C. Resende. A greedy randomized adaptive search procedure for the quadratic assignment problem. In P.M. Pardalos and H. Wolkowicz (eds.), Quadratic Assignment and Related Problems, DIMACS Workshop May 20-21, 1993, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 16, pp. 237-261, 1994.
22. S. Kirkpatrick, C.D. Gelatt and M.P. Vecchi. Optimization by simulated annealing. Science, 200, pp. 671-680, 1983.
23. F. Glover. Tabu search - Part I. ORSA Journal on Computing, 1, pp. 190-206, 1989.
24. É.D. Taillard and L.M. Gambardella. Adaptive memories for the quadratic assignment problem. Technical Report IDSIA-87-97, IDSIA, Lugano, Switzerland, 1997.