Motivated by the fixed routes problem, where the objective is to design a set of routes to be operated unchanged over a period of time, we study the vehicle routing problem with stochastic demands. An algorithm is developed based on a stochastic programming model with recourse. Computational experiments show that the algorithm compares favorably to existing algorithms.
|Place of Publication||Eindhoven|
|Publisher||Technische Universiteit Eindhoven|
|Number of pages||14|
|Publication status||Published - 1990|