A new iterated fast local search heuristic for solving QAP formulation in facility layout design

Robotics and Computer-Integrated Manufacturing

Volumn 25, Issue 3, 2009, Pages 620-629

  Ramkumar, A S ^a   Ponnambalam, S G ^b   Jawahar, N ^c  

^a AMRITA SCHOOL OF ENGINEERING   (India)

^b MONASH UNIVERSITY MALAYSIA   (Malaysia)

^c THIAGARAJAR COLLEGE OF ENGINEERING   (India)

Author keywords

Facility layout design; Heuristic; Quadratic assignment problem; Search algorithm

Indexed keywords

BENCHMARKING; DESIGN; HEURISTIC METHODS; LEARNING ALGORITHMS; ONLINE SEARCHING; PLANT LAYOUT; TRAVELING SALESMAN PROBLEM;

CROSSOVER OPERATORS; FACILITY LAYOUT DESIGN; FAST LOCAL SEARCHES; HEURISTIC; LOCAL SEARCHES; MATERIAL FLOWS; MUTATION OPERATIONS; QUADRATIC ASSIGNMENT PROBLEM; QUADRATIC FUNCTIONS; SEARCH ALGORITHM; SOLUTION QUALITIES; TOTAL COSTS;

HEURISTIC ALGORITHMS;

EID: 61349121397     PISSN: 07365845     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.rcim.2008.03.022     Document Type: Article

References (40)

