| Article ID: | iaor20051368 |
| Country: | United Kingdom |
| Volume: | 55 |
| Issue: | 5 |
| Start Page Number: | 542 |
| End Page Number: | 546 |
| Publication Date: | May 2004 |
| Journal: | Journal of the Operational Research Society |
| Authors: | Laporte G., Cordeau J.-F., Mercier A. |
| Keywords: | heuristics |
This note introduces a refinement to a previously proposed tabu search algorithm for vehicle routing problems with time windows. This refinement yields new best known solutions on a set of benchmark instances of the multi-depot, the periodic and the site-dependent vehicle routing problems with time windows.