{"title":"A multi-strategy self-adaptive differential evolution algorithm for assembly hybrid flowshop lot-streaming scheduling with component sharing","authors":"Yiling Lu , Qiuhua Tang , Shujun Yu , 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}
引用次数: 0
Abstract
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 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.