多任务协同优化的动态柔性作业车间调度算法

IF 8.5 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Zeyin Guo , Lixin Wei , Xin Li , Rui Fan
{"title":"多任务协同优化的动态柔性作业车间调度算法","authors":"Zeyin Guo ,&nbsp;Lixin Wei ,&nbsp;Xin Li ,&nbsp;Rui Fan","doi":"10.1016/j.swevo.2025.102114","DOIUrl":null,"url":null,"abstract":"<div><div>Due to customer demand or market changes, production orders in intelligent manufacturing workshops become uncertain. Based on the above issues, an order detection framework is constructed to detect different types of order changes. Different dynamic response mechanisms are designed for different types of order changes. The scheduling of jobs in discrete manufacturing has composability, resulting in a huge search space. Previous research methods that used a single population to solve scheduling schemes could not fully explore the search space. Considering the characteristics of multitasking in job shop scheduling, this study designs an auxiliary task collaborative optimization algorithm (ATCOA) to solve the optimal rescheduling schemes. To escape from the situation of optimizing local optima in the main task, a knowledge transfer probability model based on the main task is adopted to determine population communication between tasks. A multitask knowledge transfer strategy is proposed for exchanging individual information between tasks to improve the diversity distribution ability of optimization algorithm. To evaluate the effectiveness of the ATCOA algorithm, it is compared with other algorithms on the constructed dynamic order test cases. In the case of order cancellation and insertion, ATCOA obtained 10 minimum inverted generation distance and maximum spread metric values and 9 hypervolume values, respectively. ATCOA has improved completion efficiency by 8.9% compared to scheduling rules. In engineering simulation cases, the ATCOA algorithm improved workload deviation by 41.9% compared to other algorithms. The experimental results show that the ATCOA algorithm is more efficient and stable than other algorithms.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"98 ","pages":"Article 102114"},"PeriodicalIF":8.5000,"publicationDate":"2025-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Dynamic flexible job shop scheduling algorithm for multi-task collaborative optimization\",\"authors\":\"Zeyin Guo ,&nbsp;Lixin Wei ,&nbsp;Xin Li ,&nbsp;Rui Fan\",\"doi\":\"10.1016/j.swevo.2025.102114\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Due to customer demand or market changes, production orders in intelligent manufacturing workshops become uncertain. Based on the above issues, an order detection framework is constructed to detect different types of order changes. Different dynamic response mechanisms are designed for different types of order changes. The scheduling of jobs in discrete manufacturing has composability, resulting in a huge search space. Previous research methods that used a single population to solve scheduling schemes could not fully explore the search space. Considering the characteristics of multitasking in job shop scheduling, this study designs an auxiliary task collaborative optimization algorithm (ATCOA) to solve the optimal rescheduling schemes. To escape from the situation of optimizing local optima in the main task, a knowledge transfer probability model based on the main task is adopted to determine population communication between tasks. A multitask knowledge transfer strategy is proposed for exchanging individual information between tasks to improve the diversity distribution ability of optimization algorithm. To evaluate the effectiveness of the ATCOA algorithm, it is compared with other algorithms on the constructed dynamic order test cases. In the case of order cancellation and insertion, ATCOA obtained 10 minimum inverted generation distance and maximum spread metric values and 9 hypervolume values, respectively. ATCOA has improved completion efficiency by 8.9% compared to scheduling rules. In engineering simulation cases, the ATCOA algorithm improved workload deviation by 41.9% compared to other algorithms. The experimental results show that the ATCOA algorithm is more efficient and stable than other algorithms.</div></div>\",\"PeriodicalId\":48682,\"journal\":{\"name\":\"Swarm and Evolutionary Computation\",\"volume\":\"98 \",\"pages\":\"Article 102114\"},\"PeriodicalIF\":8.5000,\"publicationDate\":\"2025-08-06\",\"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/S221065022500272X\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Swarm and Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S221065022500272X","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

由于客户需求或市场变化,智能制造车间的生产订单变得不确定。基于上述问题,构建了一个订单检测框架来检测不同类型的订单变化。针对不同类型的顺序变化,设计了不同的动态响应机制。离散制造作业调度具有可组合性,导致搜索空间巨大。以往的研究方法采用单种群求解调度方案,不能充分挖掘搜索空间。针对作业车间多任务调度的特点,设计了一种辅助任务协同优化算法(ATCOA)来求解最优重调度方案。为了避免在主任务中进行局部最优优化的情况,采用基于主任务的知识转移概率模型来确定任务间的种群通信。提出了一种多任务知识转移策略,在任务间交换个体信息,提高优化算法的多样性分布能力。为了评价ATCOA算法的有效性,在构造的动态顺序测试用例上与其他算法进行了比较。在订单取消和插入的情况下,ATCOA分别获得了10个最小反向发电距离和9个最大扩散度量值和9个超容积值。与调度规则相比,ATCOA的完井效率提高了8.9%。在工程仿真案例中,与其他算法相比,ATCOA算法的工作负载偏差提高了41.9%。实验结果表明,与其他算法相比,ATCOA算法具有更高的效率和稳定性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Dynamic flexible job shop scheduling algorithm for multi-task collaborative optimization
Due to customer demand or market changes, production orders in intelligent manufacturing workshops become uncertain. Based on the above issues, an order detection framework is constructed to detect different types of order changes. Different dynamic response mechanisms are designed for different types of order changes. The scheduling of jobs in discrete manufacturing has composability, resulting in a huge search space. Previous research methods that used a single population to solve scheduling schemes could not fully explore the search space. Considering the characteristics of multitasking in job shop scheduling, this study designs an auxiliary task collaborative optimization algorithm (ATCOA) to solve the optimal rescheduling schemes. To escape from the situation of optimizing local optima in the main task, a knowledge transfer probability model based on the main task is adopted to determine population communication between tasks. A multitask knowledge transfer strategy is proposed for exchanging individual information between tasks to improve the diversity distribution ability of optimization algorithm. To evaluate the effectiveness of the ATCOA algorithm, it is compared with other algorithms on the constructed dynamic order test cases. In the case of order cancellation and insertion, ATCOA obtained 10 minimum inverted generation distance and maximum spread metric values and 9 hypervolume values, respectively. ATCOA has improved completion efficiency by 8.9% compared to scheduling rules. In engineering simulation cases, the ATCOA algorithm improved workload deviation by 41.9% compared to other algorithms. The experimental results show that the ATCOA algorithm is more efficient and stable than other algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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学术文献互助群
群 号:604180095
Book学术官方微信