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 条
  • [11] AHONEN H, DE ALVARENGA A G, AMARAL A R S., Simulated annealing and tabu search approaches for thecorri-dor allocation problem, European Journal of Operational Research, 232, 1, pp. 221-233, (2014)
  • [12] LIU Silu, ZHANG Zeqiang, GUAN Chao, Et al., An improved fireworks algorithm for the corridor allocation problem with facility depth [J], Control and Decision, 35, pp. 45-54, (2020)
  • [13] ZHANG Z Q, MAO L L, GUAN C, Et al., An improved scatter search algorithm for the corridor allocation problem considering corridor width, Soft Computing, 24, 1, pp. 461-481, (2020)
  • [14] GUAN Chao, ZHANG Zeqiang, MAO Lili, Et al., Mixed integer programming model and heuristic method for double-layer corridor allocation problem, Computer Integrated Manufacturing Systems, 24, 8, pp. 1972-1982, (2018)
  • [15] GUAN C, ZHANG Z, LI Y., A flower pollination algorithm for the double-floor corridor allocation problem, International Journal of Production Research, 57, 20, pp. 6506-6527, (2019)
  • [16] WANG Shasha, ZHANG Zeqiang, LIU Junqi, Et al., Modeling of multipath interactive annular corridor allocation problem and optimization of improved ant-lion algorithm [J], Computer Integrated Manufacturing Systems, 27, 8, pp. 2237-2247, (2021)
  • [17] KALITA Z, DATTA D., Solving the bi-objective corridor allocation problem using a permutation-based genetic algorithm, Computers &. Operations Research, 52, pp. 123-134, (2014)
  • [18] KALITA Z, DATTA D, PALUBECKIS G., Bi-objective corridor allocation problem using a permutation-based genetic algorithm hybridized with a local search technique [J], Soft Computing, 23, 3, pp. 961-986, (2019)
  • [19] GUAN Chao, ZHANG Zeqiang, JIA Lin, Et al., Modeling and optimizing method for expanding bi-objective corridor allocation problem [J], Computer Integrated Manufacturing Systems, 25, 10, pp. 2513-2538, (2019)
  • [20] KALITA Z, DATTA D., Corridor allocation as a constrained optimization problem using a permutation-based multi-objective genetic algorithm, (2020)
1234