Multiobjective Human–Robot Collaborative Disassembly Sequence Planning: Considering the Properties of Components

Shujin Qin, Chong Li, Jiacun Wang, Shixin Liu, Ziyan Zhao, Xiwang Guo, Liang Qi
{"title":"Multiobjective Human–Robot Collaborative Disassembly Sequence Planning: Considering the Properties of Components","authors":"Shujin Qin, Chong Li, Jiacun Wang, Shixin Liu, Ziyan Zhao, Xiwang Guo, Liang Qi","doi":"10.1109/MSMC.2023.3234172","DOIUrl":null,"url":null,"abstract":"With the improvement of modern human living standards, the speed of product renewal is accelerating, and the classification and recycling of waste products and the reuse of resources have received great attention from scholars and industry. The disassembly of used products plays an important role in the implementation of the work. Considering the difference between the component values of a product and the disassembling complexity of each component, this article studies human–robot collaborative disassembly and investigates multiobjective disassembly sequence planning (DSP). Mathematical models are established with the optimization goals of maximizing profit and minimizing working time. The well-known optimizer CPLEX is used to verify the correctness of the mathematical model, and the gray wolf optimization algorithm (GWOA) is adopted to find the optimal solution. By comparing it with non-dominated sorting genetic algorithm III (NSGAIII) and multi-objective evolutionary algorithms based on decomposition with a collaborative resource allocation strategy (MOEAD-CRA), the adaptability of the algorithm to the proposed mathematical model is proved.","PeriodicalId":516814,"journal":{"name":"IEEE Systems, Man, and Cybernetics Magazine","volume":"111 ","pages":"15-23"},"PeriodicalIF":0.0000,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Systems, Man, and Cybernetics Magazine","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MSMC.2023.3234172","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

With the improvement of modern human living standards, the speed of product renewal is accelerating, and the classification and recycling of waste products and the reuse of resources have received great attention from scholars and industry. The disassembly of used products plays an important role in the implementation of the work. Considering the difference between the component values of a product and the disassembling complexity of each component, this article studies human–robot collaborative disassembly and investigates multiobjective disassembly sequence planning (DSP). Mathematical models are established with the optimization goals of maximizing profit and minimizing working time. The well-known optimizer CPLEX is used to verify the correctness of the mathematical model, and the gray wolf optimization algorithm (GWOA) is adopted to find the optimal solution. By comparing it with non-dominated sorting genetic algorithm III (NSGAIII) and multi-objective evolutionary algorithms based on decomposition with a collaborative resource allocation strategy (MOEAD-CRA), the adaptability of the algorithm to the proposed mathematical model is proved.
多目标人机协作拆卸序列规划:考虑组件属性
随着现代人类生活水平的提高,产品更新换代的速度不断加快,废旧产品的分类回收和资源再利用受到了学者和业界的高度重视。废旧产品的拆解工作在实施过程中发挥着重要作用。考虑到产品组件价值的差异和各组件的拆卸复杂度,本文研究了人机协作拆卸,并探讨了多目标拆卸顺序规划(DSP)。本文以利润最大化和工作时间最小化为优化目标,建立了数学模型。使用著名的优化器 CPLEX 验证数学模型的正确性,并采用灰狼优化算法(GWOA)寻找最优解。通过与非支配排序遗传算法 III(NSGAIII)和基于协作资源分配策略分解的多目标进化算法(MOEAD-CRA)进行比较,证明了该算法对所提数学模型的适应性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信