The periodic vehicle routing problem with driver consistency
Author
Rodríguez-Martín, I.
Salazar-González, J. -J.
Yaman, Hande
Date
2018Source Title
European Journal of Operational Research
Print ISSN
0377-2217
Publisher
Elsevier
Volume
273
Issue
2
Pages
575 - 584
Language
English
Type
ArticleItem Usage Stats
84
views
views
3
downloads
downloads
Abstract
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.