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 , Jifeng Xu , Xiaoling Huang , Xiangqi Liu , Liang Huang , 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.
期刊介绍:
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.