Most facility-layout problems are at present solved by heuristic methods, which are not suitable for treating layout problems if some facilities need to be placed together. In this paper we add the constraints of clustering facilities and thus propose an optimization model for facility-layout problems. The advantages of introducing clustering constraints are: first, they fit the more practical rationale of facility layouts; second, they can help improve the computational efficiency owing to the reduction in nonoverlapping constraints among the facilities.
Get full access to this article
View all access options for this article.
References
1.
BazaraaM SSheraliM D, 1980, “Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem”Naval Research Logistics Quarterly27(1) 29–41
2.
BurkardR E, 1984Discrete Location Theory (Academic Press, New York)
3.
CampD JCarterM WVannelliA, 1991, “A nonlinear optimization approach for solving facility layout problems”European Journal of Operational Research57174–189
4.
FouldsL RGibbonsP BGiffinJ W, 1985, “Facilities layout adjacency determination: An experimental comparison of three graph theoretic heuristics”Operations Research331091–1106
5.
FriezeA MYadegarJ, 1983, “On the quadratic assignment problem”Discrete Applied Mathematics589–98
6.
GiffinJ WFouldsL RCameronD C, 1986, “Drawing a block plan from a REL chart with graph theory and a microcomputer”Computers and Industrial Engineering10109–116
