Facility layout planning. An extended literature review

Pérez-Gosende, Pablo; Mula, Josefa; Díaz‐Madroñero, Manuel

doi:10.1080/00207543.2021.1897176

Cited by 84 publications

(51 citation statements)

References 250 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Since only small-size problems can be solved optimally using exact methods, heuristic methods were developed to solve the UA-FLP. For reviews of the FLP literature see Kusiak and Heragu [5], Meller and Gau [6], Anjos and Vieira [7], and Perez-Gosende et al [8].…”

Section: Related Researchmentioning

confidence: 99%

“…(2) The BSH presented in McKendall and Hakobyan [8] is used to construct the layout and determine the total weighed distance (TWD) for each solution in P 0 . (3) Based on BSH layout plans (obtained in stage 2), set binary variables left ij , below ij , and o i in proposed MILP, and improve layout for chromosomes in P 0 or P g using the resulting LP model and the dual simplex method.…”

Section: A Genetic Algorithm (Ga) For the Ua-flpmentioning

confidence: 99%

“…The facility in position k (i.e., π(k)), is placed on the boundary of already placed facilities (i.e., π(1), π(2), …, π(k − 1)) such that TWD is minimized and layout is feasible (i.e., facilities placed are within the boundary of the floor space). See McKendall and Hakobyan [8] for details.…”

Section: Boundary Search Heuristic (Bsh)mentioning

confidence: 99%

“…Note, the solution representation (chromosome) does not specify the location (x i , y i , l i , w i ) and orientation (o i ) of each facility i. The BSH presented in McKendall and Hakobyan [8] is used to construct the layout and determine TWD for each chromosome in P 0 .…”

Section: Boundary Search Heuristic (Bsh)mentioning

confidence: 99%

“…The BSH presented in McKendall and Hakobyan [8] is a construction algorithm used to produce the layout and determine TWD for each chromosome in P 0 . Given a solution (chromosome) π a placement procedure is used to assign facilities to locations on the plant floor.…”

Section: Boundary Search Heuristic (Bsh)mentioning

confidence: 99%

See 4 more Smart Citations

An Application of an Unequal-Area Facilities Layout Problem with Fixed-Shape Facilities

McKendall

Hakobyan

2021

Algorithms

View full text Add to dashboard Cite

The unequal-area facility layout problem (UA-FLP) is the problem of locating rectangular facilities on a rectangular floor space such that facilities do not overlap while optimizing some objective. The objective considered in this paper is minimizing the total distance materials travel between facilities. The UA-FLP considered in this paper considers facilities with fixed dimension and was motivated by the investigation of layout options for a production area at the Toyota Motor Manufacturing West Virginia (TMMWV) plant in Buffalo, WV, USA. This paper presents a mathematical model and a genetic algorithm for locating facilities on a continuous plant floor. More specifically, a genetic algorithm, which consists of a boundary search heuristic (BSH), a linear program, and a dual simplex method, is developed for an UA-FLP. To test the performance of the proposed technique, several test problems taken from the literature are used in the analysis. The results show that the proposed heuristic performs well with respect to solution quality and computational time.

show abstract