| Article ID: | iaor20002811 |
| Country: | United States |
| Volume: | 44 |
| Issue: | 3 |
| Start Page Number: | 469 |
| End Page Number: | 477 |
| Publication Date: | May 1996 |
| Journal: | Operations Research |
| Authors: | Laporte Gilbert, Gendreau Michel, Seguin R. |
| Keywords: | heuristics |
This paper considers a version of the stochastic vehicle routing problem where customers are present at locations with some probabilities and have random demands. A tabu search heuristic is developed for this problem. Comparisons with known optimal solutions on problems whose sizes vary from 6 to 46 customers indicate that the heuristic produces an optimal solution in 89.45% of cases, with an average deviation of 0.38% from optimality.