Conflict-free routing of multi-stop warehouse trucks

Citation

Brownlee A, Swan J, Senington R & Kocsis Z (2020) Conflict-free routing of multi-stop warehouse trucks. Optimization Letters, 14 (6), p. 1459–1470. https://doi.org/10.1007/s11590-019-01453-6

Abstract
The recent interest in greater vehicular autonomy for factory and warehouse automation has stimulated research in conflict-free routing: a challenging network routing problem in which vehicles may not pass each other. Motivated by a real-world case study, we consider one such application: truck movements in a tightly constrained warehouse. We propose an extension of an existing conflict-free routing algorithm to consider multiple stopping points per route. A high level metaheuristic is applied to determine the route construction and assignment of vehicles to routes.

Keywords
conflict-free routing; shortest path; metaheuristic; graphs; permutations

Journal
Optimization Letters: Volume 14, Issue 6

• Published version