Novel integer linear programming models for the facility layout problem with fixed-size rectangular departments. (July 2018)

• Record Type: Journal Article
• Authors: Feng, Jianguang; Che, Ada
• Is Part Of: Computers & operations research. Volume 95(2018)
• Page Start: 163
• Page End: 171
• Publication Date: 2018-07
• Subjects: Facility layout -- Adjacency constraints -- Integer linear programming; Operations research -- Periodicals; Electronic digital computers -- Periodicals; 004.05
• DOI: 10.1016/j.cor.2018.03.013
• Languages: English
• ISSNs: 0305-0548

Abstract

Highlights: A facility layout problem to maximize the material flow between adjacent departments. An existing model is demonstrated to be flawed. Two novel ILP models are proposed by reformulating some constraints of the existing model. The models significantly reduce the number of variables and are more efficient. Abstract: This paper considers the facility layout problem (FLP) that places a set of fixed-size rectangular departments on a given rectangular site in such a way that the total material flow between adjacent departments is maximized. We demonstrate that an existing integer linear programming (ILP) model for this problem is flawed. Then, two novel ILP models are developed by reformulating some constraints of the existing model from different perspectives. They both significantly reduce the quantity of decision variables. It is also shown that the proposed models can be simplified if all departments have the same size. Numerical experiments conducted on several benchmark instances show that the proposed models outperform the existing one with promising results. Our models can solve all tested instances to optimality within reasonable time, while the existing one cannot.