Optimizing AGV Transportation Routes in Printing as the Vehicle Routing Problem
摘要
The intelligent algorithms assist the printing advanced planning and scheduling (APS) system in achieving fine management and optimization of the entire process from order taking to production execution. Proper transportation path planning of the automatic guided vehicles (AGV) in the printing workshop is one of the crucial factors in improving overall operational capacity. This study aims to help promote the transportation efficiency of AGVs by optimizing the workshop layout using the System Layout Planning (SLP) method. It introduces a vehicle routing problem (VRP) solution model and utilizes the CP-SAT algorithm from OR-Tools, an operations research planning tool developed by Google, to optimize the tasks and travel paths of the AGVs. The goal is to determine the optimal transportation paths for delivering unprinted materials to the printing presses. This solution provides a valuable approach to the transportation optimization problem of APS in the printing production process.