A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
Michel Gendreau, Gilbert Laporte, René Séguin
Operations Research · 1996 · Volume 44 · Issue 3
Abstract
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.
Keywords
vehicle routing, tabu search algorithm, stochastic programming
Enable JavaScript for citation tools and additional paper interactions.