Title: The periodic vehicle routing problem: a case study
Authors: Coene, Sofie
Arnout, A.
Spieksma, Frederik
Issue Date: Nov-2008
Publisher: K.U.Leuven
Series Title: FBE Research Report KBI_0828 pages:1-15
Abstract: 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.
Publication status: published
KU Leuven publication type: IR
Appears in Collections:Research Center for Operations Research and Business Statistics (ORSTAT), Leuven

Files in This Item:
File Description Status SizeFormat
KBI_0828.pdfThe periodic vehicle routing problem: a case study Published 546KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.