Improved wolf pack algorithm for multi-objective disassembly line balancing problem under space constraints

被引：0
|
作者：
Jiang J. [1 ,2 ]
Zhang Z. [1 ,2 ]
Xie M. [1 ,2 ]
Cai N. [1 ,2 ]
机构：
[1] School of Mechanical Engineering, Southwest Jiaotong University, Chengdu
[2] Technology and Equipment of Rail Transit Operation and Maintenance Key Laboratory of Sichuan Province, Chengdu
来源：
Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS | 2021年 / 27卷 / 06期
基金：
中国国家自然科学基金;
关键词：
Disassembly line balancing; Multi-objective optimization; Space constraints; Wolf pack algorithm;
D O I：
10.13196/j.cims.2021.06.004
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Considering the space area constraint of workstation during the actual disassembly process, a multi-objective optimization mathematical model under the space constraint was established including the number of workstations, the idle time equilibrium index, the disassembly cost and the actual working surface difference of the workstation posture four optimization goals. By discretizing the scouting behavior, calling behavior and besieging behavior, a discrete multi-objective improved Wolf pack algorithm was proposed to solve the problem, and the Pareto solution idea and NSGA-Ⅱ crowd distance mechanism were introduced to obtain solutions with high-quality and multi-faceted comprehensive. The effectiveness and superiority of the proposed algorithm were demonstrated by comparing the results of benchmark examples with different scales. The algorithm was used to solve the disassembly of a printer considering spatial constraints, and 10 feasible task allocation schemes were obtained, which showed the superiority of the model considering the space constraint and the proposed algorithm. © 2021, Editorial Department of CIMS. All right reserved.
引用
收藏
页码：1569 / 1581
页数：12
相关论文
共 31 条
  • [1] GUNGOR A, GUPTA S M., Disassembly line in product recovery, International Journal of Production Research, 40, 11, pp. 2569-2589, (2002)
  • [2] HEZER S, KARA Y., A network-based shortest route model for parallel disassembly line balancing problem, International Journal of Production Research, 53, 6, pp. 1849-1865, (2015)
  • [3] ALTEKIN F T, BAYiNDiR Z P, GUMUSKAYA V., Remedial actions for disassembly lines with stochastic task times, Computers & Industrial Engineering, 99, pp. 78-96, (2016)
  • [4] REN Yaping, YU Daoyuan, ZHANG Chaoyong, Et al., An improved gravitational search algorithm for profit-oriented partial disassembly line balancing problem, International Journal of Production Research, 55, 24, pp. 7302-7316, (2017)
  • [5] MCGOVERN S M, GUPTA S M., 2-opt heuristic for the disassembly line balancing problem, Proceedings of the SPIE International Conference on Environmentally Conscious Manufacturing Ⅲ, pp. 71-84, (2004)
  • [6] AVIKAL S, JAIN R, YADAV H C, Et al., A new heuristic for disassembly line balancing problems with AND/OR precedence relations, Proceedings of the 2nd International Conference on Soft Computing for Problem Solving, pp. 519-525, (2014)
  • [7] KOC A, SABUNCUOGLU I, EREL E., Two exact formulations for disassembly line balancing problems with task precedence diagram construction using an AND/OR graph, IIE Transactions, 41, 10, pp. 866-881, (2009)
  • [8] MCGOVERN S M, GUPTA S M., A balancing method and genetic algorithm for disassembly line balancing, European Journal of Operational Research, 179, 3, pp. 692-708, (2007)
  • [9] MCGOVERN S M, GUPTA S M., Ant colony optimization for disassembly sequencing with multiple objectives, International Journal of Advanced Manufacturing Technology, 30, 5, pp. 481-496, (2006)
  • [10] KALAYCI C B, HANCILAR A, GUNGOR A, Et al., Multi-objective fuzzy disassembly line balancing using a hybrid discrete artificial bee colony algorithm, Journal of Manufacturing Systems, 37, pp. 672-682, (2015)
1234