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的在线无冲突调度与路径规划问题。所提算法与精确方法、贪婪启发式算法及元启发式算法进行了对比。通过在代表实际制造工厂的模型上使用理论实例与真实实例进行实验验证，本算法在计算时间更短的情况下，其求解效果优于其他算法或获得同等质量的解。