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

@ARTICLE{Hemmelmayr2009,
title = {A variable neighborhood search heuristic for periodic routing problems},
author = {Vera Hemmelmayr and Karl F. Doerner and Richard F. Hartl},
year = {2009},
doi = {http://dx.doi.org/10.1016/j.ejor.2007.08.048},
url = {http://www.sciencedirect.com/science/article/pii/S0377221707011034},
volume = {195},
number = {3},
language = {EN},
pages = {791-802},
journal = {European Journal of Operational Research (EJOR)},
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.},
}