Journal
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
Volume 61, Issue 12, Pages 1719-1728Publisher
TAYLOR & FRANCIS LTD
DOI: 10.1057/jors.2009.154
Keywords
periodic routing; logistics; integer programming
Ask authors/readers for more resources
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. Journal of the Operational Research Society (2010) 61, 1719-1728. doi:10.1057/jors.2009.154 Published online 6 January 2010
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available