A large-scale hybrid simulated annealing algorithm for cyclic facility layout problems

被引:45
|
作者
Kulturel-Konak, Sadan [1 ]
Konak, Abdullah [2 ]
机构
[1] Penn State Berks, Management Informat Syst, Reading, PA 19610 USA
[2] Penn State Berks, Informat Sci & Technol, Reading, PA USA
关键词
dynamic facility layout problem; simulated annealing; cyclic facility layout problem; hybrid optimization; large-scale optimization; SEQUENCE-PAIR REPRESENTATION; BAY STRUCTURE REPRESENTATION; PARTICLE SWARM OPTIMIZATION; PLANT LAYOUT; TABU SEARCH; FLEXIBLE BAYS; DESIGN; MODEL; PERSPECTIVES; TREE;
D O I
10.1080/0305215X.2014.933825
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
The cyclic facility layout problem (CFLP) is a special case of the dynamic facility layout problem (DFLP) in which there are several production periods and the production cycle repeats itself by going to the first period after the last one because of the seasonal nature of products. In this article, a mixed integer programming formulation is developed for the CFLP. In the DFLP literature, department shapes are assumed to be given or fixed. However, this assumption does not hold in the case of the CFLP because the facility size is limited and the area requirements of the departments change significantly throughout the planning horizon. Therefore, department dimensions and sizes are considered as decision variables in the CFLP. A large-scale hybrid simulated annealing algorithm (LS-HSA) is proposed to solve the formulated problem and shown to be effective and versatile as it can be applied to various facility layout problems.
引用
收藏
页码:963 / 978
页数:16
相关论文
共 50 条