Datasets for the paper "Conflict-free routing of multi-stop warehouse trucks"

Abstract

Conflict-free routing is the challenging problem of allocating routes to vehicles over a network in which vehicles may not pass each other. We consider one such application: truck movements in a tightly constrained warehouse run by the company PostPac. We propose an extension of an existing conflict-free routing algorithm to consider multiple stopping points per route. A high level metaheuristic was also applied to determine the order of points to visit and the order in which to allocate routes to the vehicles. This data set encapsulated our experimental results from this work. This includes our implementation of an improved routing algorithm, with example source code in Java, an example problem definition for the warehouse in question, and our experimental results.