| Article ID: | iaor19971883 |
| Country: | United States |
| Volume: | 8 |
| Issue: | 2 |
| Start Page Number: | 158 |
| End Page Number: | 164 |
| Publication Date: | Apr 1996 |
| Journal: | INFORMS Journal On Computing |
| Authors: | Potvin Jean-Yves, Garcia Bruno-Laurent, Kervahut Tanguy, Rosseau Jean-Marc |
| Keywords: | programming: travelling salesman |
This paper describes a tabu search heuristic for the vehicle routing problem with time windows. The tabu search is based on specialized local search heuristics that maintain the feasibility of the solution at all time. Computational results on a standard set of test problems are reported, as well as comparisons with other heuristics.