A Q-learning driven multi-objective evolutionary algorithm for worker fatigue dual-resource-constrained distributed hybrid flow shop

IF 4.1 2区 工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Computers & Operations Research Pub Date : 2024-11-26 DOI:10.1016/j.cor.2024.106919
Haonan Song , Junqing Li , Zhaosheng Du , Xin Yu , Ying Xu , Zhixin Zheng , Jiake Li
{"title":"A Q-learning driven multi-objective evolutionary algorithm for worker fatigue dual-resource-constrained distributed hybrid flow shop","authors":"Haonan Song ,&nbsp;Junqing Li ,&nbsp;Zhaosheng Du ,&nbsp;Xin Yu ,&nbsp;Ying Xu ,&nbsp;Zhixin Zheng ,&nbsp;Jiake Li","doi":"10.1016/j.cor.2024.106919","DOIUrl":null,"url":null,"abstract":"<div><div>In practical industrial production, workers are often critical resources in manufacturing systems. However, few studies have considered the level of worker fatigue when assigning resources and arranging tasks, which has a negative impact on productivity. To fill this gap, the distributed hybrid flow shop scheduling problem with dual-resource constraints considering worker fatigue (DHFSPW) is introduced in this study. Due to the complexity and diversity of distributed manufacturing and multi-objective, a Q-learning driven multi-objective evolutionary algorithm (QMOEA) is proposed to optimize both the makespan and total energy consumption of the DHFSPW at the same time. In QMOEA, solutions are represented by a four-dimensional vector, and a decoding heuristic that accounts for real-time worker productivity is proposed. Additionally, three problem-specific initialization heuristics are developed to enhance convergence and diversity capabilities. Moreover, encoding-based crossover, mirror crossover and balanced mutation methods are presented to improve the algorithm’s exploitation capabilities. Furthermore, a Q-learning based local search is employed to explore promising nondominated solutions across different dimensions. Finally, the QMOEA is assessed using a set of randomly generated instances, and a detailed comparison with state-of-the-art algorithms is performed to demonstrate its efficiency and robustness.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"175 ","pages":"Article 106919"},"PeriodicalIF":4.1000,"publicationDate":"2024-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Operations Research","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0305054824003915","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

In practical industrial production, workers are often critical resources in manufacturing systems. However, few studies have considered the level of worker fatigue when assigning resources and arranging tasks, which has a negative impact on productivity. To fill this gap, the distributed hybrid flow shop scheduling problem with dual-resource constraints considering worker fatigue (DHFSPW) is introduced in this study. Due to the complexity and diversity of distributed manufacturing and multi-objective, a Q-learning driven multi-objective evolutionary algorithm (QMOEA) is proposed to optimize both the makespan and total energy consumption of the DHFSPW at the same time. In QMOEA, solutions are represented by a four-dimensional vector, and a decoding heuristic that accounts for real-time worker productivity is proposed. Additionally, three problem-specific initialization heuristics are developed to enhance convergence and diversity capabilities. Moreover, encoding-based crossover, mirror crossover and balanced mutation methods are presented to improve the algorithm’s exploitation capabilities. Furthermore, a Q-learning based local search is employed to explore promising nondominated solutions across different dimensions. Finally, the QMOEA is assessed using a set of randomly generated instances, and a detailed comparison with state-of-the-art algorithms is performed to demonstrate its efficiency and robustness.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于q学习驱动的工人疲劳双资源约束分布式混合流水车间多目标进化算法
在实际的工业生产中,工人往往是制造系统的关键资源。然而,很少有研究在分配资源和安排任务时考虑到工人的疲劳程度,这对生产力有负面影响。为了填补这一空白,本文引入了考虑工人疲劳的双资源约束的分布式混合流水车间调度问题。针对分布式制造的复杂性、多样性和多目标特性,提出了一种q学习驱动的多目标进化算法(QMOEA)来同时优化DHFSPW的完工时间和总能耗。在QMOEA中,解由一个四维向量表示,并提出了一种考虑实时工人生产率的解码启发式。此外,本文还开发了三种针对特定问题的初始化启发式方法,以增强收敛性和多样性能力。提出了基于编码的交叉、镜像交叉和平衡突变方法,提高了算法的利用能力。此外,采用基于q学习的局部搜索来探索跨不同维度的有前途的非主导解决方案。最后,使用一组随机生成的实例对QMOEA进行了评估,并与最先进的算法进行了详细的比较,以证明其效率和鲁棒性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Computers & Operations Research
Computers & Operations Research 工程技术-工程:工业
CiteScore
8.60
自引率
8.70%
发文量
292
审稿时长
8.5 months
期刊介绍: Operations research and computers meet in a large number of scientific fields, many of which are of vital current concern to our troubled society. These include, among others, ecology, transportation, safety, reliability, urban planning, economics, inventory control, investment strategy and logistics (including reverse logistics). Computers & Operations Research provides an international forum for the application of computers and operations research techniques to problems in these and related fields.
期刊最新文献
Editorial Board A literature review of reinforcement learning methods applied to job-shop scheduling problems An accelerated Benders decomposition method for distributionally robust sustainable medical waste location and transportation problem Lexicographic optimization-based approaches to learning a representative model for multi-criteria sorting with non-monotonic criteria Portfolio optimisation: Bridging the gap between theory and practice
×
引用
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