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

被引:46
作者
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
相关论文
共 37 条
[1]   A survey of very large-scale neighborhood search techniques [J].
Ahuja, RK ;
Ergun, Ö ;
Orlin, JB ;
Punnen, AP .
DISCRETE APPLIED MATHEMATICS, 2002, 123 (1-3) :75-102
[2]   A HEURISTIC ALGORITHM AND SIMULATION APPROACH TO RELATIVE LOCATION OF FACILITIES [J].
ARMOUR, GC ;
BUFFA, ES .
MANAGEMENT SCIENCE, 1963, 9 (02) :294-309
[3]   Dynamic layout algorithms: a state-of-the-art survey [J].
Balakrishnan, J ;
Cheng, CH .
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 1998, 26 (04) :507-521
[4]   An improved pair-wise exchange heuristic for the dynamic plant layout problem [J].
Balakrishnan, J ;
Cheng, CH ;
Conway, DG .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2000, 38 (13) :3067-3077
[5]   The dynamic plant layout problem: Incorporating rolling horizons and forecast uncertainty [J].
Balakrishnan, Jaydeep ;
Cheng, Chun Hung .
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2009, 37 (01) :165-177
[6]   A simulated annealing algorithm for dynamic layout problem [J].
Baykasoglu, A ;
Gindy, NNZ .
COMPUTERS & OPERATIONS RESEARCH, 2001, 28 (14) :1403-1426
[7]  
Donaghey C.E., 1990, SOLVING FACILITY LAY
[8]   Combining evolutionary computation and dynamic programming for solving a dynamic facility layout problem -: Discrete optimization [J].
Dunker, T ;
Radons, G ;
Westkämper, E .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 165 (01) :55-69
[9]   A multi-objective particle swarm optimisation algorithm for unequal sized dynamic facility layout problem with pickup/drop-off locations [J].
Jolai, Fariborz ;
Tavakkoli-Moghaddam, Reza ;
Taghipour, Mohammad .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2012, 50 (15) :4279-4293
[10]   Applying Ant System for solving Unequal Area Facility Layout Problems [J].
Komarudin ;
Wong, Kuan Yew .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 202 (03) :730-746