Modeling and optimization of bi-objective corridor layout problem considering facility orientation

被引：0
|
作者：
Chen F. [1 ,2 ]
Zhang Z. [1 ,2 ]
Liu J. [1 ,2 ]
Wang S. [1 ,2 ]
机构：
[1] School of Mechanical Engineering, Southwest Jiaotong University, Chengdu
[2] Sichuan Provincial Key Laboratory of Technology and Equipment of Rail Transit Operation, Chengdu
来源：
Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS | 2022年 / 28卷 / 06期
基金：
中国国家自然科学基金;
关键词：
corridor layout problem; mixed integer nonlinear programming model; multi-objective optimization; Pareto dominance; scatter search algorithm;
D O I：
10.13196/j.cims.2022.06.011
中图分类号：
学科分类号：
摘要：
Aiming at the neglect of the impact of layout area on cost and the lack of consideration of the rectangular facility layout orientation in the currentcorridor allocation problem research, the minimum total material handling cost and layout area were taken as the objectives to propose a bi-objective corridor layout problem considering facility orientation, and a mixed integer nonlinear programming model was established. Due to the NP-hard property of the problem, a multi-objective improved scatter search algorithm based on Pareto dominance was proposed, which used double-layer coding to construct feasible solutions. On this basis, the double-layer crossover and mutation operators were designed. To deal with multi-objective results effectively, Pareto dominance idea and crowding distance mechanism were introduced. The bi-directional improved search structure of adaptive simulated annealing was embedded into the scatter search algorithm, and double thresholds were set to realize the adaptive improvement operation of the reference set and reduce the unnecessary iterative process. The effectiveness of the proposed algorithm was verified by comparing the results of 40 examples with LINGO mathematical programming software. The proposed algorithm was used to solve the bi-objective corridor layout problem, and the results proved the superiority of the proposed algorithm by comparing with those of related literatures. © 2022 CIMS. All rights reserved.
引用
收藏
页码：1717 / 1734
页数：17
相关论文
共 33 条
  • [1] DRIRA A, PIERREVAL H, HAJRI-GABOUJ S., Facility layout problems: A survey [J], Annual Reviews in Control, 31, 2, pp. 255-267, (2007)
  • [2] ANJOS M F, VIEIRA M V C., Mathematical optimization approaches for facility layout problems: The state-of-the-art and future research directions, European Journal of Operational Research, 261, 1, pp. 1-16, (2017)
  • [3] NING X, LI P., A cross-entropy approach to the single row facility layout problem[J], International Journal of Production Research, 56, 11-12, pp. 3781-3794, (2018)
  • [4] HONG D, SEO Y, XIAO Y J., A concurrent approach for facility layout and AMHS design in semiconductor manufactur-ing[J], International Journal of Industrial Engineering, 21, 4, pp. 231-242, (2014)
  • [5] HOSSEINI S, KHALED A A, VADLAMANI S., Hybrid imperialist competitive algorithm, variable neighborhood search, and simulated annealing for dynamic facility layout problem [J], Neural Computing and Applications, 25, 7-8, pp. 1871-1885, (2014)
  • [6] LIU S, ZHANG Z, GUAN C, Et al., An improved fireworks algorithm for the constrained single-row facility layout problem [J], International Journal of Production Research, 59, 8, pp. 2309-2327, (2020)
  • [7] AMARAL A R S., The corridor allocation problem, Computers &. Operations Research, 39, 12, pp. 3325-3330, (2012)
  • [8] LIN Q L, LIU H C, WANG D J, Et al., Integrating systematic layout planning with fuzzy constraint theory to design and optimize the facility layout for operating theatre in hospitals[J], Journal of Intelligent Manufacturing, 26, 1, pp. 87-95, (2015)
  • [9] IZADINIA N, ESHGHI K., A robust mathematical model and ACO solution for multi-floor discrete layout problem with uncertain locations and demands [J], Computers and Industrial Engineering, 96, C, pp. 237-248, (2016)
  • [10] GHOSH D, KOTHARI R., Populationheuristics for the corridor allocation problem, HMA Working Papers, 98, 2, pp. 33-40, (2012)
1234