Exact Approach to the Autonomous Delivery Vehicle Routing Problem

This work addresses the Autonomous Delivery Vehicle Routing Problem (ADVRP) by proposing an exact mixed-integer linear programming (MILP) model. The approach leverages map decomposition into a Resource Constrained Shortest Path (RCSP) problem, implemented within the VRPSolver framework. Furthermore, a critical study of existing benchmark characteristics reveals structural flaws in previous datasets, leading to the proposal of a new, normalized set of instances. Computational experiments demonstrate the efficacy of the proposed model, finding optimal values for 50 of the 108 tested instances and providing valid upper bounds for others.