Abstract
The facility layout problem is concerned with finding the most efficient arrangement of a given number of departments with unequal area requirements within a facility. The facility layout problem is a hard problem, and therefore, exact solution methods are only feasible for small or greatly restricted problems. In this paper, we propose a spring-embedding approach that unlike previous approaches results in a model that is convex. Numerical results demonstrating the potential of our model and the efficiency of our solution procedure are presented.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Kusiak A and Heragu SS (1987). The facility layout problem. Eur J Opl Res 29: 229–251.
Meller RD and Gau KY (1996). The facility layout problem: recent and emerging trends and perspectives. J Manuf Syst 15: 351–366.
Francis RL, McGinnis LF and White JA (1992). Facility Layout and Location: An Analytical Approach. Prentice-Hall: Englewood Cliffs, NJ.
Drezner Z (1980). DISCON: a new method for the layout problem. Opns Res 28: 1375–1384.
Drezner Z (1987). A heuristic procedure for the layout of a large number of facilities. Mngte Sci 33: 907–915.
Anjos MF and Vannelli A (2002). An attractor–repeller approach to floorplanning. Math Method Opns Res 1: 3–27.
Heragu SS and Kusiak A (1991). Efficient models for the facility layout problem. Eur J Opl Res 53: 1–13.
van Camp DJ, Carter MW and Vannelli A (1991). A nonlinear optimization approach for solving facility layout problems. Eur J Opl Res 57: 174–189.
Murtagh BA and Saunders MA (1998). MINOS 5.5 user's guide, Technical Report SOL 83-20R Stanford University, Stanford, CA.
Kamada T and Kawai S (1989). An algorithm for drawing general undirected graphs. Inform Process Lett 31: 7–15.
Blanks JP (1985). Near-optimal quadratic-based placement for a class of IC layout problems. IEEE Circuit Devic 1: 31–37.
Rowe LA et al. (1987). A browser for directed graphs. Software Pract Exper 17: 61–76.
Bertekas DP (1982). Constrained Optimization and Lagrange Methods. Academic Press: New York, NY.
Bazaraa MS, Sherali HD and Shetty CM (1993). Nonlinear Programming: Theory and Algorithms. John Wiley & Sons: New York, NY.
Davidon WC (1959). Variable metric methods for minimization, US Atomic Energy Commission Research and Development Report No. ANL-5990 Argonne National Laboratory, Argonne, IL.
Venkataraman K (2001). Applied Optimization with MATLAB Programming. John Wiley & Sons: New York, NY.
Nugent CE, Vollmann TE and Ruml J (1968). An experimental comparison of techniques for the assignment of facilities to locations. Opns Res 16: 150–173.
Armour GC and Buffa ES (1963). A heuristic algorithm and simulation approach to relative allocation of facilities. Mngt Sci 9: 294–309.
Czyzyk J, Mesnier M and Moré J (1998). The NEOS server. IEEE Comput Sci Eng 5: 68–75.
Acknowledgements
We thank Professor Czeslaw Smutnicki for his helpful comments and suggestions on an earlier version of this paper. Dr Ignacio Castillo gratefully acknowledges the financial support from the University of Alberta School of Business Pocklington Research Allowance to partially support this research.
Author information
Authors and Affiliations
Corresponding author
Additional information
An erratum to this article is available at http://dx.doi.org/10.1057/jors.2010.25.
Rights and permissions
About this article
Cite this article
Castillo, I., Sim, T. A spring-embedding approach for the facility layout problem. J Oper Res Soc 55, 73–81 (2004). https://doi.org/10.1057/palgrave.jors.2601647
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1057/palgrave.jors.2601647