A note on solving the Fleet Quickest Routing Problem on a grid graph

Abstract

We address the Fleet Quickest Routing Problem (FQRP) on a grid graph, i.e. the problem of finding the paths $n$ vehicles have to perform to reach their destinations by moving from the lowest to the highest level (row) of a grid, respecting capacity constraints on the arcs and nodes in the shortest time possible. Traversing an arc of the grid graph takes one unit of time: in this way, a solution is optimal if a vehicle travels along one of the shortest paths it can find from its starting node to its destination without stopping, meeting the capacity constraints we mentioned above. Such a path is made of both horizontal and vertical steps, from the lowest to the highest level of the grid, without cycles. The existence of such a solution is guaranteed by a sufficient number of levels. If this not being, an optimal solution could require stopping vehicles somewhere or making them travel on a non-shortest path. In a previous work, it has been proved that $m^{ *}$ levels, where $m^{ *}$ is an increasing function of $n$, are sufficient to solve FQRP on grid graphs, when each vehicle performs all the horizontal steps of its path, if any, on one and only one level. The main contribution of this paper is the proof that, relaxing this property, the number of levels needed to guarantee a feasible and optimal solution is constant, i.e. it is 8. Whatever the number of vehicles, in a grid graph $(8 \times n)$ it is always possible to find $n$ shortest paths, one for each vehicle, which do not create conflicts and route every vehicle to its destination. Moreover, a routing rule that allows finding the solution to FQRP in every $8 \times n$ grid graph, whatever the destinations of the vehicles are, is provided. Practical relevance of FQRP mainly concerns the routing of Automated Guided Vehicles as well as the routing of aircrafts in airports.