The periodic vehicle routing problem with driver consistency
Inmaculada Rodríguez-Martín,
Juan-José Salazar-González and
Hande Yaman
European Journal of Operational Research, 2019, vol. 273, issue 2, 575-584
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.
Keywords: Routing; Periodic vehicle routing; Driver consistency; Valid inequalities; Branch-and-cut (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (14)
Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221718307276
Full text for ScienceDirect subscribers only
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:273:y:2019:i:2:p:575-584
DOI: 10.1016/j.ejor.2018.08.032
Access Statistics for this article
European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati
More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().