# Online Dispatching and Routing for Automated Guided Vehicles in Pickup and Delivery Systems on Loop-Based Graphs

arXiv: https://arxiv.org/abs/2310.02195 · HTML: https://mlsanity.com/paper/2310.02195/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 1 of its 28 references that are in the map.
- First posted on arXiv 3 Oct 2023.

## Builds on (most cited first, 1 of 1)

- [SMAC3: A Versatile Bayesian Optimization Package for Hyperparameter Optimization](https://mlsanity.com/paper/2109.09831/) (2021)

## Abstract (arXiv)

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.