Designing delivery districts for the vehicle routing problem with stochastic demands |
| |
| Authors: | Dag Haugland Sin C Ho Gilbert Laporte |
| |
| Institution: | aDepartment of Informatics, University of Bergen, N-5020 Bergen, Norway;bDistribution Management, HEC Montréal, 3000 chemin de la, Côte-Sainte-Catherine, Montréal, Que., Canada H3T 2A7 |
| |
| 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. |
| |
| Keywords: | Districting Vehicle routing Tabu search Stochastic programming |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
