Multi-Objective Multi-Verse Optimizer for Multi-Product Partial U-Shaped Disassembly Line Balancing Problem

Shancheng Zhang, Laide Guo, Xiwang Guo, Shixin Liu, Liang Qi, Shujin Qin, Ying Tang, Ziyan Zhao
{"title":"Multi-Objective Multi-Verse Optimizer for Multi-Product Partial U-Shaped Disassembly Line Balancing Problem","authors":"Shancheng Zhang, Laide Guo, Xiwang Guo, Shixin Liu, Liang Qi, Shujin Qin, Ying Tang, Ziyan Zhao","doi":"10.1109/ICNSC52481.2021.9702256","DOIUrl":null,"url":null,"abstract":"The development of industry and technology promotes the acceleration of product replacement, and generate a large number of end-of-life products. Meanwhile, robots also play a significant role in disassembly. This paper proposes a scheme to solve a U-shaped disassembly line balancing problem with robots. A mathematical model for maximizing profits and minimizing carbon emissions is established. Then, the paper proposes an improved Multi-Objective Multi-Verse Optimizer (MOMVO) to solve the problem. Taking the disassembly of ballpoint pen and hammer drill as examples, our method is compared with Non-dominated Sorting Genetic Algorithm II (NSGA-II), Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D), and Multi-Objective Cellular Genetic Algorithm (MOCGA). Comparison indexes include Inverted Generational Distance+ (IGD+) and hypervolume epsilon metric. The experimental results show that the MOMVO algorithm performs better than others on the U-shaped and robotic disassembly line.","PeriodicalId":129062,"journal":{"name":"2021 IEEE International Conference on Networking, Sensing and Control (ICNSC)","volume":"122 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE International Conference on Networking, Sensing and Control (ICNSC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNSC52481.2021.9702256","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The development of industry and technology promotes the acceleration of product replacement, and generate a large number of end-of-life products. Meanwhile, robots also play a significant role in disassembly. This paper proposes a scheme to solve a U-shaped disassembly line balancing problem with robots. A mathematical model for maximizing profits and minimizing carbon emissions is established. Then, the paper proposes an improved Multi-Objective Multi-Verse Optimizer (MOMVO) to solve the problem. Taking the disassembly of ballpoint pen and hammer drill as examples, our method is compared with Non-dominated Sorting Genetic Algorithm II (NSGA-II), Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D), and Multi-Objective Cellular Genetic Algorithm (MOCGA). Comparison indexes include Inverted Generational Distance+ (IGD+) and hypervolume epsilon metric. The experimental results show that the MOMVO algorithm performs better than others on the U-shaped and robotic disassembly line.
多产品部分u型拆解线平衡问题的多目标多周期优化
工业和技术的发展促进了产品更新换代的加速,产生了大量的报废产品。同时,机器人在拆卸中也扮演着重要的角色。提出了一种用机器人解决u型拆解线平衡问题的方案。建立了利润最大化和碳排放最小化的数学模型。然后,本文提出了一种改进的多目标多宇宙优化器(MOMVO)来解决这个问题。以圆珠笔和冲击钻的拆卸为例,将该方法与非优势排序遗传算法II (NSGA-II)、基于分解的多目标进化算法(MOEA/D)和多目标细胞遗传算法(MOCGA)进行了比较。比较指标包括倒代距离+ (IGD+)和超容积epsilon度量。实验结果表明,MOMVO算法在u型线和机器人拆解线上的性能优于其他算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信