›› 2021, Vol. 27 ›› Issue (6): 1569-1581.DOI: 10.13196/j.cims.2021.06.004

Previous Articles     Next Articles

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

  

  • Online:2021-06-30 Published:2021-06-30
  • Supported by:
    Project supported by the National Natural Science Foundation,China(No.51205328,51675450),the Youth Foundation for Humanities and Social Sciences of Ministry of Education,China(No.18YJC630255),and the Sichuan Provincial Science and Technology Program,China(No.2019YFG0285).

空间约束下多目标拆卸线平衡问题的改进狼群算法

蒋晋1,2,张则强1,2+,谢梦柯1,2,蔡宁1,2   

  1. 1.西南交通大学机械工程学院
    2.轨道交通运维技术与装备四川省重点实验室
  • 基金资助:
    国家自然科学基金资助项目(51205328,51675450);教育部人文社会科学研究青年基金资助项目(18YJC630255);四川省科学计划资助项目(2019YFG0285)。

Abstract: 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.

Key words: disassembly line balancing, space constraints, multi-objective optimization, wolf pack algorithm

摘要: 考虑实际拆卸过程中的工作站空间面积约束,以最小化工作站数目、空闲时间均衡指标、拆卸成本及工作站实际使用面积极差值为优化目标,建立空间约束下的多目标优化数学模型,提出一种离散多目标改进狼群算法求解。通过对游走行为、召唤行为和围攻行为进行离散化,引入Pareto解集思想及NSGA-Ⅱ拥挤距离机制,获得多个高质量、多方面综合的较优解。通过对不同规模基准算例的求解,对比说明所提算法的有效性和优越性。最后,将该算法用于求解考虑空间约束的某打印机拆卸实例中,得到10组可行的任务分配方案,表明考虑空间约束的模型和所提算法的可行性。

关键词: 拆卸线平衡, 空间约束, 多目标优化, 狼群算法

CLC Number: