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，本文提出一种基于循环图的在线无冲突调度与路由算法。通过将所提算法与精确方法、贪婪启发式算法及元启发式算法进行对比，基于真实制造工厂模型的理论与实际案例实验表明：该算法或能优于其他算法，或在更短计算时间内获得同等优质解。