Remanufacturing scheduling under uncertainty considering remanufacturability assessment with adaptive hybrid optimization algorithm

IF 8.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Qinyu Jin , Jifeng Xu , Xiaoling Huang , Xiangqi Liu , Liang Huang , Kang Jiang
{"title":"Remanufacturing scheduling under uncertainty considering remanufacturability assessment with adaptive hybrid optimization algorithm","authors":"Qinyu Jin ,&nbsp;Jifeng Xu ,&nbsp;Xiaoling Huang ,&nbsp;Xiangqi Liu ,&nbsp;Liang Huang ,&nbsp;Kang Jiang","doi":"10.1016/j.swevo.2025.101990","DOIUrl":null,"url":null,"abstract":"<div><div>Remanufacturing enables the values contained in end-of-life products to be developed and utilized to the maximum extent, which is greatly significant to economic and social development. The remanufacturing process is characterized by uncertainties such as the quality of end-of-life products and the required remanufacturing time. Some studies have focused on remanufacturing scheduling under uncertainty. However, these studies ignored the direct effects of uncertainties on the assessment of remanufacturability and the selection of remanufacturing lines. Therefore, this study proposed a new decision tree-based remanufacturing scheduling model under uncertainty considering remanufacturability assessment, which constructs decision trees and combines fuzzy numbers to assess remanufacturability and select appropriate remanufacturing lines. Experiments have shown that the proposed model increases the total profits by approximately 2.8 %. To solve this model effectively, an adaptive hybrid optimization algorithm is proposed, with a new solution representation scheme, an adaptive adjustment function and a new population updating strategy. Simulated comparison experiments with other baseline algorithms and a real case study demonstrate that, the proposed algorithm has better performance in solution exploration and has superior stability in solving the remanufacturing scheduling model proposed in this study. Specifically, for improving the efficiency of remanufacturing, the proposed algorithm performs 0.5 % better than the differential evolutionary algorithm, 3.3 % better than the teaching-learning-based optimization algorithm, 0.2 % better than the extended particle swarm optimization algorithm, 1.7 % better than the improved ant colony optimization algorithm, and 2.7 % better than the simulated annealing algorithm, approximately. Finally, a real case study demonstrates the superior performance of the proposed model and algorithm in real industrial applications.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"96 ","pages":"Article 101990"},"PeriodicalIF":8.2000,"publicationDate":"2025-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Swarm and Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2210650225001488","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Remanufacturing enables the values contained in end-of-life products to be developed and utilized to the maximum extent, which is greatly significant to economic and social development. The remanufacturing process is characterized by uncertainties such as the quality of end-of-life products and the required remanufacturing time. Some studies have focused on remanufacturing scheduling under uncertainty. However, these studies ignored the direct effects of uncertainties on the assessment of remanufacturability and the selection of remanufacturing lines. Therefore, this study proposed a new decision tree-based remanufacturing scheduling model under uncertainty considering remanufacturability assessment, which constructs decision trees and combines fuzzy numbers to assess remanufacturability and select appropriate remanufacturing lines. Experiments have shown that the proposed model increases the total profits by approximately 2.8 %. To solve this model effectively, an adaptive hybrid optimization algorithm is proposed, with a new solution representation scheme, an adaptive adjustment function and a new population updating strategy. Simulated comparison experiments with other baseline algorithms and a real case study demonstrate that, the proposed algorithm has better performance in solution exploration and has superior stability in solving the remanufacturing scheduling model proposed in this study. Specifically, for improving the efficiency of remanufacturing, the proposed algorithm performs 0.5 % better than the differential evolutionary algorithm, 3.3 % better than the teaching-learning-based optimization algorithm, 0.2 % better than the extended particle swarm optimization algorithm, 1.7 % better than the improved ant colony optimization algorithm, and 2.7 % better than the simulated annealing algorithm, approximately. Finally, a real case study demonstrates the superior performance of the proposed model and algorithm in real industrial applications.
考虑可再制造性评价的不确定再制造调度
再制造使报废产品所蕴含的价值得到最大限度的开发和利用,对经济社会发展具有重要意义。再制造过程的特点是不确定性,如报废产品的质量和所需的再制造时间。一些研究关注的是不确定条件下的再制造调度问题。然而,这些研究忽略了不确定性对再制造性评估和再制造线选择的直接影响。为此,本文提出了一种考虑可再制造性评价的不确定条件下基于决策树的再制造调度模型,通过构建决策树并结合模糊数对可再制造性进行评价,选择合适的再制造线。实验表明,该模型可使总利润提高约2.8%。为了有效地求解该模型,提出了一种自适应混合优化算法,该算法具有新的解表示格式、自适应调整函数和新的种群更新策略。与其他基准算法的仿真对比实验和实际案例研究表明,本文算法在求解本研究提出的再制造调度模型时具有更好的求解性能和稳定性。具体而言,在提高再制造效率方面,该算法比差分进化算法提高了0.5%,比基于教学的优化算法提高了3.3%,比扩展粒子群优化算法提高了0.2%,比改进蚁群优化算法提高了1.7%,比模拟退火算法提高了2.7%。最后,通过实际案例分析,证明了该模型和算法在实际工业应用中的优越性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Swarm and Evolutionary Computation
Swarm and Evolutionary Computation COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCEC-COMPUTER SCIENCE, THEORY & METHODS
CiteScore
16.00
自引率
12.00%
发文量
169
期刊介绍: Swarm and Evolutionary Computation is a pioneering peer-reviewed journal focused on the latest research and advancements in nature-inspired intelligent computation using swarm and evolutionary algorithms. It covers theoretical, experimental, and practical aspects of these paradigms and their hybrids, promoting interdisciplinary research. The journal prioritizes the publication of high-quality, original articles that push the boundaries of evolutionary computation and swarm intelligence. Additionally, it welcomes survey papers on current topics and novel applications. Topics of interest include but are not limited to: Genetic Algorithms, and Genetic Programming, Evolution Strategies, and Evolutionary Programming, Differential Evolution, Artificial Immune Systems, Particle Swarms, Ant Colony, Bacterial Foraging, Artificial Bees, Fireflies Algorithm, Harmony Search, Artificial Life, Digital Organisms, Estimation of Distribution Algorithms, Stochastic Diffusion Search, Quantum Computing, Nano Computing, Membrane Computing, Human-centric Computing, Hybridization of Algorithms, Memetic Computing, Autonomic Computing, Self-organizing systems, Combinatorial, Discrete, Binary, Constrained, Multi-objective, Multi-modal, Dynamic, and Large-scale Optimization.
×
引用
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学术官方微信