Abstract
Vehicle production involves a complex process and fast production pace, necessitating timely material delivery. The task scheduling problem of multi-load Automated Guided Vehicle System (AGVS) for auxiliary material distribution in automotive production workshops presents multiple optimization objectives and complex constraints. To enhance on-time delivery of auxiliary materials, this paper proposes a multi-load AGVS deadlock prevention task scheduling method based on improved Imperialist Competition Algorithm (ICA). First, a mathematical model for multi-load AGVS task scheduling is established, aiming to minimize task delivery distance and maximize the remaining time before the production line shuts down due to material shortages. By analyzing the conditions triggering deadlocks in multi-load AGVS, a deadlock prevention constraint based on the remaining trailer capacity of the buffer area is incorporated into the mathematical model. Second, an improved ICA (IICA) based deadlock prevention task scheduling method is designed. To enhance the initial national population quality of the IICA, a heuristic scheduling rule library is constructed to generate high-quality countries. An improved differential evolution algorithm is introduced during the assimilation process to improve convergence speed. Finally, a simulation platform for multi-load AGVS auxiliary material distribution is established. Experimental results indicate that the designed deadlock avoidance strategy effectively prevents deadlock occurrences while enhancing system productivity across all six algorithms. Compared to the other five algorithms, the proposed IICA achieves the highest unit hour production capacity, on-time task completion rate, and production line start-up rate, while maintaining the lowest average task execution time.
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer






