Designing delivery districts for the vehicle routing problem with stochastic demands

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.

• Type: Journal
• Year: 2007
• Where: EOR
• Authors: Dag Haugland, Sin C. Ho, Gilbert Laporte
• Keywords: EOR 2007, Stochastic Demands, Stochastic Districting Problem, Tabu Search