Author:

Keywords:

Social Sciences, Science & Technology, Technology, Management, Operations Research & Management Science, Business & Economics, Routing, Periodic vehicle routing, Driver consistency, Valid inequalities, Branch-and-cut, WASTE COLLECTION, MILK COLLECTION, Operations Research, 40 Engineering, 46 Information and computing sciences, 49 Mathematical sciences

Abstract:

© 2018 Elsevier B.V. The Periodic Vehicle Routing Problem is a generalization of the classical capacitated vehicle routing problem 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 new 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. We present an integer linear programming formulation 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.