A set of novel Mixed-Integer Linear Programming models for robotic disassembly sequence planning in sustainable remanufacturing

IF 14.2 1区 工程技术 Q1 ENGINEERING, INDUSTRIAL
Miguel Reula , Consuelo Parreño-Torres , F. Javier Ramírez
{"title":"A set of novel Mixed-Integer Linear Programming models for robotic disassembly sequence planning in sustainable remanufacturing","authors":"Miguel Reula ,&nbsp;Consuelo Parreño-Torres ,&nbsp;F. Javier Ramírez","doi":"10.1016/j.jmsy.2025.07.014","DOIUrl":null,"url":null,"abstract":"<div><div>Disassembly is a necessary and critical step in the remanufacturing process of end-of-life products. The goal is to support decision-making in the sequencing of robotic disassembly, the selection of appropriate tools and the final use of the disassembled components (reuse, remanufacturing, recycling or disposal). While this problem has been widely studied by researchers and practitioners worldwide, much of the focus has been on heuristic and metaheuristic approaches rather than on the development of mathematical models. This study proposes a set of novel Mixed Integer Linear Programming models that completely describes the problem and generalizes those already present in the literature. The optimal solution obtained by the models combines the optimal sequence planning and the most suitable recovery option for each component, achieving the maximum profit from the disassembly process. Moreover, the formulations can be easily adapted to solve different disassembly modes: complete, partial or selective, as well as other specific variants. Computational experiments based on two industrial gear pumps are carried out and, as will be shown, the results demonstrate that the mathematical models are able to reach optimal solutions for the complete disassembly sequence planning problem in a short computational time.</div></div>","PeriodicalId":16227,"journal":{"name":"Journal of Manufacturing Systems","volume":"82 ","pages":"Pages 1046-1068"},"PeriodicalIF":14.2000,"publicationDate":"2025-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Manufacturing Systems","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S027861252500189X","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, INDUSTRIAL","Score":null,"Total":0}
引用次数: 0

Abstract

Disassembly is a necessary and critical step in the remanufacturing process of end-of-life products. The goal is to support decision-making in the sequencing of robotic disassembly, the selection of appropriate tools and the final use of the disassembled components (reuse, remanufacturing, recycling or disposal). While this problem has been widely studied by researchers and practitioners worldwide, much of the focus has been on heuristic and metaheuristic approaches rather than on the development of mathematical models. This study proposes a set of novel Mixed Integer Linear Programming models that completely describes the problem and generalizes those already present in the literature. The optimal solution obtained by the models combines the optimal sequence planning and the most suitable recovery option for each component, achieving the maximum profit from the disassembly process. Moreover, the formulations can be easily adapted to solve different disassembly modes: complete, partial or selective, as well as other specific variants. Computational experiments based on two industrial gear pumps are carried out and, as will be shown, the results demonstrate that the mathematical models are able to reach optimal solutions for the complete disassembly sequence planning problem in a short computational time.
基于混合整数线性规划的可持续再制造机器人拆卸序列规划
拆卸是报废产品再制造过程中必不可少的关键步骤。目标是支持机器人拆卸顺序的决策,选择适当的工具和拆卸部件的最终使用(再利用,再制造,回收或处置)。虽然这个问题已经被世界各地的研究人员和实践者广泛研究,但大部分的焦点都集中在启发式和元启发式方法上,而不是数学模型的发展。本文提出了一套新颖的混合整数线性规划模型,该模型完整地描述了该问题,并推广了文献中已有的模型。模型得到的最优解结合了最优序列规划和各部件最合适的回收方案,实现了拆卸过程的最大收益。此外,该配方可以很容易地适应解决不同的拆卸模式:完全,部分或选择性,以及其他特定的变体。以两台工业齿轮泵为例进行了计算实验,结果表明,所建立的数学模型能够在较短的计算时间内得到完整拆卸顺序规划问题的最优解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Journal of Manufacturing Systems
Journal of Manufacturing Systems 工程技术-工程:工业
CiteScore
23.30
自引率
13.20%
发文量
216
审稿时长
25 days
期刊介绍: The Journal of Manufacturing Systems is dedicated to showcasing cutting-edge fundamental and applied research in manufacturing at the systems level. Encompassing products, equipment, people, information, control, and support functions, manufacturing systems play a pivotal role in the economical and competitive development, production, delivery, and total lifecycle of products, meeting market and societal needs. With a commitment to publishing archival scholarly literature, the journal strives to advance the state of the art in manufacturing systems and foster innovation in crafting efficient, robust, and sustainable manufacturing systems. The focus extends from equipment-level considerations to the broader scope of the extended enterprise. The Journal welcomes research addressing challenges across various scales, including nano, micro, and macro-scale manufacturing, and spanning diverse sectors such as aerospace, automotive, energy, and medical device manufacturing.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信