The periodic vehicle routing problem with intermediate facilities

In this paper, we study an extension of the periodic vehicle routing problem (PVRP) where the vehicles can renew their capacity at some intermediate facilities. Each vehicle returns to the depot only when its work shift is over. For this problem we propose a tabu search (TS) algorithm and present computational results on a set of randomly generated instances and on a set of PVRP instances taken from the literature.