Two-level modified simulated annealing based approach for solving facility layout problem

International Journal of Production Research

Volumn 46, Issue 13, 2008, Pages 3563-3582

  Singh, S P ^a   Sharma, R R K ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

Author keywords

Facility layout; Quadratic assignment problem; Simulated annealing

Indexed keywords

CONSTRAINT THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING; SIMULATED ANNEALING;

FACILITY LAYOUT; QUADRATIC ASSIGNMENT PROBLEM;

PLANT LAYOUT;

EID: 42649130382     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540601178557     Document Type: Article

References (51)

1. Ahuja, R.K., Orlin, J.B. and Tiwari, A., A greedy genetic algorithm for the quadratic assignment problem. Comput. Oper. Res., 2000, 27, 917-934.
2. Azadivar, F. and Wang, J.J., Facility layout optimization using simulation and genetic algorithms. Int. J. Prod. Res., 2000, 38, 4369-4383.
3. Balakrishnan, J., Cheng, C.H. and Wong, K.F., FACOPT: a user friendly facility layout optimization system. Comput. Oper. Res., 2003, 30, 1625-1641.
4. Bolte, A. and Thonemann, U.W., Optimizing simulated annealing schedule with genetic programming. Eur. J. Oper. Res., 1996, 92, 402-416.
5. Burkard, R.E. and Rendl, F., A thermodynamically motivated simulation procedure for combinatorial optimization problems. Eur. J. Oper. Res., 1984, 17, 169-174.
6. Burkard, R.E. and Stratmann, K.H., Numerical investigations on quadratic assignment problems. Nav. Res. Logist. Q., 1978, 25, 129-148.
7. Burkard, R.E., Karisch, S. and Rendl, F., QAPLIB-a quadratic assignment problem library. J. Global. Optim., 1997, 10, 391-403.
8. Chiang, W.C. and Kouvelis, P., An improved tabu search heuristic for solving facility layout design problems. Int. J. Prod. Res., 1996, 34, 2565-2585.
9. Connolly, D.T., An improved annealing scheme for the QAP. Eur. J. Oper. Res., 1990, 46, 93-100.
10. Diponegoro, A. and Sarker, B.R., Machine assignment in a nonlinear multi-product flowline. J. Oper. Res. Soc., 2003, 54, 472-489.
11. Dorigo, M. and Blum, C., Ant colony optimization theory: a survey. Theor. Comput. Sci., 2005, 344, 243-278.
12. Dowsland, K.A., Modern heuristic techniques for combinatorial problems. In Simulated Annealing, edited by C.R. Reeves, 1995 (McGraw-Hill: Maidenhead, UK).
13. Drezner, Z., A heuristic procedure for the layout of a large number of facilities. Manage. Sci., 1987, 33, 907-915.
14. Francis, R.L. and White, J.A., Facility Layout and Locations: An Analytical Approach, 1974 (Prentice hall: Englewood Cliffs, NJ).
15. Gambardella, L.M., Taillard, E. and Dorigo, M., Ant colonies for the quadratic assignment problem. J. Oper. Res. Soc., 1999, 50, 167-176.
16. Glover, F., Tabu search - Part I. ORSA J. Comput., 1989, 1, 190-206.
17. Glover, F., Tabu search - Part II. ORSA J. Comput., 1990, 2, 4-32.
18. Heragu, S.S., Modeling the machine layout problem. in Proceedings of the 12th Computers and Industrial Engineering Conference, 12-14 March 1988.
19. Heragu, S.S., Recent models and techniques for solving the layout problem. Eur. J. Oper. Res., 1992, 57, 136-144.
20. Heragu, S.S., Facilities Design, 1997 (PWS Publishing Co.: Boston, MA).
21. Heragu, S.S. and Alfa, A.S., Experimental analysis of simulated annealing based algorithms for the layout problem. Eur. J. Oper. Res., 1992, 57, 190-223.
22. Heragu, S.S. and Kusiak, A., Machine layout problem in flexible manufacturing systems. Oper. Res., 1988, 36, 258-268.
23. Heragu, S.S. and Kusiak, A., Machine Layout: an optimization and knowledge based approach. Int. J. Prod. Res., 1989, 28, 615-635.
24. Kirkpatrick, S., Gelatt Jr, C.D. and Vecchi, M.P., Optimization by Simulated Annealing. Science, 1983, 220, 671-680.
25. Kochhar, J.S. and Heragu, S.S., Facility Layout Design in a Changing Environment. Int. J. Prod. Res., 1999, 37, 2429-2446.
26. Koopmans, T.C. and Beckman, M., Assignment problems and the location of economic activities. Econometrica, 1957, 25, 53-76.
27. Kusiak, A. and Heragu, S.S., The facility layout problem. Eur. J. Oper. Res., 1987, 29, 229-251.
28. Laursen, P.S., Simulated Annealing for the QAP- Optimal trade-off between simulation time and solution quality. Eur. J. Oper. Res., 1993, 69, 238-243.
29. Li, Y., Pardalos, P.M., Ramakrishnan, K.G. and Resende, M., Lower bounds for the quadratic assignment problem. Ann. Oper. Res., 1994, 50, 387-410.
30. Loiola, E.M., Abreu, N.M.M., Boarenture-Netto P.O., Hahn, P. and Querido, T., An analytical survey for the Quadratic assignment problem. Eur. J. Oper. Res., 2007. [In Press].
31. Malmborg, C.J., Empirical approximation of volume distance distributions for line layout problems. Int. J. Prod. Res., 1999, 37, 375-392.
32. Maniezzo, V. and Colorni, A., The ant system applied to the quadratic assignment problem. IEEE Trans. Knowl. Data Eng., 1999, 11, 769-778.
33. Meller, R.D. and Bozer, Y.A., A new simulated annealing for the facility layout problem. Int. J. Prod. Res., 1996, 34, 1675-1692.
34. Meller, R.D. and Gau, K.Y., The facility layout problem: recent and emerging trends and perspectives. J. Manuf. Sys., 1996a, 15, 351-366.
35. Meller, R.D. and Gau, K.Y., Facility layout objective functions and robust layouts. Int. J. Prod. Res., 1996b, 34, 2727-2742.
36. Middendorf, M., Reischle, F. and Schmeck, H., Multi Colony Ant Algorithms. J. Heurist., 2002, 8, 305-320.
37. Misevicius, A., A modified simulated annealing algorithm for quadratic assignment problem. Informatica, 2003, 14, 497-514.
38. Moore, J.M., Computer aided facilities design: an international survey. Int. J. Prod. Res., 1974, 12, 21-44.
39. Nugent, C.E., Vollman, T.E. and Ruml, J., An experimental comparison of techniques for the assignment of facilities to locations. Oper. Res., 1968, 16, 150-173.
40. O'Brien, C. and Abdel Barr, S.E.Z., An interactive approach to computer aided facility layout. Int. J. Prod. Res., 1980, 18, 201-211.
41. Peng, T., Huanchen, W. and Dongme, Z., Simulated annealing for the quadratic assignment problem: a further study. Comput. Ind. Eng., 1996, 31, 925-928.
42. Rosenblatt, M.J. and Lee, H.L., A robustness approach to facilities design. Int. J. Prod. Res., 1987, 25, 479-486.
43. Sahni, S. and Gonzalez, P., P-Complete approximation problems. J. ACM, 1976, 23, 555-565.
44. Singh, S.P. and Sharma, R.R.K., A survey on various approaches to solve facility layout problem. Int. J. Adv. Manuf. Tech., 2006, 30, 425-433.
45. Solimanpur, M., Vrat, P. and Shankar, R., An ant algorithm for the single row layout problem in flexible manufacturing systems. Comput. Oper. Res., 2005, 32, 583-598.
46. Sttzle, T. and Dorigo, M., ACO algorithms for the quadratic assignment problem. In New Ideas in Optimization, edited by D. Corne, M. Dorigo and F. Glover, 1999 (McGraw-Hill: Maidenhead, UK).
47. Taillard, E., Robust taboo search for the quadratic assignment problem. Parallel Comput., 1991, 17, 443-455.
48. Tate, D.E. and Smith, A.E., A genetic approach to the quadratic assignment problem. Comput. Oper. Res., 1995, 22, 73-83.
49. Tompkins, J.A. and White, J.A., Facilities Planning, 1984 (Wiley: New York).
50. Van Laarhoven, P.J.M and Aarts, E.H., Simulated annealing: theory and application, 1987 (Reidel: Dordrecht).
51. Wilhelm, M.R. and Ward, T.L., Solving quadratic assignment problems by simulated annealing. IIE Transaction, 1987, 19, 107-119.