Quotation Hemmelmayr, Vera, Doerner, Karl F. , Hartl, Richard F. . 2009. A variable neighborhood search heuristic for periodic routing problems. European Journal of Operational Research (EJOR) 195 (3), 791-802.


RIS


BibTeX

Abstract

The aim of this paper is to propose a new heuristic for the Periodic Vehicle Routing Problem (PVRP) without time windows. The PVRP extends the classical Vehicle Routing Problem (VRP) to a planning horizon of several days. Each customer requires a certain number of visits within this time horizon while there is some flexibility on the exact days of the visits. Hence, one has to choose the visit days for each customer and to solve a VRP for each day. Our method is based on Variable Neighborhood Search (VNS). Computational results are presented, that show that our approach is competitive and even outperforms existing solution procedures proposed in the literature. Also considered is the special case of a single vehicle, i.e. the Periodic Traveling Salesman Problem (PTSP). It is shown that slight changes of the proposed VNS procedure is also competitive for the PTSP.

Tags

Press 'enter' for creating the tag

Publication's profile

Status of publication Published
Affiliation WU
Type of publication Journal article
Journal European Journal of Operational Research (EJOR)
Citation Index SCI
WU Journalrating 2009 A
WU-Journal-Rating new FIN-A, INF-A, STRAT-A, WH-A
Language English
Title A variable neighborhood search heuristic for periodic routing problems
Volume 195
Number 3
Year 2009
Page from 791
Page to 802
Reviewed? Y
URL http://www.sciencedirect.com/science/article/pii/S0377221707011034
DOI http://dx.doi.org/10.1016/j.ejor.2007.08.048

Associations

People
Hemmelmayr, Vera (Details)
External
Doerner, Karl F.
Hartl, Richard F.
Organization
Institute for Transport and Logistics Management (Details)
Google Scholar: Search