A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers

Michel Gendreau, Gilbert Laporte and René Séguin
Additional contact information
Michel Gendreau: Université de Montréal, Montréal, Canada
Gilbert Laporte: Université de Montréal, Montréal, Canada
René Séguin: Université de Montréal, Montréal, Canada

Operations Research, 1996, vol. 44, issue 3, 469-477

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 (search for similar items in EconPapers)
Date: 1996
References: Add references at CitEc
Citations: View citations in EconPapers (55)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.44.3.469 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:44:y:1996:i:3:p:469-477

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().