求解单目标序列相关拆解线平衡问题的改进人工蜂群算法

Wenhong Luo, Mengchu Zhou, Xiwang Guo, Haiping Wei, Liang Qi, Ziyan Zhao
{"title":"求解单目标序列相关拆解线平衡问题的改进人工蜂群算法","authors":"Wenhong Luo, Mengchu Zhou, Xiwang Guo, Haiping Wei, Liang Qi, Ziyan Zhao","doi":"10.1109/ICNSC48988.2020.9238075","DOIUrl":null,"url":null,"abstract":"The circular economy follows the principle of reducing resource usage and energy consumption, reusing usable resources including subassemblies and components in discarded or used products, and recycling usable materials. It is guided by saving resources, improving the utilization rate of resources, reducing pollution, and protecting an ecological environment. Effective product disassembly planning methods can improve recovery efficiency and promote the circular economy. However, the existing studies pay little attention to sequential dependency disassembly, which makes it difficult to implement the existing planning methods under the constraints of limited disassembly methods and tools. In this paper, a single-objective sequence-dependent disassembly line balancing problem (SDLB) is studied. This problem requires that disassembly tasks are assigned to a group of orderly disassembly workstations to obtain the near optimal solution while meeting a disassembly priority constraint. Because solution complexity increases with the number of parts in a product, an improved artificial bee colony method (IABC) is proposed to solve the problem. Through experiments and compared with a genetic algorithm, the effectiveness of the proposed algorithm is verified.","PeriodicalId":412290,"journal":{"name":"2020 IEEE International Conference on Networking, Sensing and Control (ICNSC)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Improved Artificial Bee Colony Algorithm for Solving a Single-Objective Sequence-dependent Disassembly Line Balancing Problem\",\"authors\":\"Wenhong Luo, Mengchu Zhou, Xiwang Guo, Haiping Wei, Liang Qi, Ziyan Zhao\",\"doi\":\"10.1109/ICNSC48988.2020.9238075\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The circular economy follows the principle of reducing resource usage and energy consumption, reusing usable resources including subassemblies and components in discarded or used products, and recycling usable materials. It is guided by saving resources, improving the utilization rate of resources, reducing pollution, and protecting an ecological environment. Effective product disassembly planning methods can improve recovery efficiency and promote the circular economy. However, the existing studies pay little attention to sequential dependency disassembly, which makes it difficult to implement the existing planning methods under the constraints of limited disassembly methods and tools. In this paper, a single-objective sequence-dependent disassembly line balancing problem (SDLB) is studied. This problem requires that disassembly tasks are assigned to a group of orderly disassembly workstations to obtain the near optimal solution while meeting a disassembly priority constraint. Because solution complexity increases with the number of parts in a product, an improved artificial bee colony method (IABC) is proposed to solve the problem. Through experiments and compared with a genetic algorithm, the effectiveness of the proposed algorithm is verified.\",\"PeriodicalId\":412290,\"journal\":{\"name\":\"2020 IEEE International Conference on Networking, Sensing and Control (ICNSC)\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-10-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 IEEE International Conference on Networking, Sensing and Control (ICNSC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICNSC48988.2020.9238075\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE International Conference on Networking, Sensing and Control (ICNSC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNSC48988.2020.9238075","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

循环经济遵循的原则是减少资源使用和能源消耗,再利用废弃或使用过的产品中的可用资源,包括组件和部件,回收利用可用材料。它以节约资源、提高资源利用率、减少污染、保护生态环境为指导。有效的产品拆解规划方法可以提高回收效率,促进循环经济。然而,现有的研究很少关注顺序依赖关系的拆卸,这使得现有的规划方法在有限的拆卸方法和工具的约束下难以实现。研究了单目标序列相关拆解线平衡问题。该问题要求将拆卸任务分配给一组有序的拆卸工作站,以在满足拆卸优先级约束的情况下获得接近最优解。针对求解复杂度随产品零件数量的增加而增加的问题,提出了一种改进的人工蜂群法(IABC)。通过实验并与遗传算法进行比较,验证了该算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Improved Artificial Bee Colony Algorithm for Solving a Single-Objective Sequence-dependent Disassembly Line Balancing Problem
The circular economy follows the principle of reducing resource usage and energy consumption, reusing usable resources including subassemblies and components in discarded or used products, and recycling usable materials. It is guided by saving resources, improving the utilization rate of resources, reducing pollution, and protecting an ecological environment. Effective product disassembly planning methods can improve recovery efficiency and promote the circular economy. However, the existing studies pay little attention to sequential dependency disassembly, which makes it difficult to implement the existing planning methods under the constraints of limited disassembly methods and tools. In this paper, a single-objective sequence-dependent disassembly line balancing problem (SDLB) is studied. This problem requires that disassembly tasks are assigned to a group of orderly disassembly workstations to obtain the near optimal solution while meeting a disassembly priority constraint. Because solution complexity increases with the number of parts in a product, an improved artificial bee colony method (IABC) is proposed to solve the problem. Through experiments and compared with a genetic algorithm, the effectiveness of the proposed algorithm is verified.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
An Improved Deep Multiple-input and Single-output PointNet for 3D Model Retrieval A Reinforcement Learning Based Medium Access Control Method for LoRa Networks A Novel Reinforcement-Learning-Based Approach to Scientific Workflow Scheduling Accelerated Latent Factor Analysis for Recommender Systems via PID Controller A Diverse Biases Non-negative Latent Factorization of Tensors Model for Dynamic Network Link Prediction
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1