Optimization of automated guided vehicle scheduling in diverse-shaped manufacturing workshops using an enhanced iterative greedy algorithm

View at publisher Summarise with VIRAT
Authors: Taiyan Jiao, Wen-Qiang Zou
Cited by: 0
References: 55

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

The efficient scheduling of automated guided vehicles (AGVs) plays a vital role in ensuring timely material delivery and maintaining the smooth flow of production processes. Owing to spatial constraints such as limited land availability, modern smart manufacturing environments increasingly feature diverse workshop shapes. However, traditional AGV scheduling algorithms lack adaptability and struggle to achieve good performance in such complex environments. This article addresses the AGV scheduling problem for multiple AGVs in diverse-shaped workshops (MAGVSDSW), with the objective of minimizing the transportation costs. To solve this problem, an enhanced iterative greedy algorithm is proposed, which integrates problem-based heuristics for high-quality initialization, a potential-driven destruction strategy for better exploration, and a capacity-aware insertion filtering mechanism for efficient feasibility checking. Finally, extensive experiments demonstrate the effectiveness and adaptability of the proposed algorithm in addressing the MAGVSDSW problem.

Fields of Study & Subjects

Advanced Manufacturing and Logistics Optimization Scheduling and Optimization Algorithms Vehicle Routing Optimization Methods

Publication details

Journal / source
Engineering Optimization
Volume
58
Issue
12
Pages
3752–3779
Publication date
30 March 2026
Language
EN