This paper shows that the Site Dependent Vehicle Routing Problem (SDVRP) can 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 randomly generated instances. In the case of the SDVRP for which benchmark results are available, the proposed method outperforms all previously published algorithms.
No takes yet. Share an insight, caveat, or question.
Jean‐François Cordeau (2001) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: