A matheuristic-based self-learning evolutionary algorithm for lot streaming hybrid flow shop group scheduling with limited auxiliary modules

IF 8.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Hongxia Tan , Min Zhou , Liping Zhang , Zikai Zhang , Yingli Li , Zixiang Li
{"title":"A matheuristic-based self-learning evolutionary algorithm for lot streaming hybrid flow shop group scheduling with limited auxiliary modules","authors":"Hongxia Tan ,&nbsp;Min Zhou ,&nbsp;Liping Zhang ,&nbsp;Zikai Zhang ,&nbsp;Yingli Li ,&nbsp;Zixiang Li","doi":"10.1016/j.swevo.2025.101965","DOIUrl":null,"url":null,"abstract":"<div><div>Group scheduling enhances production flexibility and efficiency in mass customization However, it overlooks differences of due dates in customized orders and functional/quantity constraints of molds. Therefore, lot streaming and module assignment strategies are needed. To address this, this paper investigates the lot streaming hybrid flow shop group scheduling with limited auxiliary module constraints(HFGSP_LSAM). To minimize the total weighted tardiness and makespan, a new mixed integer linear programming model and a matheuristic-based self-learning evolutionary algorithm(MSEA) are proposed. This algorithm develops a new matheuristic-based hybrid initialization to generate better initial solutions. A double layer self-learning evolution is developed to collaborate operators which include six knowledge-based local search operators and six global crossover operators. The experimental study, based on 360 small and 960 large instances, demonstrates that the matheuristic-based hybrid initialization and double layer self-learning evolution can enhance 84% and 13% performance of MSEA, as well as the proposed MSEA is superior to other well known algorithms in solving HFGSP_LSAM. An industrial case study is conducted to confirm the superiority of MSEA and provide two recommendations for managers to balance production efficiency and due dates.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"96 ","pages":"Article 101965"},"PeriodicalIF":8.2000,"publicationDate":"2025-05-08","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/S2210650225001233","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

Group scheduling enhances production flexibility and efficiency in mass customization However, it overlooks differences of due dates in customized orders and functional/quantity constraints of molds. Therefore, lot streaming and module assignment strategies are needed. To address this, this paper investigates the lot streaming hybrid flow shop group scheduling with limited auxiliary module constraints(HFGSP_LSAM). To minimize the total weighted tardiness and makespan, a new mixed integer linear programming model and a matheuristic-based self-learning evolutionary algorithm(MSEA) are proposed. This algorithm develops a new matheuristic-based hybrid initialization to generate better initial solutions. A double layer self-learning evolution is developed to collaborate operators which include six knowledge-based local search operators and six global crossover operators. The experimental study, based on 360 small and 960 large instances, demonstrates that the matheuristic-based hybrid initialization and double layer self-learning evolution can enhance 84% and 13% performance of MSEA, as well as the proposed MSEA is superior to other well known algorithms in solving HFGSP_LSAM. An industrial case study is conducted to confirm the superiority of MSEA and provide two recommendations for managers to balance production efficiency and due dates.
基于数学的有限辅助模块的批流混合流水车间群调度自学习进化算法
在大规模定制中,组调度提高了生产的灵活性和效率,但忽略了定制订单交货期的差异和模具的功能/数量约束。因此,需要采用批流和模块分配策略。为了解决这一问题,本文研究了具有有限辅助模块约束的批流混合流车间群调度(HFGSP_LSAM)。为了使总加权延迟和完工时间最小化,提出了一种新的混合整数线性规划模型和一种基于数学的自学习进化算法。该算法提出了一种新的基于数学的混合初始化方法,以产生更好的初始解。提出了一种双层自学习进化的协作算子,包括6个基于知识的局部搜索算子和6个全局交叉算子。基于360个小实例和960个大实例的实验研究表明,基于数学的混合初始化和双层自学习进化可以使MSEA的性能分别提高84%和13%,并且在求解HFGSP_LSAM方面优于其他已知算法。通过一个工业案例研究,证实了MSEA的优越性,并为管理者平衡生产效率和到期日提供了两个建议。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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.
×
引用
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学术官方微信