一种多策略自适应差分进化算法,用于组件共享的装配混合流水车间批量流水调度

IF 8.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Yiling Lu , Qiuhua Tang , Shujun Yu , Lixin Cheng
{"title":"一种多策略自适应差分进化算法,用于组件共享的装配混合流水车间批量流水调度","authors":"Yiling Lu ,&nbsp;Qiuhua Tang ,&nbsp;Shujun Yu ,&nbsp;Lixin Cheng","doi":"10.1016/j.swevo.2024.101783","DOIUrl":null,"url":null,"abstract":"<div><div>Lot-streaming helps to achieve a more balanced utilization of parallel machines and more timely assembly of components, while component sharing increases the flexibility and commonality of assembly operations. Thus, this work addresses an assembly hybrid flowshop lot-streaming scheduling problem with component sharing. A mixed-integer linear programming model is formulated to scrutinize the coupling relations among variables <em>i.e.</em> sub-lot splitting, machine allocation, processing sequencing, and assembly sequencing, and to minimize the maximum completion time and work-in-process inventory lexicographically. To solve the above problem efficiently, a multi-strategy self-adaptive differential evolution (MSDE) algorithm is developed. In MSDE, three problem-specific strategies that consider component integrity and specific requirements of production and assembly are integrated to enhance the initial population in terms of diversity and solution quality. A Q-learning-based selection mechanism is proposed to self-adaptively select an appropriate combination from mutation and crossover operators for achieving a balance between exploration and exploitation. An inventory reduction strategy is appended to largely reduce work-in-process components without extending completion time. Four conclusions are drawn from extensive experiments: (1) The ensemble of three population initialization strategies is superior to each individual one; (2) The Q-learning-based optimizer selection is more effective and robust than the single optimizer-based one; (3) The work-in-process inventory reduction strategy demonstrates remarkable effectiveness for most solutions; (4) MSDE outperforms the existing state-of-the-art algorithms in most cases.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"92 ","pages":"Article 101783"},"PeriodicalIF":8.2000,"publicationDate":"2024-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A multi-strategy self-adaptive differential evolution algorithm for assembly hybrid flowshop lot-streaming scheduling with component sharing\",\"authors\":\"Yiling Lu ,&nbsp;Qiuhua Tang ,&nbsp;Shujun Yu ,&nbsp;Lixin Cheng\",\"doi\":\"10.1016/j.swevo.2024.101783\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Lot-streaming helps to achieve a more balanced utilization of parallel machines and more timely assembly of components, while component sharing increases the flexibility and commonality of assembly operations. Thus, this work addresses an assembly hybrid flowshop lot-streaming scheduling problem with component sharing. A mixed-integer linear programming model is formulated to scrutinize the coupling relations among variables <em>i.e.</em> sub-lot splitting, machine allocation, processing sequencing, and assembly sequencing, and to minimize the maximum completion time and work-in-process inventory lexicographically. To solve the above problem efficiently, a multi-strategy self-adaptive differential evolution (MSDE) algorithm is developed. In MSDE, three problem-specific strategies that consider component integrity and specific requirements of production and assembly are integrated to enhance the initial population in terms of diversity and solution quality. A Q-learning-based selection mechanism is proposed to self-adaptively select an appropriate combination from mutation and crossover operators for achieving a balance between exploration and exploitation. An inventory reduction strategy is appended to largely reduce work-in-process components without extending completion time. Four conclusions are drawn from extensive experiments: (1) The ensemble of three population initialization strategies is superior to each individual one; (2) The Q-learning-based optimizer selection is more effective and robust than the single optimizer-based one; (3) The work-in-process inventory reduction strategy demonstrates remarkable effectiveness for most solutions; (4) MSDE outperforms the existing state-of-the-art algorithms in most cases.</div></div>\",\"PeriodicalId\":48682,\"journal\":{\"name\":\"Swarm and Evolutionary Computation\",\"volume\":\"92 \",\"pages\":\"Article 101783\"},\"PeriodicalIF\":8.2000,\"publicationDate\":\"2024-11-22\",\"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/S2210650224003213\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Swarm and Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2210650224003213","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

批量流水作业有助于更均衡地利用并行机器和更及时地组装部件,而部件共享则提高了组装操作的灵活性和通用性。因此,本研究解决的是带有组件共享功能的装配混合流水车间批量流水作业调度问题。本文建立了一个混合整数线性规划模型,以仔细研究子批次分割、机器分配、加工顺序和装配顺序等变量之间的耦合关系,并最小化最大完工时间和在制品库存。为了高效解决上述问题,我们开发了一种多策略自适应微分进化算法(MSDE)。在 MSDE 中,集成了三种针对特定问题的策略,这些策略考虑了组件的完整性以及生产和装配的特定要求,以提高初始群体的多样性和解决方案的质量。此外,还提出了一种基于 Q 学习的选择机制,可自适应地从突变和交叉算子中选择适当的组合,以实现探索和开发之间的平衡。此外,还提出了一种减少库存的策略,以在不延长完工时间的情况下大量减少在制品部件。通过大量实验得出了四个结论:(1) 三种种群初始化策略的组合优于每种单独的策略;(2) 基于 Q-learning 的优化器选择比基于单一优化器的优化器选择更有效、更稳健;(3) 减少在制品库存策略对大多数解决方案都非常有效;(4) MSDE 在大多数情况下都优于现有的最先进算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A multi-strategy self-adaptive differential evolution algorithm for assembly hybrid flowshop lot-streaming scheduling with component sharing
Lot-streaming helps to achieve a more balanced utilization of parallel machines and more timely assembly of components, while component sharing increases the flexibility and commonality of assembly operations. Thus, this work addresses an assembly hybrid flowshop lot-streaming scheduling problem with component sharing. A mixed-integer linear programming model is formulated to scrutinize the coupling relations among variables i.e. sub-lot splitting, machine allocation, processing sequencing, and assembly sequencing, and to minimize the maximum completion time and work-in-process inventory lexicographically. To solve the above problem efficiently, a multi-strategy self-adaptive differential evolution (MSDE) algorithm is developed. In MSDE, three problem-specific strategies that consider component integrity and specific requirements of production and assembly are integrated to enhance the initial population in terms of diversity and solution quality. A Q-learning-based selection mechanism is proposed to self-adaptively select an appropriate combination from mutation and crossover operators for achieving a balance between exploration and exploitation. An inventory reduction strategy is appended to largely reduce work-in-process components without extending completion time. Four conclusions are drawn from extensive experiments: (1) The ensemble of three population initialization strategies is superior to each individual one; (2) The Q-learning-based optimizer selection is more effective and robust than the single optimizer-based one; (3) The work-in-process inventory reduction strategy demonstrates remarkable effectiveness for most solutions; (4) MSDE outperforms the existing state-of-the-art algorithms in most cases.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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学术官方微信