动态柔性作业车间问题的变窗口多区间重调度优化算法

IF 7.2 1区计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE

Applied Soft Computing Pub Date : 2025-04-21 DOI:10.1016/j.asoc.2025.113157

Zeyin Guo , Lixin Wei , Xin Li , Shengxiang Yang , Jinlu Zhang

{"title":"动态柔性作业车间问题的变窗口多区间重调度优化算法","authors":"Zeyin Guo , Lixin Wei , Xin Li , Shengxiang Yang , Jinlu Zhang","doi":"10.1016/j.asoc.2025.113157","DOIUrl":null,"url":null,"abstract":"<div><div>The dynamic flexible workshop scheduling problem (DFJSP) requires the generation of new scheduling plans after being subjected to dynamic disturbances. Due to the reconfigurability of chromosomal gene, scheduling schemes have a large search space, which poses challenges for solving scheduling schemes. Therefore, a variable window multi-interval optimization (VWMI) rescheduling algorithm is proposed to solve the DFJSP. A nonlinear adaptive crossover probability and mutation probability function is proposed to address the issue of combinatorial optimization easily getting stuck in local optima. Based on the mapping relationship between individual space and objective space, a spatial joint selection method is proposed to select diverse individuals. Compared with other algorithms in dynamic workshop test cases, the rescheduling strategy achieved 7 optimal performance values in 15 test cases, with a maximum time efficiency improvement of 30.2%. In addition, the VWMI achieved 11 good performances in test cases, outperforming other optimization methods.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"176 ","pages":"Article 113157"},"PeriodicalIF":7.2000,"publicationDate":"2025-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A variable window multi-interval rescheduling optimization algorithm for dynamic flexible job shop problem\",\"authors\":\"Zeyin Guo , Lixin Wei , Xin Li , Shengxiang Yang , Jinlu Zhang\",\"doi\":\"10.1016/j.asoc.2025.113157\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>The dynamic flexible workshop scheduling problem (DFJSP) requires the generation of new scheduling plans after being subjected to dynamic disturbances. Due to the reconfigurability of chromosomal gene, scheduling schemes have a large search space, which poses challenges for solving scheduling schemes. Therefore, a variable window multi-interval optimization (VWMI) rescheduling algorithm is proposed to solve the DFJSP. A nonlinear adaptive crossover probability and mutation probability function is proposed to address the issue of combinatorial optimization easily getting stuck in local optima. Based on the mapping relationship between individual space and objective space, a spatial joint selection method is proposed to select diverse individuals. Compared with other algorithms in dynamic workshop test cases, the rescheduling strategy achieved 7 optimal performance values in 15 test cases, with a maximum time efficiency improvement of 30.2%. In addition, the VWMI achieved 11 good performances in test cases, outperforming other optimization methods.</div></div>\",\"PeriodicalId\":50737,\"journal\":{\"name\":\"Applied Soft Computing\",\"volume\":\"176 \",\"pages\":\"Article 113157\"},\"PeriodicalIF\":7.2000,\"publicationDate\":\"2025-04-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Applied Soft Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1568494625004685\",\"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":"Applied Soft Computing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1568494625004685","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}

引用次数: 0

摘要

动态柔性车间调度问题（DFJSP）需要在受到动态扰动后生成新的调度计划。由于染色体基因的可重构性，调度方案具有较大的搜索空间，这给调度方案的求解带来了挑战。为此，提出了一种可变窗口多区间优化（VWMI）重调度算法来解决DFJSP问题。针对组合优化容易陷入局部最优的问题，提出了一种非线性自适应交叉概率和突变概率函数。基于个体空间与目标空间的映射关系，提出了一种空间联合选择方法来选择不同个体。在动态车间测试用例中，与其他算法相比，重调度策略在15个测试用例中获得了7个最优性能值，时间效率最大提升30.2%。此外，VWMI在测试用例中获得了11个良好的性能，优于其他优化方法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A variable window multi-interval rescheduling optimization algorithm for dynamic flexible job shop problem

The dynamic flexible workshop scheduling problem (DFJSP) requires the generation of new scheduling plans after being subjected to dynamic disturbances. Due to the reconfigurability of chromosomal gene, scheduling schemes have a large search space, which poses challenges for solving scheduling schemes. Therefore, a variable window multi-interval optimization (VWMI) rescheduling algorithm is proposed to solve the DFJSP. A nonlinear adaptive crossover probability and mutation probability function is proposed to address the issue of combinatorial optimization easily getting stuck in local optima. Based on the mapping relationship between individual space and objective space, a spatial joint selection method is proposed to select diverse individuals. Compared with other algorithms in dynamic workshop test cases, the rescheduling strategy achieved 7 optimal performance values in 15 test cases, with a maximum time efficiency improvement of 30.2%. In addition, the VWMI achieved 11 good performances in test cases, outperforming other optimization methods.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Applied Soft Computing 工程技术-计算机：跨学科应用

CiteScore

15.80

自引率

6.90%

发文量

874

审稿时长

10.9 months

期刊介绍： Applied Soft Computing is an international journal promoting an integrated view of soft computing to solve real life problems.The focus is to publish the highest quality research in application and convergence of the areas of Fuzzy Logic, Neural Networks, Evolutionary Computing, Rough Sets and other similar techniques to address real world complexities. Applied Soft Computing is a rolling publication: articles are published as soon as the editor-in-chief has accepted them. Therefore, the web site will continuously be updated with new articles and the publication time will be short.