The Periodic Vehicle Routing Problem: A Case Study

This paper deals with a case study which is a variant of the Periodic Vehicle Routing Problem (PVRP). As in the traditional Vehicle Routing Problem (VRP), customer locations each with a certain daily demand are given, as well as a set of capacitated vehicles. In addition, the PVRP has a horizon, say T days, and there is a frequency for each customer stating how often within this T-day period this customer must be visited.A solution to the PVRP consists of T sets of routes that jointly satisfy the demand constraints and the frequency constraints. The objective is to minimize the sum of the costs of all routes over the planning horizon. We develop different algorithms solving the instances of the case studied. Using these algorithms we are able to realize considerable cost reductions compared to the current situation.

[1]  M. Mourgaya,et al.  Problème de tournées de véhicules multipériodiques : Classification et heuristique pour la planification tactique , 2006 .

[2]  Satoru Miyano,et al.  The C Clustering Library , 2005 .

[3]  Lawrence Bodin,et al.  Networks and vehicle routing for municipal waste collection , 1974, Networks.

[4]  John E. Beasley,et al.  A heuristic algorithm for the period vehicle routing problem , 1984 .

[5]  Michal Tzur,et al.  The Period Vehicle Routing Problem with Service Choice , 2006, Transp. Sci..

[6]  Martin W. P. Savelsbergh,et al.  Delivery strategies for blood products supplies , 2009, OR Spectr..

[7]  R. Eglese,et al.  Routeing Road Sweepers in a Rural Area , 1991 .

[8]  Susana Baptista,et al.  A period vehicle routing case study , 2002, Eur. J. Oper. Res..

[9]  Buyang Cao,et al.  Special Issue: 2002 Franz Edelman Award for Achievement in Operations Research and the Management Sciences: Optimizing Periodic Maintenance Operations for Schindler Elevator Corporation , 2003, Interfaces.

[10]  Michal Tzur,et al.  The Period Vehicle Routing Problem and its Extensions , 2008 .

[11]  Joaquín A. Pacheco,et al.  Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts , 2007, Eur. J. Oper. Res..

[12]  John E. Beasley,et al.  A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions , 2008, J. Oper. Res. Soc..

[13]  G. D. H. Claassen,et al.  An application of Special Ordered Sets to a periodic milk collection problem , 2007, Eur. J. Oper. Res..

[14]  Byung-In Kim,et al.  Waste collection vehicle routing problem with time windows using multi-objective genetic algorithms , 2007 .

[15]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[16]  Nicos Christofides,et al.  The period routing problem , 1984, Networks.

[17]  Maria Grazia Speranza,et al.  The periodic vehicle routing problem with intermediate facilities , 2002, Eur. J. Oper. Res..