Value-Based Reinforcement Learning for Selective Disassembly Sequence Optimization Problems: Demonstrating and Comparing a Proposed Model

Shujin Qin, Zhiliang Bi, Jiacun Wang, Shixin Liu, Xiwang Guo, Ziyan Zhao, Liang Qi
{"title":"Value-Based Reinforcement Learning for Selective Disassembly Sequence Optimization Problems: Demonstrating and Comparing a Proposed Model","authors":"Shujin Qin, Zhiliang Bi, Jiacun Wang, Shixin Liu, Xiwang Guo, Ziyan Zhao, Liang Qi","doi":"10.1109/MSMC.2023.3303615","DOIUrl":null,"url":null,"abstract":"Selective optimal disassembly sequencing (SODS) is a methodology for the disassembly of waste products. Mathematically, it is an optimization problem. However, in the existing research, the connection between the optimization algorithms and the established model is limited to some specific processes, and their generality is poor. Due to the unique characteristics of each disassembly product, most disassembly sequences require modification and even reconstruction of the mathematical model. In this article, reinforcement learning (RL) is used to produce a single-item selective disassembly sequence based on the AND/OR graph. First, the AND/OR graph is mapped to a value matrix and represents the precedence relationship between the component and the values of the component itself. Second, on the basis of the established mathematical model and graph, value-based RL is used to solve the selective disassembly sequencing problem. Finally, the experimental results of the genetic algorithm (GA), Sarsa, Deep Q-learning (DQN), and CPLEX are compared to verify the correctness of the proposed model and the effectiveness of the RL algorithm.","PeriodicalId":516814,"journal":{"name":"IEEE Systems, Man, and Cybernetics Magazine","volume":"311 22","pages":"24-31"},"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.3303615","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Selective optimal disassembly sequencing (SODS) is a methodology for the disassembly of waste products. Mathematically, it is an optimization problem. However, in the existing research, the connection between the optimization algorithms and the established model is limited to some specific processes, and their generality is poor. Due to the unique characteristics of each disassembly product, most disassembly sequences require modification and even reconstruction of the mathematical model. In this article, reinforcement learning (RL) is used to produce a single-item selective disassembly sequence based on the AND/OR graph. First, the AND/OR graph is mapped to a value matrix and represents the precedence relationship between the component and the values of the component itself. Second, on the basis of the established mathematical model and graph, value-based RL is used to solve the selective disassembly sequencing problem. Finally, the experimental results of the genetic algorithm (GA), Sarsa, Deep Q-learning (DQN), and CPLEX are compared to verify the correctness of the proposed model and the effectiveness of the RL algorithm.
针对选择性拆卸序列优化问题的基于价值的强化学习:演示和比较一个拟议模型
选择性优化拆解排序(SODS)是一种拆解废品的方法。从数学上讲,这是一个优化问题。然而,在现有的研究中,优化算法与既定模型之间的联系仅限于一些特定过程,通用性较差。由于每个拆卸产品的特殊性,大多数拆卸顺序都需要修改甚至重建数学模型。本文采用强化学习(RL)方法,基于 AND/OR 图生成单项选择性拆卸序列。首先,AND/OR 图被映射到一个值矩阵,并表示组件与组件本身的值之间的优先级关系。其次,在已建立的数学模型和图的基础上,使用基于值的 RL 来解决选择性拆卸排序问题。最后,比较了遗传算法(GA)、Sarsa、深度 Q-learning(DQN)和 CPLEX 的实验结果,以验证所提模型的正确性和 RL 算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信