This paper shows that the Site Dependent Vehicle Routing Problem (SDVRP) ca
n be viewed as a special case of the Periodic VRP. A tabu search heuristic
for the SDVRP and the SDVRP with Time Windows is outlined and tested on ran
domly generated instances. In the case of the SDVRP for which benchmark res
ults are available, the proposed method outperforms all previously publishe
d algorithms.