Solving dynamic double row layout problem via combining simulated annealing and mathematical programming

被引:45
作者
Wang, Shengli [1 ,2 ]
Zuo, Xingquan [1 ,2 ]
Liu, Xueqing [1 ,2 ]
Zhao, Xinchao [3 ]
Li, Jianqiang [4 ]
机构
[1] Beijing Univ Posts & Telecommun, Sch Comp Sci, Beijing 100088, Peoples R China
[2] Minist Educ, Key Lab Trustworthy Distributed Comp & Serv BUPT, Beijing, Peoples R China
[3] Beijing Univ Posts & Telecommun, Sch Sci, Beijing 100088, Peoples R China
[4] Beijing Univ Technol, Sch Software Engn, Beijing, Peoples R China
基金
中国国家自然科学基金;
关键词
Double row layout problem; Dynamic layout problem; Simulated annealing algorithm; Mathematical programming; FACILITY LAYOUT; SINGLE-ROW; GENETIC ALGORITHM; PLANT LAYOUT; TABU SEARCH; OPTIMIZATION; EVOLUTIONARY; SYSTEMS; DESIGN;
D O I
10.1016/j.asoc.2015.08.023
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Double row layout problem (DRLP) is to allocate facilities on two rows separated by a straight aisle. Aiming at the dynamic environment of product processing in practice, we propose a dynamic double-row layout problem (DDRLP) where material flows change over time in different processing periods. A mixed-integer programming model is established for this problem. A methodology combining an improved simulated annealing (ISA) with mathematical programming (MP) is proposed to resolve it. Firstly, a mixed coding scheme is designed to represent both of sequence of facilities and their exact locations. Secondly, an improved simulated annealing algorithm is suggested to produce a solution to DDRLP. Finally, MP is used to improve this solution by determining the optimal exact location for each facility. Experiments show that this methodology is able to obtain the optimal solutions for small size problems and outperforms an exact approach (CPLEX) for problems of realistic size. (C) 2015 Elsevier B.V. All rights reserved.
引用
收藏
页码:303 / 310
页数:8
相关论文
共 41 条
[1]   An exact approach to the one-dimensional facility layout problem [J].
Amaral, Andre R. S. .
OPERATIONS RESEARCH, 2008, 56 (04) :1026-1033
[2]   A parallel ordering problem in facilities layout [J].
Amaral, Andre R. S. .
COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (12) :2930-2939
[3]   Optimal solutions for the double row layout problem [J].
Amaral, Andre R. S. .
OPTIMIZATION LETTERS, 2013, 7 (02) :407-413
[4]   The corridor allocation problem [J].
Amaral, Andre R. S. .
COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (12) :3325-3330
[5]   A new lower bound for the single row facility layout problem [J].
Amaral, Andre R. S. .
DISCRETE APPLIED MATHEMATICS, 2009, 157 (01) :183-190
[6]   On the exact solution of a facility layout problem [J].
Amaral, ARS .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 173 (02) :508-518
[7]   Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes [J].
Anjos, Miguel F. ;
Vannelli, Anthony .
INFORMS JOURNAL ON COMPUTING, 2008, 20 (04) :611-617
[8]  
Anjos MF, 2012, INT SER OPER RES MAN, V166, P849, DOI 10.1007/978-1-4614-0769-0_29
[9]   An ant colony algorithm for solving budget constrained and unconstrained dynamic facility layout problems [J].
Baykasoglu, A ;
Dereli, T ;
Sabuncu, I .
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2006, 34 (04) :385-396
[10]   A simulated annealing algorithm for dynamic layout problem [J].
Baykasoglu, A ;
Gindy, NNZ .
COMPUTERS & OPERATIONS RESEARCH, 2001, 28 (14) :1403-1426