DQL-assisted competitive evolutionary algorithm for energy-aware robust flexible job shop scheduling under unexpected disruptions

IF 8.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Swarm and Evolutionary Computation Pub Date : 2024-10-25 DOI:10.1016/j.swevo.2024.101750
Shicun Zhao , Hong Zhou , Yujie Zhao , Da Wang
{"title":"DQL-assisted competitive evolutionary algorithm for energy-aware robust flexible job shop scheduling under unexpected disruptions","authors":"Shicun Zhao ,&nbsp;Hong Zhou ,&nbsp;Yujie Zhao ,&nbsp;Da Wang","doi":"10.1016/j.swevo.2024.101750","DOIUrl":null,"url":null,"abstract":"<div><div>Energy-aware scheduling has emerged as a well-defined research topic for achieving sustainable development. However, unexpected disruptions in workshop pose several challenges to the manufacturing process, causing the original schedules to become non-optimal or even infeasible, resulting in significant energy waste. Consequently, it is necessary to investigate the robust scheduling problem with energy-awareness. The energy-efficient robust flexible job shop scheduling problem (ERFJSP) aims to simultaneously optimize scheduling efficiency, total energy consumption, and robustness. A two-stage mixed-integer linear programming model considering machine breakdown and job insertion is formulated in this paper for the first time. To solve this problem, a double Q-learning (DQL)-assisted competitive evolutionary algorithm (DQCEA) is proposed. In DQCEA, a heuristic initialization strategy is first designed, which allows it to obtain high-quality and diverse solutions. Subsequently, a multi-objective competitive mechanism is proposed to classify search individuals into inferiors and superiors. Moreover, an inferior-pushing and superior-pulling-based crossover is designed for inferior members, facilitating knowledge transfer within the population and enhancing global diversification capability. Meanwhile, a hyper-mutation operator is devised for superior members, which incorporates eight search strategies to improve local intensification ability. Furthermore, DQL is employed to learn and recommend the most suitable strategy for each superior individual. Finally, extensive experiments are carried out to evaluate the correctness of the formulated MILP model and the performance of DQCEA. Experimental analysis confirms that DQCEA effectively provides promising schedules under different scenarios, demonstrating its reliability in addressing unexpected disruption challenges.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"91 ","pages":"Article 101750"},"PeriodicalIF":8.2000,"publicationDate":"2024-10-25","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/S2210650224002888","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

Energy-aware scheduling has emerged as a well-defined research topic for achieving sustainable development. However, unexpected disruptions in workshop pose several challenges to the manufacturing process, causing the original schedules to become non-optimal or even infeasible, resulting in significant energy waste. Consequently, it is necessary to investigate the robust scheduling problem with energy-awareness. The energy-efficient robust flexible job shop scheduling problem (ERFJSP) aims to simultaneously optimize scheduling efficiency, total energy consumption, and robustness. A two-stage mixed-integer linear programming model considering machine breakdown and job insertion is formulated in this paper for the first time. To solve this problem, a double Q-learning (DQL)-assisted competitive evolutionary algorithm (DQCEA) is proposed. In DQCEA, a heuristic initialization strategy is first designed, which allows it to obtain high-quality and diverse solutions. Subsequently, a multi-objective competitive mechanism is proposed to classify search individuals into inferiors and superiors. Moreover, an inferior-pushing and superior-pulling-based crossover is designed for inferior members, facilitating knowledge transfer within the population and enhancing global diversification capability. Meanwhile, a hyper-mutation operator is devised for superior members, which incorporates eight search strategies to improve local intensification ability. Furthermore, DQL is employed to learn and recommend the most suitable strategy for each superior individual. Finally, extensive experiments are carried out to evaluate the correctness of the formulated MILP model and the performance of DQCEA. Experimental analysis confirms that DQCEA effectively provides promising schedules under different scenarios, demonstrating its reliability in addressing unexpected disruption challenges.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
用于意外中断情况下能源感知鲁棒灵活作业车间调度的 DQL 辅助竞争进化算法
能源感知调度已成为实现可持续发展的一个明确研究课题。然而,车间的意外中断会给生产流程带来一些挑战,导致原计划变得非最佳甚至不可行,造成大量能源浪费。因此,有必要研究具有能源意识的鲁棒排程问题。高能效鲁棒柔性作业车间调度问题(ERFJSP)旨在同时优化调度效率、总能耗和鲁棒性。本文首次提出了一个考虑机器故障和作业插入的两阶段混合整数线性规划模型。为了解决这个问题,本文提出了一种双 Q 学习(DQL)辅助竞争进化算法(DQCEA)。在 DQCEA 中,首先设计了一种启发式初始化策略,使其能够获得高质量和多样化的解决方案。随后,提出了一种多目标竞争机制,将搜索个体分为下级和上级。此外,还为下级成员设计了基于下级推动和上级拉动的交叉,从而促进种群内部的知识转移,增强全局多样化能力。同时,还为上级成员设计了超突变算子,其中包含八种搜索策略,以提高局部强化能力。此外,还采用了 DQL 来学习并为每个优势个体推荐最合适的策略。最后,通过大量实验来评估所建立的 MILP 模型的正确性和 DQCEA 的性能。实验分析证实,DQCEA 在不同情况下都能有效地提供有前景的时间表,证明了它在应对意外中断挑战方面的可靠性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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.
期刊最新文献
An ensemble reinforcement learning-assisted deep learning framework for enhanced lung cancer diagnosis Multi-population coevolutionary algorithm for a green multi-objective flexible job shop scheduling problem with automated guided vehicles and variable processing speed constraints A knowledge-driven many-objective algorithm for energy-efficient distributed heterogeneous hybrid flowshop scheduling with lot-streaming Balancing heterogeneous assembly line with multi-skilled human-robot collaboration via Adaptive cooperative co-evolutionary algorithm A collaborative-learning multi-agent reinforcement learning method for distributed hybrid flow shop scheduling problem
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1