TY - JOUR
T1 - Discretized Cell Modeling for Optimal Facility Layout Plans of Unequal and Irregular Facilities
AU - Huang, C.
AU - Wong, C. K.
PY - 2017/1/1
Y1 - 2017/1/1
N2 - Facility layout design is an essential planning task to resolve potential spatial conflicts and overlapping during practical operations. A discretized cell optimization model is developed to optimize site space usages. Site areas and facilities are represented by small unit cells to effectively model irregularities, and the availability of unit cells for use in a facility setup is modeled by binary-type variables. With size and shape requirements through linear constraints, the site layout design can be formulated as a binary mixed integer-linear programming (BMILP) problem to allocate different facilities onto different site available areas in optimal shapes and locations. Total material transportation costs across facilities are optimized subject to various design constraints ensuring safety, homogenous facility setups, physical size, and orientation requirements. The proposed cell model is verified by comparing optimization results with results obtained by conventional point notation methods. A standard branch-and-bound algorithm is applied to solve a global optimal solution, and the numerical example is optimized for illustrating the very different optimized layout plan in terms of facility locations, positions of entry and exit points, shapes, and orientations of different facilities.
AB - Facility layout design is an essential planning task to resolve potential spatial conflicts and overlapping during practical operations. A discretized cell optimization model is developed to optimize site space usages. Site areas and facilities are represented by small unit cells to effectively model irregularities, and the availability of unit cells for use in a facility setup is modeled by binary-type variables. With size and shape requirements through linear constraints, the site layout design can be formulated as a binary mixed integer-linear programming (BMILP) problem to allocate different facilities onto different site available areas in optimal shapes and locations. Total material transportation costs across facilities are optimized subject to various design constraints ensuring safety, homogenous facility setups, physical size, and orientation requirements. The proposed cell model is verified by comparing optimization results with results obtained by conventional point notation methods. A standard branch-and-bound algorithm is applied to solve a global optimal solution, and the numerical example is optimized for illustrating the very different optimized layout plan in terms of facility locations, positions of entry and exit points, shapes, and orientations of different facilities.
KW - Binary mixed integer-linear programming problem
KW - Discretized cell modeling
KW - Facility layout planning
KW - Project planning and design
KW - Site layout optimization
UR - http://www.scopus.com/inward/record.url?scp=85009145032&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-85009145032&origin=recordpage
U2 - 10.1061/(ASCE)CO.1943-7862.0001206
DO - 10.1061/(ASCE)CO.1943-7862.0001206
M3 - RGC 21 - Publication in refereed journal
SN - 0733-9364
VL - 143
JO - Journal of Construction Engineering and Management
JF - Journal of Construction Engineering and Management
IS - 1
M1 - 4016082
ER -