| Article ID: | iaor20021740 |
| Country: | United States |
| Volume: | 30 |
| Issue: | 2 |
| Start Page Number: | 105 |
| End Page Number: | 119 |
| Publication Date: | Sep 1997 |
| Journal: | Networks |
| Authors: | Laporte Gilbert, Gendreau Michel, Cordeau Jean-Franois |
| Keywords: | tabu search |
We propose a tabu search heuristic capable of solving three well-known routing problems: the periodic vehicle routing problem, the periodic traveling salesman problem, and the multi-depot vehicle routing problem. Computational experiments carried out on instances taken from the literature indicate that the proposed method outperforms existing heuristics for all three problems.