European Journal Of Operational Research (2007)
- ISSN: 03772217
- ISBN: 5143437121
- DOI: 10.1016/j.ejor.2005.11.070
Available from linkinghub.elsevier.com
or
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.
Author-supplied keywords
Sign up today - FREE
Mendeley saves you time finding and organizing research. Learn more
- All your research in one place
- Add and import papers easily
- Access it anywhere, anytime
Start using Mendeley in seconds!
Readership Statistics
17 Readers on Mendeley
by Discipline
29% Engineering
by Academic Status
29% Ph.D. Student
18% Researcher (at an Academic Institution)
12% Professor
by Country
18% Austria
12% Canada
12% Colombia
Groups
 |