{"title":"双面资源受限的装配线平衡问题:一种新的数学模型和改进的遗传算法","authors":"","doi":"10.1016/j.swevo.2024.101662","DOIUrl":null,"url":null,"abstract":"<div><p>Two-sided assembly lines are typically employed in the production of medium and large-sized products with the aim of reducing the length of the assembly line, enhancing assembly efficiency and consequently reducing the time required for product assembly. However, traditional Two-sided assembly lines lack effective resource scheduling management methods in production scheduling, which results in low productivity and high resource costs. In order to address this issue, we propose a new two-sided resource-constrained assembly line balancing problem (TRCLBP) model. The model takes the minimum number of workstations and the minimum assembly cost as its objective function and proposes an improved genetic algorithm (I-GA) to solve it. A three-layer chromosome initialization method is proposed for the assembly tasks and resource decisions, which effectively improves the diversity and quality of the initial population. Furthermore, the algorithm employs strategies such as matching crossover and redistributing variants to ensure rapid convergence of the populations and to prevent them from falling into local optimums. Finally, the efficacy of the model and algorithm proposed in this paper is validated through a comprehensive analysis of arithmetic case studies and enterprise engineering examples. This analysis reveals a reduction of approximately 18 % in the total cost of assembly. Furthermore, the model enables enterprises to make informed decisions regarding the optimal allocation of resources, thereby reducing production costs and improving the efficiency of assembly operations during periods of expansion.</p></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":null,"pages":null},"PeriodicalIF":8.2000,"publicationDate":"2024-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Two-sided resource-constrained assembly line balancing problem: a new mathematical model and an improved genetic algorithm\",\"authors\":\"\",\"doi\":\"10.1016/j.swevo.2024.101662\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Two-sided assembly lines are typically employed in the production of medium and large-sized products with the aim of reducing the length of the assembly line, enhancing assembly efficiency and consequently reducing the time required for product assembly. However, traditional Two-sided assembly lines lack effective resource scheduling management methods in production scheduling, which results in low productivity and high resource costs. In order to address this issue, we propose a new two-sided resource-constrained assembly line balancing problem (TRCLBP) model. The model takes the minimum number of workstations and the minimum assembly cost as its objective function and proposes an improved genetic algorithm (I-GA) to solve it. A three-layer chromosome initialization method is proposed for the assembly tasks and resource decisions, which effectively improves the diversity and quality of the initial population. Furthermore, the algorithm employs strategies such as matching crossover and redistributing variants to ensure rapid convergence of the populations and to prevent them from falling into local optimums. Finally, the efficacy of the model and algorithm proposed in this paper is validated through a comprehensive analysis of arithmetic case studies and enterprise engineering examples. This analysis reveals a reduction of approximately 18 % in the total cost of assembly. Furthermore, the model enables enterprises to make informed decisions regarding the optimal allocation of resources, thereby reducing production costs and improving the efficiency of assembly operations during periods of expansion.</p></div>\",\"PeriodicalId\":48682,\"journal\":{\"name\":\"Swarm and Evolutionary Computation\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":8.2000,\"publicationDate\":\"2024-07-25\",\"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/S2210650224002001\",\"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/S2210650224002001","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
Two-sided resource-constrained assembly line balancing problem: a new mathematical model and an improved genetic algorithm
Two-sided assembly lines are typically employed in the production of medium and large-sized products with the aim of reducing the length of the assembly line, enhancing assembly efficiency and consequently reducing the time required for product assembly. However, traditional Two-sided assembly lines lack effective resource scheduling management methods in production scheduling, which results in low productivity and high resource costs. In order to address this issue, we propose a new two-sided resource-constrained assembly line balancing problem (TRCLBP) model. The model takes the minimum number of workstations and the minimum assembly cost as its objective function and proposes an improved genetic algorithm (I-GA) to solve it. A three-layer chromosome initialization method is proposed for the assembly tasks and resource decisions, which effectively improves the diversity and quality of the initial population. Furthermore, the algorithm employs strategies such as matching crossover and redistributing variants to ensure rapid convergence of the populations and to prevent them from falling into local optimums. Finally, the efficacy of the model and algorithm proposed in this paper is validated through a comprehensive analysis of arithmetic case studies and enterprise engineering examples. This analysis reveals a reduction of approximately 18 % in the total cost of assembly. Furthermore, the model enables enterprises to make informed decisions regarding the optimal allocation of resources, thereby reducing production costs and improving the efficiency of assembly operations during periods of expansion.
期刊介绍:
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.