Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation

European Journal of Operational Research

Volumn 106, Issue 2-3, 1998, Pages 457-488

  Chiang, Wen Chyuan ^a   Chiang, Chi ^b  

^a UNIVERSITY OF TULSA   (United States)

^b NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

Facility layout; Probabilistic tabu search; Quadratic assignment problem; Tabu search

Indexed keywords

COMPUTATIONAL METHODS; HEURISTIC METHODS; PROBABILITY; PROBLEM SOLVING; SIMULATED ANNEALING; STATISTICAL METHODS; STRATEGIC PLANNING;

INTELLIGENT LOCAL SEARCH STRATEGY; QUADRATIC ASSIGNMENT PROBLEM FORMULATIONS; TABU SEARCH METHODS;

PLANT LAYOUT;

EID: 0032050758     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)00285-3     Document Type: Article

References (50)

1. Apple, J., Deisenroth, M., 1972. A computerized plant layout analysis and evaluation technique. Proceedings of AIIE 1972 Spring Conference. Norcross, GA, pp. 112-117.
2. Armour, G.C., Buffa, E.S., 1963. A heuristic algorithm and simulation approach to the relative location of facilities. Management Science 9 (2), 294-309.
3. Battiti, R., Tecchioli, G., 1994. Simulated annealing and tabu search in the long run: a comparison on QAP tasks. Computers and Mathematics with Applications 28 (6), 1-8.
4. Bazaraa, M.S., 1975. Computerized layout design: a branch and bound approach. AIIE Transactions 7 (4), 432-437.
5. Bazaraa, M.S., Elshafei, A.N., 1979. An exact branch and bound procedure for quadratic assignment problems. Naval Research Logistics Quarterly 26, 109-121.
6. Bazaraa, M.S., Sherali, A.N., 1980. Bender's partitioning scheme applied to a new formulation of the quadratic assignment problem. Naval Research Logistics Quarterly 27 (1), 29-41.
7. Ben-Daya, M., Al-Fawzan, M.A., 1996. Simulated annealing approach for the one-machine mean tardiness scheduling problem. European Journal of Operational Research 93 (1), 61-67.
8. Bonomi, E., Lutton, J.L., 1984. The N-City travelling salesman problem: statistical mechanics and the metropolis algorithm. SIAM Review 26 (4), 551-568.
9. Bonomi, E., Lutton, J.L., 1986. The asymptotic behavior of quadratic sum assignment problems: a statistical mechanics approach. European Journal of Operational Research 26, 295-300.
10. Burkard, R.E., 1990. Locations with spatial interactions: the quadratic assignment Problem. In: Mirchandani, P. B., Francis, R.L. (Eds.), Discrete Location Theory, Wiley, Berlin.
11. Burkard, R.E., Rendl, F., 1984. A thermodynamically motivated simulation procedure for combinatorial optimization problems. European Journal of Operational Research 17, 169-174.
12. Burkard, R.E., Stratmann, K.H., 1978. Numerical investigation on quadratic assignment problems. Naval Research Logistic Quarterly 25, 129-148.
13. Chakrapani, J., Skorin-Kapov, J., 1993. Massively parallel tabu search for the quadratic assignment problem. Annals of Operations Research 41, 327-341.
14. Edwards, H., Gillett, B., Giffin, J.W., 1970. Modular allocation technique. Management Science 17, 169-171.
15. Foulds, L.R., 1983. Techniques for facilities layout: deciding which pairs of activities should be adjacent. Management Science 29 (12), 1414-1426.
16. Francis, R.L., White, J.A., 1974. Facility Layout and Location: An Analytical Approach, Prentice-Hall, Englewood Cliffs, NJ.
17. Francis, R.L., McGinnis, L.F., White, J.A., 1992. Facility Layout and Location: An Analytical Approach, 2nd ed. Prentice-Hall, Englewood Cliffs, NJ.
18. Gilmore, P.C., 1963. Optimal and suboptimal algorithms for the quadratic assignment problem. SIAM Journal 10 (2), 305-313.
19. Glover, F., 1989. Tabu search, Part I. ORSA Journal on Computing 1, 190-206.
20. Glover, F., 1996. Tabu search and adaptive memory programming - Advances, applications, and challenges. In: Barr, Helgason, Kennington (Eds.), Interfaces in Computer Science and Operations Research, Kluwer Academic Publishers, MA.
21. Glover, F., Laguna, M.M., 1993. Tabu search. In: Reeves, C.R. (Eds.), Modern Heuristic Techniques for Combinatorial Problems, Halsted Press, New York.
22. Golany, B., Rosenblatt, M.J., 1989. A heuristic algorithm for the quadratic assignment formulation to the plant layout problem. International Journal of Production Research 27 (2), 293-308.
23. Heragu, S.S., Alfa, A.S., 1992. A distance assignment approach to the facility layout problem. European Journal of Operational Research 57, 190-202.
24. Hillier, F.S., 1963. Quantitative tools for plant layout analysis. Journal of Industrial Engineering 14, 33-40.
25. Hiller, F.S., Connors, M.M., 1966. Quadratic assignment problem algorithms and the location of indivisible facilities. Management Science 9 (4), 586-599.
26. Jajodia, S., Minis, I., Harhalakis, G., Proth, J.-M., 1992. CLASS: Computerized layout solutions using simulated annealing. International Journal of Production Research 30 (1), 95-108.
27. Johnson, D.S., Aragon, C., McGeoch, L.A., Schevon, C., 1991. Optimization by simulated annealing: an experimental evaluation: Part II. Graph coloring and number partitioning. Operations Research 39 (3), 778-406.
28. Kelly, J.P., Laguna, M., Glover, F., 1994. A study of diversification strategies for the quadratic assignment problem. Computers and operations research 21 (8), 885-893.
29. Koopmans, T.C., Beckman, M.J., 1957. Assignment problems and the location of economic activities. Econometrica 25 (1), 53-76.
30. Kouvelis, P., Chiang, W.C., 1992. A simulated annealing procedure for single row layout problems in flexible manufacturing systems. International Journal of Production Research 30 (4), 717-732.
31. Kouvelis, P., Chiang, W.C., Fitzsimmons, J., 1992. Simulated annealing for machine layout problems in the presence of zoning constraints. European Journal of Operational Research 57, 203-223.
32. Kusiak, A., 1990. Intelligent Manufacturing Systems, Prentice-Hall, Englewood Cliffs, NJ.
33. Kusiak, A., Heragu, S.S., 1987. The facility layout problem. European Journal of Operational Research 29 (3), 229-251.
34. Laguna, M.M., Glover, F., 1993. Bandwidth packing: a tabu search approach. Management Science 39 (4), 492-500.
35. Lawler, E.L., 1963. The quadratic assignment problem. Management Science 9 (4), 586-599.
36. Nugent, C., Vollman, T., Ruml, J., 1968. An experimental comparison of techniques for the assignment of facilities to locations. Operations Research 16, 150-173.
37. Picone, C.J., Wilhelm, W.E., 1984. Perturbation scheme to improve Hillier's solution to the facilities layout problem. Management Science 30 (10), 1238-1249.
38. Pierce, J., Crowston, W., 1971. Tree search algorithms for the quadratic assignment problem. Naval Research Logistic Quarterly 18, 1-36.
39. Resende, M.G.C., Ramakrishnan, K.G., Drezner, Z., 1995. Computing lower bounds for the quadratic assignment problem with an interior point algorithm for linear programming. Operations Research 43 (5), 781-791.
40. Rosenblatt, M.J., 1979. The facilities layout problem: a multigoal approach. International Journal of Production Research 17 (4), 323-332.
41. Rosenblatt, M.J., Golany, B., 1992. A distance assignment approach to the facility layout problem. European Journal of Operational Research 57, 253-270.
42. Sahni, S., Gonzalez, T., 1976. P-complete approximation problem. Journal of the Association for Computing Machinery 23 (3), 555-565.
43. Sharpe, R., Marksjo, B.S., 1985. Facility layout optimization using the metropolis algorithm. Environmental and Planning B 12, 443-453.
44. Sharpe, R., Marksjo, B.S., Mitchell, J.R., Crawford, J.R., 1985. An interactive model for the layout of buildings. Applied Mathematical Modeling 9 (3), 207-214.
45. Skorin-Kapov, J., 1990. Tabu search applied to the quadratic assignment problem. ORSA Journal on Computing 2, 33-45.
46. Skorin-Kapov, J., 1994. Extensions of a tabu search adaptation to the quadratic assignment problem. Computers and Operations Research 21 (8), 855-865.
47. Sule, D.R., 1988. Manufacturing Facilities, PWS-KENT, MA.
48. Taillard, E., 1991. Robust tabu search for the quadratic assignment. Parallel Computing 17, 443-455.
49. Van Laarhoven, P.J.M., Aarts, E.H., 1987. Simulated Annealing: Theory and Applications, Reidel, Dordrecht.
50. Wilhelm, M.R., Ward, T.L., 1987. Solving quadratic assignment problems by simulated annealing. IIE Transactions 19, 107-119.