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

被引:40
|
作者
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
相关论文
共 50 条
  • [1] Solving Dynamic Double-row Layout Problem via an Improved Simulated Annealing Algorithm
    Wang, Shengli
    Zuo, Xingquan
    Zhao, Xinchao
    [J]. 2014 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2014, : 1299 - 1304
  • [2] Hybridizing tabu search with mathematical programming for solving a single row layout problem
    Yu, Meng
    Zuo, Xingquan
    Zhao, Xinchao
    Wang, Chunlu
    [J]. 2018 IEEE 14TH INTERNATIONAL CONFERENCE ON AUTOMATION SCIENCE AND ENGINEERING (CASE), 2018, : 974 - 980
  • [3] A HYBRID METHODOLOGY BASED ON DYNAMIC PROGRAMMING AND SIMULATED ANNEALING FOR SOLVING AN INTEGRATED CELL FORMATION AND LAYOUT PROBLEM
    Mohammadi, Mohammad
    Forghani, Kamran
    [J]. ECONOMIC COMPUTATION AND ECONOMIC CYBERNETICS STUDIES AND RESEARCH, 2016, 50 (02): : 263 - 280
  • [4] Combining ant colony optimization and dynamic programming for solving a dynamic facility layout problem
    Udomsakdigool, A.
    Bangsaranthip, S.
    [J]. World Academy of Science, Engineering and Technology, 2010, 64 : 523 - 527
  • [5] A simulated annealing algorithm for dynamic layout problem
    Baykasoglu, A
    Gindy, NNZ
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2001, 28 (14) : 1403 - 1426
  • [6] Combining evolutionary computation and dynamic programming for solving a dynamic facility layout problem -: Discrete optimization
    Dunker, T
    Radons, G
    Westkämper, E
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 165 (01) : 55 - 69
  • [7] Solving an Extended Double Row Layout Problem Using Multiobjective Tabu Search and Linear Programming
    Zuo, Xingquan
    Murray, Chase C.
    Smith, Alice E.
    [J]. IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 2014, 11 (04) : 1122 - 1132
  • [8] Mathematical modeling and simulated annealing algorithm for spatial layout problem
    Jiang, Liupeng
    Ji, Jie
    Lu, Yuhua
    Chen, Yanan
    Jia, Yue
    [J]. CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2019, 22 (Suppl 3): : S6383 - S6391
  • [9] Simulated annealing heuristics for the dynamic facility layout problem
    McKendall, AR
    Shang, J
    Kuppusamy, S
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (08) : 2431 - 2444
  • [10] A SIMULATED ANNEALING HEURISTIC FOR THE DYNAMIC FACILITY LAYOUT PROBLEM
    Sahin, Ramazan
    [J]. JOURNAL OF THE FACULTY OF ENGINEERING AND ARCHITECTURE OF GAZI UNIVERSITY, 2008, 23 (04): : 863 - 870