On a periodic vehicle routing problem

S. Coene, A. Arnout, F.C.R. Spieksma

Research output: Contribution to journalArticlepeer-review

41 Citations (Scopus)

Abstract

This paper deals with a study on a variant of the Periodic Vehicle Routing Problem (PVRP). As in the traditional Vehicle Routing Problem, 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.
Original languageEnglish
Pages (from-to)1719-1728
JournalJournal of the Operational Research Society
Volume61
Issue number12
DOIs
Publication statusPublished - Dec 2010
Externally publishedYes

Keywords

  • periodic routing
  • logistics
  • integer programming

Fingerprint

Dive into the research topics of 'On a periodic vehicle routing problem'. Together they form a unique fingerprint.

Cite this