1. Heragu S.S. Facilities design (1997), PWS Publishing, Boston, MA
2. Koopmans T.C., and Beckman M. Assignment problems and the location of economic activities. Econometrica 25 (1957) 53-76
3. Anstreicher K.M. Recent advances in the solution of quadratic assignment problems. Math Program Ser B 97 (2003) 27-42
4. Merz P., and Freisleben B. Fitness landscape analysis and memetic algorithms for the quadratic assignment problem. IEEE Trans Evol Comput 4 4 (2000) 337-352
5. Ramkumar AS, Ponnambalam SG, Jawahar N, Suresh RK. Iterated fast local search algorithm for quadratic assignment problems. Robot Comput Integr Manuf 2008. doi:10.1016/j.rcim.2007.01.004.
6. Burgard R.E., and Bonniger T. A heuristic for quadratic Boolean programs with applications to quadratic assignment problems. Eur J Oper Res 13 (1983) 374-386
7. Malucelli F. Quadratic assignment problems: solution methods and applications. Unpublished doctoral dissertation, Departmento Informatica, Universita Di Pisa, Italy, 1993.
8. Pardalos PM, Rendl F, Wolkowicz H. The quadratic assignment problem: a survey and recent developments. In: Pardalos PM, Wolkowicz H, editors. Quadratic assignment and related problems. DIMACS series in discrete mathematics and theoretical computer science, vol. 16. AMS, 1994. p. 1-42.
9. Burkard R.E., Cela E., Pardalos P.M., and Pitsoulis L.S. The quadratic assignment problem. In: Zhu D.Z., and Pardalos P.M. (Eds). Handbook of combinatorial optimization, vol. 3 (1998), Kluwer 241-337
10. Lawler E.L. The quadratic assignment problem. Manage Sci 9 (1963) 586-599
11. Pardalos PM, Crouse J. A parallel algorithm for the quadratic assignment problem. In: Proceedings of the supercomputing 1989 conference, ACM Press, 1989. p. 351-60.
12. Bazara M.S., and Sherali M.D. Bender's partitioning scheme applied to a new formulation of the quadratic assignment problem. Naval Res Logistics Q 27 (1980) 29-41
13. Christofides N., and Benavent E. An exact algorithm for the quadratic assignment problem. Oper Res 37 (1989) 760-768
14. Carraresi P, Malucelli F. A new lower bound for the quadratic assignment problem. Technical report TR-34/92, Universita di Pisa, 1992.
15. Gilmore P.C. Optimal and suboptimal algorithms for the quadratic assignment problem. SIAM J Appl Math 10 (1962) 305-313
16. Armour G.C., and Buffa E.S. Heuristic algorithm and simulation approach to relative location of facilities. Manage Sci 9 (1963) 294-309
17. Pitsoulis L. A sparse GRASP for solving the quadratic assignment problem. MEng thesis, The University of Florida, 1994.
18. Glover F. Tabu search-Part 1. ORSA J Comput 1 3 (1989) 190-206
19. Glover F. Tabu search-Part 2. ORSA J Comput 2 1 (1989) 4-32
20. Connolly D.T. An improved annealing scheme for the QAP. Eur J Oper Res 46 (1990) 93-100
21. Cerny V. Thermodynamical approach to traveling salesman problem: an efficient simulation algorithm. J Optim Theory Appl 45 (1985) 41-51
22. Li Y., Pardalos P.M., and Resende M.G.C. A greedy randomized adaptive search procedure for the quadratic assignment problem. Quadratic assignment and related problems. In: Pardalos P.M., and Wolkowicz H. (Eds). DIMACS series in discrete mathematics and theoretical computer science (1994), American Mathematical Society 237-261
23. Buffa E.S., Armour G.C., and Vollmann T.E. Allocating facilities with CRAFT. Harvard Bus Rev 42 (1964) 136-158
24. Muller-Merbach H. Optimale Reihenfolgen (1970), Springer p. 158-79
25. West D.H. Algorithm 608: approximate solution of the quadratic assignment problem. ACM Trans Math Software 9 (1983) 461-466
26. Wilhelm M.R., and Ward T.L. Solving quadratic assignment problems by simulated annealing. IIE Trans 19 (1987) 107-119
27. Skorin-Kapov J. Tabu search applied to the quadratic assignment problem. ORSA J Comput 2 (1990) 33-45
28. Taillard E.D. Robust taboo search for the quadratic assignment problem. Parallel Comput 17 (1991) 443-455
29. Fleurent C., and Ferland J. Genetic hybrids for the quadratic assignment problem. DIMACS Ser Math Theor Comput Sci 16 (1994) 190-206
30. Tate D.M., and Smith A.E. A genetic approach to the quadratic assignment problem. Comput Oper Res 22 1 (1995) 78-83
31. Ahuja K.R., Orlin J.B., and Tiwari A. A greedy algorithm for the quadratic assignment problem. Comput Oper Res 27 (2000) 917-934
32. Maniezzo V, Dorigo M, Colorini A. The ant system applied to the quadratic assignment problem. Technical report IRIDIA/94-28. Belgium: Universite Libre de Bruxelles; 1994.
33. Dorigo M., Maniezzo V., and Colorni A. The ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern-Part B 26 (1996) 29-41
34. Stutzle T., and Dorigo M. ACO algorithms for the quadratic assignment problem. In: Corne D., Dorigo M., and Glover F. (Eds). New ideas in optimization (1999), McGraw-Hill Ltd, Maidenhead, UK
35. Talbi E.G., Roux O., Fonlupt C., and Robillard D. Parallel ant colonies for the quadratic assignment problem. Future Gen Comput Syst 17 (2001) 441-449
36. Solimanpur M., Vrat P., and Shankar R. Ant colony optimization algorithm to the inter-cell layout problem in cellular manufacturing. Eur J Oper Res 157 (2004) 592-606
37. Singh S.P., and Sharma R.R.K. A survey on various approaches to solve facility layout problem. Int J Adv Manuf Technol 30 (2006) 425-433
38. Loiola E.M., Abreu N.M.M., Boaventura-Netto P.O., Hahn P., and Querido T. A survey for the quadratic assignment problem. Eur J Oper Res 176 2 (2007) 657-690
39. Taillard E.D. Comparison of iterative searches for the quadratic assignment problem. Location Sci 3 (1995) 87-105
40. Merz P, Freisleben B. A comparison of memetic algorithms, Tabu Search, and ant colonies for the quadratic assignment problem. In: Proceedings of the international congress on evolutionary computation, IEEE Press, 1999. p. 2063-70.