The doubly open park-and-loop routing problem

The purpose of this paper is to introduce a highly efficient heuristic for the doubly open park-and-loop routing problem. This problem is an extension of the classical vehicle routing problem in which routes may involve a main tour that is completed using a vehicle and subtours that are carried out on foot after parking the vehicle. In addition, routes do not start and end at a central depot, but at customer locations. We propose a matheuristic based on a split procedure that generates high quality solutions fast. We present computational experiments on a set of real instances with up to 3,800 customers. We also illustrate the use of the matheuristic on a related problem called the vehicle routing problem with transportable resources, where the method is capable of finding 32/40 new best solutions.