| Article ID: | iaor19962068 |
| Country: | United Kingdom |
| Volume: | 23 |
| Issue: | 3 |
| Start Page Number: | 229 |
| End Page Number: | 235 |
| Publication Date: | Mar 1996 |
| Journal: | Computers and Operations Research |
| Authors: | Renaud Jacques |
| Keywords: | heuristics |
This article describes a tabu search algorithm for the multi-depot vehicle routing problem with capacity and route length restrictions. The algorithm is tested on a set of 23 benchmark instances. It is shown to outperform existing heuristics.