{"title":"面向制造业的智能自动引导车辆调度框架:平衡能源、效率和任务完成","authors":"Xiang Huo, Lei Nie","doi":"10.1016/j.swevo.2025.102127","DOIUrl":null,"url":null,"abstract":"<div><div>In recent years, the widespread usage of Automated Guided Vehicles (AGVs) has become prevalent in material transportation systems of industries. The AGVs are known for their operational flexibility and efficiency, but efficient scheduling remains a crucial issue due to the conflicting factors, including deviation penalties for task execution times, power consumption, overall task completion time, collision risk, and utilization efficiency. To address this, this research employs a multi-objective mixed-integer programming model (MO-MIP) to formulate the scheduling problem of AGVs. The optimization algorithms, such as Non-dominated Sorting Genetic Algorithm II (NSGA-II) and the Reference Point-based Non-dominated Sorting Genetic Algorithm (NSGA-III) are utilized to obtain the Pareto optimal solutions in solving the scheduling problem. The simulation experiment on three distinct manufacturing workshop scenarios was conducted to examine the effectiveness of the model. The outcomes illustrated that the NSGA-II and NSGA-III exhibit reduced penalty cost, power consumption, collision risk, task completion time, and higher utilization efficiency. These algorithms also showed better computational efficiency and outperformed baseline algorithms under three manufacturing scenarios. These outcomes indicate that the proposed method is a promising solution for the industrial sector to perform material transportation in an efficient manner.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"98 ","pages":"Article 102127"},"PeriodicalIF":8.5000,"publicationDate":"2025-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An intelligent automated guided vehicle scheduling framework for manufacturing: Balancing energy, efficiency, and task completion\",\"authors\":\"Xiang Huo, Lei Nie\",\"doi\":\"10.1016/j.swevo.2025.102127\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>In recent years, the widespread usage of Automated Guided Vehicles (AGVs) has become prevalent in material transportation systems of industries. The AGVs are known for their operational flexibility and efficiency, but efficient scheduling remains a crucial issue due to the conflicting factors, including deviation penalties for task execution times, power consumption, overall task completion time, collision risk, and utilization efficiency. To address this, this research employs a multi-objective mixed-integer programming model (MO-MIP) to formulate the scheduling problem of AGVs. The optimization algorithms, such as Non-dominated Sorting Genetic Algorithm II (NSGA-II) and the Reference Point-based Non-dominated Sorting Genetic Algorithm (NSGA-III) are utilized to obtain the Pareto optimal solutions in solving the scheduling problem. The simulation experiment on three distinct manufacturing workshop scenarios was conducted to examine the effectiveness of the model. The outcomes illustrated that the NSGA-II and NSGA-III exhibit reduced penalty cost, power consumption, collision risk, task completion time, and higher utilization efficiency. These algorithms also showed better computational efficiency and outperformed baseline algorithms under three manufacturing scenarios. These outcomes indicate that the proposed method is a promising solution for the industrial sector to perform material transportation in an efficient manner.</div></div>\",\"PeriodicalId\":48682,\"journal\":{\"name\":\"Swarm and Evolutionary Computation\",\"volume\":\"98 \",\"pages\":\"Article 102127\"},\"PeriodicalIF\":8.5000,\"publicationDate\":\"2025-09-06\",\"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/S2210650225002858\",\"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/S2210650225002858","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
An intelligent automated guided vehicle scheduling framework for manufacturing: Balancing energy, efficiency, and task completion
In recent years, the widespread usage of Automated Guided Vehicles (AGVs) has become prevalent in material transportation systems of industries. The AGVs are known for their operational flexibility and efficiency, but efficient scheduling remains a crucial issue due to the conflicting factors, including deviation penalties for task execution times, power consumption, overall task completion time, collision risk, and utilization efficiency. To address this, this research employs a multi-objective mixed-integer programming model (MO-MIP) to formulate the scheduling problem of AGVs. The optimization algorithms, such as Non-dominated Sorting Genetic Algorithm II (NSGA-II) and the Reference Point-based Non-dominated Sorting Genetic Algorithm (NSGA-III) are utilized to obtain the Pareto optimal solutions in solving the scheduling problem. The simulation experiment on three distinct manufacturing workshop scenarios was conducted to examine the effectiveness of the model. The outcomes illustrated that the NSGA-II and NSGA-III exhibit reduced penalty cost, power consumption, collision risk, task completion time, and higher utilization efficiency. These algorithms also showed better computational efficiency and outperformed baseline algorithms under three manufacturing scenarios. These outcomes indicate that the proposed method is a promising solution for the industrial sector to perform material transportation in an efficient manner.
期刊介绍:
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.