| Article ID: | iaor2002241 |
| Country: | Canada |
| Volume: | 39 |
| Issue: | 3 |
| Start Page Number: | 292 |
| End Page Number: | 298 |
| Publication Date: | Aug 2001 |
| Journal: | INFOR |
| Authors: | Laporte Gilbert, Cordeau Jean-Francois |
| Keywords: | computational analysis, networks, networks: path, programming: travelling salesman |
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.