A Q-learning-based biology migration algorithm for energy-saving flexible job shop scheduling with speed adjustable machines and transporters

IF 8.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Swarm and Evolutionary Computation Pub Date : 2024-07-25 DOI:10.1016/j.swevo.2024.101655
Tianhua Jiang, Lu Liu, Huiqi Zhu
{"title":"A Q-learning-based biology migration algorithm for energy-saving flexible job shop scheduling with speed adjustable machines and transporters","authors":"Tianhua Jiang,&nbsp;Lu Liu,&nbsp;Huiqi Zhu","doi":"10.1016/j.swevo.2024.101655","DOIUrl":null,"url":null,"abstract":"<div><p>Due to the increasing demand for green manufacturing, energy-saving scheduling problems have garnered significant attention. These problems aim to reduce energy consumption at the production system level within workshops. To simulate a realistic production environment, this study addresses an energy-saving flexible job shop scheduling problem that considers two types of speed-adjustable resources, namely machines and transporters. The optimization objective is to minimize the comprehensive energy consumption of the workshop. A novel mathematical model is initially constructed based on the specific characteristics of the problem at hand. Given its NP-hard nature, a new Q-learning-based biology migration algorithm (QBMA) is proposed, which encompasses diverse search strategies and employs a Q-learning algorithm to dynamically select search strategies, thereby preventing blind search during the evolutionary process. The experimental results of our study demonstrate the promising efficacy of QBMA in effectively addressing the aforementioned problem, while also highlighting the positive impact of considering resources with adjustable speed.</p></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"90 ","pages":"Article 101655"},"PeriodicalIF":8.2000,"publicationDate":"2024-07-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/S2210650224001937","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

Due to the increasing demand for green manufacturing, energy-saving scheduling problems have garnered significant attention. These problems aim to reduce energy consumption at the production system level within workshops. To simulate a realistic production environment, this study addresses an energy-saving flexible job shop scheduling problem that considers two types of speed-adjustable resources, namely machines and transporters. The optimization objective is to minimize the comprehensive energy consumption of the workshop. A novel mathematical model is initially constructed based on the specific characteristics of the problem at hand. Given its NP-hard nature, a new Q-learning-based biology migration algorithm (QBMA) is proposed, which encompasses diverse search strategies and employs a Q-learning algorithm to dynamically select search strategies, thereby preventing blind search during the evolutionary process. The experimental results of our study demonstrate the promising efficacy of QBMA in effectively addressing the aforementioned problem, while also highlighting the positive impact of considering resources with adjustable speed.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于 Q 学习的生物迁移算法,适用于具有速度可调机器和运输机的节能型灵活作业车间调度
由于对绿色制造的需求日益增长,节能调度问题备受关注。这些问题旨在降低车间内生产系统层面的能耗。为了模拟真实的生产环境,本研究探讨了一个节能灵活作业车间调度问题,该问题考虑了两类速度可调的资源,即机器和运输机。优化目标是最大限度地降低车间的综合能耗。根据当前问题的具体特点,我们初步构建了一个新颖的数学模型。该算法包含多种搜索策略,并采用 Q-learning 算法动态选择搜索策略,从而避免了进化过程中的盲目搜索。我们的研究实验结果表明,QBMA 在有效解决上述问题方面具有良好的效果,同时也凸显了考虑可调节速度的资源所带来的积极影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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