The Periodic Vehicle Routing Problem is a generalization of the classical VRP in which routes are determined for a planning horizon of several days. Each customer has an associated set of allowable visit schedules, and the objective of the problem is to design a set of minimum cost routes that give service to all the customers respecting their visit requirements. In this paper we study a variant of this problem in which we impose that each customer should be served by the same vehicle/driver at all visits. We call this problem the Periodic Vehicle Routing Problem with Driver Consistency (PVRP-DC). We present different integer linear programming formulations for the problem and derive several families of valid inequalities. We solve it using an exact branch-and-cut algorithm, and show computational results on a wide range of randomly generated instances.
| Subject : | : | Abstracts |
| Topics | : | Multi-period VRP |
| PDF version | : |  PDF version |
