Joint scheduling of hybrid flow-shop with limited automatic guided vehicles: A hierarchical learning-based swarm optimizer

IF 6.7 1区 工程技术 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Shuizhen Xing , Zhongshi Shao , Weishi Shao , Jianrui Chen , Dechang Pi
{"title":"Joint scheduling of hybrid flow-shop with limited automatic guided vehicles: A hierarchical learning-based swarm optimizer","authors":"Shuizhen Xing ,&nbsp;Zhongshi Shao ,&nbsp;Weishi Shao ,&nbsp;Jianrui Chen ,&nbsp;Dechang Pi","doi":"10.1016/j.cie.2024.110686","DOIUrl":null,"url":null,"abstract":"<div><div>Transportation system in workshop is essential for high-efficient production scheduling. Due to the limited transportation resources, the joint scheduling of production and transportation has emerged as a pivotal issue in modern manufacturing. This paper investigates a joint scheduling of hybrid flow-shop with limited automatic guided vehicles (HFSP-LAGV), which extends the classical hybrid flow-shop scheduling by considering the limited number of the AGVs on the transportation resources. To solve such problem, a mixed integer linear programming (MILP) model is firstly built to formulate HFSP-LAGV. Then, a hierarchical learning-based swarm optimizer (HLSO) is proposed. An encoding and decoding method based on three dispatch rules is proposed. The framework of HLSO comprises a pyramid-based layering strategy, an inter-layer learning and an intra-layer learning. The pyramid-based layering strategy divides the swarm into several layers. In the inter-layer learning, the individuals in higher layers guide the evolution of individuals in lower layers to achieve the exploration of global area. In the intra-layer learning, an offline Q-learning-based local search is designed to implement the self-learning of elite individuals in higher layer to intensify the exploitation of the local area. A Q-learning model that has been pre-trained offline is used to guide the selection of appropriate operator of local search. Experimental results reveal the effectiveness of the designs and the superiority of HLSO over several well-performing methods on solving HFSP-LAGV.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"198 ","pages":"Article 110686"},"PeriodicalIF":6.7000,"publicationDate":"2024-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Industrial Engineering","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0360835224008088","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

Transportation system in workshop is essential for high-efficient production scheduling. Due to the limited transportation resources, the joint scheduling of production and transportation has emerged as a pivotal issue in modern manufacturing. This paper investigates a joint scheduling of hybrid flow-shop with limited automatic guided vehicles (HFSP-LAGV), which extends the classical hybrid flow-shop scheduling by considering the limited number of the AGVs on the transportation resources. To solve such problem, a mixed integer linear programming (MILP) model is firstly built to formulate HFSP-LAGV. Then, a hierarchical learning-based swarm optimizer (HLSO) is proposed. An encoding and decoding method based on three dispatch rules is proposed. The framework of HLSO comprises a pyramid-based layering strategy, an inter-layer learning and an intra-layer learning. The pyramid-based layering strategy divides the swarm into several layers. In the inter-layer learning, the individuals in higher layers guide the evolution of individuals in lower layers to achieve the exploration of global area. In the intra-layer learning, an offline Q-learning-based local search is designed to implement the self-learning of elite individuals in higher layer to intensify the exploitation of the local area. A Q-learning model that has been pre-trained offline is used to guide the selection of appropriate operator of local search. Experimental results reveal the effectiveness of the designs and the superiority of HLSO over several well-performing methods on solving HFSP-LAGV.
带有限自动制导车辆的混合流-车间联合调度:基于分层学习的蜂群优化器
车间运输系统对高效生产调度至关重要。由于运输资源有限,生产与运输的联合调度已成为现代制造业的关键问题。本文研究了带有限自动导引车的混合流车间联合调度(HFSP-LAGV),它扩展了经典的混合流车间调度,考虑了 AGV 在运输资源上的有限数量。为解决该问题,首先建立了一个混合整数线性规划(MILP)模型来制定 HFSP-LAGV。然后,提出了一种基于分层学习的蜂群优化器(HLSO)。提出了一种基于三种调度规则的编码和解码方法。HLSO 框架包括基于金字塔的分层策略、层间学习和层内学习。基于金字塔的分层策略将蜂群分为若干层。在层间学习中,高层个体引导低层个体进化,以实现对全局区域的探索。在层内学习中,设计了基于离线 Q-learning 的局部搜索,以实现高层精英个体的自我学习,从而加强对局部区域的开发。经过离线预训练的 Q-learning 模型用于指导选择适当的局部搜索算子。实验结果表明了设计的有效性,以及 HLSO 在求解 HFSP-LAGV 时优于几种性能良好的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computers & Industrial Engineering
Computers & Industrial Engineering 工程技术-工程:工业
CiteScore
12.70
自引率
12.70%
发文量
794
审稿时长
10.6 months
期刊介绍: Computers & Industrial Engineering (CAIE) is dedicated to researchers, educators, and practitioners in industrial engineering and related fields. Pioneering the integration of computers in research, education, and practice, industrial engineering has evolved to make computers and electronic communication integral to its domain. CAIE publishes original contributions focusing on the development of novel computerized methodologies to address industrial engineering problems. It also highlights the applications of these methodologies to issues within the broader industrial engineering and associated communities. The journal actively encourages submissions that push the boundaries of fundamental theories and concepts in industrial engineering techniques.
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信