We present the Vehicle Routing Problem with Occasional Drivers.
We present a mathematical formulation of the problem.
We propose a multi-start heuristic algorithm.
We perform a computational study on instances adapted from VRP benchmark instances.
We highlight the benefits that could be achieved by employing occasional drivers.