| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 483078 | European Journal of Operational Research | 2007 | 14 Pages |
Abstract
This paper considers the problem of designing districts for vehicle routing problems with stochastic demands. In particular, demands are assumed to be uncertain at the time when the districts are made, and these are revealed only after the districting decisions are determined. Tabu search and multistart heuristics for this stochastic districting problem are developed and compared. Computational results show that tabu search is superior over multistart.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Dag Haugland, Sin C. Ho, Gilbert Laporte,