计算机集成制造系统 ›› 2023, Vol. 29 ›› Issue (12): 4073-4088.DOI: 10.13196/j.cims.2022.0203

• • 上一篇    下一篇

考虑可变时间的双边机器人拆卸线平衡问题建模与优化

脱阳1,2,张则强1,2+,张裕1,2,郑红斌1,2,梁巍1,2   

  1. 1.西南交通大学机械工程学院
    2.轨道交通运维技术与装备四川省重点实验室
  • 出版日期:2023-12-31 发布日期:2024-01-10
  • 基金资助:
    国家自然科学基金资助项目(52375268);教育部人文社会科学研究规划基金资助项目(23YJA630139);四川省科技计划资助(2022YFG0245,2022YFG0241)。

Modeling and optimization for two-sided robots disassembly line balancing problems considering variable time

TUO Yang1,2,ZHANG Zeqiang1,2+,ZHANG Yu1,2,ZHENG Hongbin1,2,LIANG Wei1,2   

  1. 1.School of Mechanical Engineering,Southwest Jiaotong University
    2.Sichuan Provincial Key Laboratory of Technology and Equipment of Rail Transit Operation and Maintenance
  • Online:2023-12-31 Published:2024-01-10
  • Supported by:
    Project supported by the National Natural Science Foundation,China(No.52375268),the Foundation for Humanities and Social Sciences of Ministry of Education,China(No.23YJA630139),and the Sichuan Provincial Science and Technology Program,China(No.2022YFG0245,2022YFG0241).

摘要: 针对现有双边拆卸线对可变化拆卸时间及机器人能耗问题研究的不足,将多型号机器人引入拆卸线,并结合双边拆卸线特点,建立最小化工作站数、负载均衡指标、危害指标和机器人能耗指标的多目标双边拆卸线平衡模型。该模型能够根据任务分配情况动态的适配不同型号机器人进行拆卸作业,减少拆卸时间,提高拆卸效率。提出一种改进樽海鞘群算法,加入了莱维飞行策略避免陷入局部最优,达到快速收敛效果;引入帕累托思想及拥挤距离机制对多目标求解结果进行筛选,以此保留较优解,通过与多种案例对比,验证了所提算法在双边拆卸线平衡问题中的可行性与高效性。最后,将所建模型运用于双边拆卸废旧汽车的实例计算,求解出多种优秀方案供决策者选择。

关键词: 双边拆卸线, 拆卸线平衡问题, 樽海鞘群算法, 帕累托思想

Abstract: In view of the deficiency of the existing two-sided disassembly line in the research on variable disassembly time and robot energy consumption,multi-type robots were introduced into the disassembly line.Combined with the characteristics of two-sided disassembly line,a multi-objective two-sided disassembly line balance model was established to minimize the number of workstations,load balance index,hazard index and robot energy consumption index.The model could dynamically adapt different types of robots for disassembly according to the task allocation,reduce the disassembly time and improve the disassembly efficiency.An improved salpswarm algorithm was proposed,which added Levy flight strategy to avoid falling into local optimization and achieve rapid convergence.The Pareto idea and crowding distance mechanism were introduced to screen the multi-objective solution results to retain the better solution.Compared with many cases,the feasibility and efficiency of the proposed algorithm in the two-sided disassembly line balance problem were verified.The model was applied to the example calculation of two-sided disassembly of waste vehicles,and a variety of excellent schemes were solved for decision-makers to choose.

Key words: two-sided disassembly, disassembly line balancing problem, salp swarm algorithm, Pareto idea

中图分类号: