Automated guided vehicles (AGVs) are widely used in various industries, and scheduling and routing them in a conflict-free manner is crucial to their efficient operation. We propose a loop-based algorithm that solves the online, conflict-free scheduling and routing problem for AGVs with any capacity and ordered jobs in loop-based graphs. The proposed algorithm is compared against an exact method, a greedy heuristic and a metaheuristic. We experimentally show, using theoretical and real instances on a model representing a real manufacturing plant, that this algorithm either outperforms the other algorithms or gets an equally good solution in less computing time.

翻译：自动导引车（AGV）在各行业得到广泛应用，以无冲突方式进行调度与路径规划对其高效运行至关重要。本文提出一种基于环路的算法，用于解决任意容量、带有序作业的AGV在环路图结构中的在线无冲突调度与路径规划问题。所提算法与精确方法、贪婪启发式算法及元启发式算法进行了对比。通过在代表实际制造工厂的模型上使用理论及实际算例进行实验，本算法在计算时间更短的情况下，其求解质量优于其他算法或达到同等水平。