The Periodic Vehicle Routing Problem: A Case Study

16 Pages Posted: 26 Mar 2009

See all articles by Sofie Coene

Sofie Coene

KU Leuven - Faculty of Business and Economics (FEB)

Arent Arnout

affiliation not provided to SSRN

Frits Spieksma

Catholic University of Leuven (KUL)

Date Written: November 1, 2008

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.

Keywords: Periodic Vehicle Routing, case study

Suggested Citation

Coene, Sofie and Arnout, Arent and Spieksma, Frits, The Periodic Vehicle Routing Problem: A Case Study (November 1, 2008). Available at SSRN: https://ssrn.com/abstract=1368749 or http://dx.doi.org/10.2139/ssrn.1368749

Sofie Coene (Contact Author)

KU Leuven - Faculty of Business and Economics (FEB) ( email )

Naamsestraat 69
Leuven, B-3000
Belgium

Arent Arnout

affiliation not provided to SSRN ( email )

Frits Spieksma

Catholic University of Leuven (KUL) ( email )

Leuven, B-3000
Belgium

Register to save articles to
your library

Register

Paper statistics

Downloads
203
Abstract Views
982
rank
152,369
PlumX Metrics