可重构柔性作业车间生产与运输同步调度的轻量级双层优化算法

IF 8.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Lixin Cheng , Qiuhua Tang , Zikai Zhang , Jing Wang
{"title":"可重构柔性作业车间生产与运输同步调度的轻量级双层优化算法","authors":"Lixin Cheng ,&nbsp;Qiuhua Tang ,&nbsp;Zikai Zhang ,&nbsp;Jing Wang","doi":"10.1016/j.swevo.2025.102080","DOIUrl":null,"url":null,"abstract":"<div><div>In reconfigurable flexible job shops, jobs have flexible processing routes and machine configurations change dynamically. This makes the transportation scheduling of Work-in-Progress (WIP) between machines highly complex and crucial to the production process. Coordinating production and transportation can significantly boost workshop efficiency. Thus, the synchronization of production and transportation scheduling is addressed. A bi-level scheduling model is developed. The upper-level minimizes production costs in production scheduling, considering flexibility and reconfigurability. The lower-level minimizes transportation costs in transportation scheduling, considering speed-adjustable Automated Guided Vehicles (AGVs). To solve this complex problem efficiently, a lightweight bi-level optimization algorithm is designed. In it, an accurate surrogate model and an improved metaheuristic are performed sequentially to achieve the lightweight evaluation and high-fidelity evaluation of the lower-level optima. Ten rules that contain problem-related knowledge are discovered by rule mining technologies including gene expression programming and Q-learning. Since these rules can better reflect problem characteristics, rule-based features are extracted to improve the accuracy of the surrogate model. Experimental results show that all discovered rules, especially the dynamic adaptive rule, are highly effective in generating high-performance solutions. The rule-based surrogate model can quickly and accurately estimate the lower-level optima. By incorporating this surrogate model, the proposed lightweight algorithm cuts down on computing budget without sacrificing accuracy, outperforming other bi-level optimization algorithms.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"98 ","pages":"Article 102080"},"PeriodicalIF":8.2000,"publicationDate":"2025-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Lightweight bi-level optimization algorithm for synchronized scheduling of production and transportation in a reconfigurable flexible job shop\",\"authors\":\"Lixin Cheng ,&nbsp;Qiuhua Tang ,&nbsp;Zikai Zhang ,&nbsp;Jing Wang\",\"doi\":\"10.1016/j.swevo.2025.102080\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>In reconfigurable flexible job shops, jobs have flexible processing routes and machine configurations change dynamically. This makes the transportation scheduling of Work-in-Progress (WIP) between machines highly complex and crucial to the production process. Coordinating production and transportation can significantly boost workshop efficiency. Thus, the synchronization of production and transportation scheduling is addressed. A bi-level scheduling model is developed. The upper-level minimizes production costs in production scheduling, considering flexibility and reconfigurability. The lower-level minimizes transportation costs in transportation scheduling, considering speed-adjustable Automated Guided Vehicles (AGVs). To solve this complex problem efficiently, a lightweight bi-level optimization algorithm is designed. In it, an accurate surrogate model and an improved metaheuristic are performed sequentially to achieve the lightweight evaluation and high-fidelity evaluation of the lower-level optima. Ten rules that contain problem-related knowledge are discovered by rule mining technologies including gene expression programming and Q-learning. Since these rules can better reflect problem characteristics, rule-based features are extracted to improve the accuracy of the surrogate model. Experimental results show that all discovered rules, especially the dynamic adaptive rule, are highly effective in generating high-performance solutions. The rule-based surrogate model can quickly and accurately estimate the lower-level optima. By incorporating this surrogate model, the proposed lightweight algorithm cuts down on computing budget without sacrificing accuracy, outperforming other bi-level optimization algorithms.</div></div>\",\"PeriodicalId\":48682,\"journal\":{\"name\":\"Swarm and Evolutionary Computation\",\"volume\":\"98 \",\"pages\":\"Article 102080\"},\"PeriodicalIF\":8.2000,\"publicationDate\":\"2025-07-17\",\"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/S221065022500238X\",\"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/S221065022500238X","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

在可重构柔性作业车间中,作业具有灵活的加工路线和动态变化的机器配置。这使得机器之间的在制品(WIP)运输调度非常复杂,对生产过程至关重要。协调生产和运输可以显著提高车间效率。从而解决了生产和运输调度的同步问题。建立了一个双层调度模型。上层在生产调度中考虑灵活性和可重构性,最大限度地降低生产成本。考虑速度可调的自动导引车辆(agv),低层次的运输调度使运输成本最小化。为了有效地解决这一复杂问题,设计了一种轻量级的双层优化算法。该算法通过建立精确的代理模型和改进的元启发式算法,实现了对低级优化方案的轻量化评价和高保真度评价。利用基因表达式编程和Q-learning等规则挖掘技术,发现了10条包含问题相关知识的规则。由于这些规则可以更好地反映问题特征,因此提取基于规则的特征以提高代理模型的准确性。实验结果表明,所发现的规则,特别是动态自适应规则,能够有效地生成高性能的解。基于规则的代理模型可以快速准确地估计低级最优。通过结合该代理模型,所提出的轻量级算法在不牺牲精度的情况下减少了计算预算,优于其他双级优化算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Lightweight bi-level optimization algorithm for synchronized scheduling of production and transportation in a reconfigurable flexible job shop
In reconfigurable flexible job shops, jobs have flexible processing routes and machine configurations change dynamically. This makes the transportation scheduling of Work-in-Progress (WIP) between machines highly complex and crucial to the production process. Coordinating production and transportation can significantly boost workshop efficiency. Thus, the synchronization of production and transportation scheduling is addressed. A bi-level scheduling model is developed. The upper-level minimizes production costs in production scheduling, considering flexibility and reconfigurability. The lower-level minimizes transportation costs in transportation scheduling, considering speed-adjustable Automated Guided Vehicles (AGVs). To solve this complex problem efficiently, a lightweight bi-level optimization algorithm is designed. In it, an accurate surrogate model and an improved metaheuristic are performed sequentially to achieve the lightweight evaluation and high-fidelity evaluation of the lower-level optima. Ten rules that contain problem-related knowledge are discovered by rule mining technologies including gene expression programming and Q-learning. Since these rules can better reflect problem characteristics, rule-based features are extracted to improve the accuracy of the surrogate model. Experimental results show that all discovered rules, especially the dynamic adaptive rule, are highly effective in generating high-performance solutions. The rule-based surrogate model can quickly and accurately estimate the lower-level optima. By incorporating this surrogate model, the proposed lightweight algorithm cuts down on computing budget without sacrificing accuracy, outperforming other bi-level optimization 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学术官方微信