In this paper, we present general formulations for the stochastic vehicle routing problem with capacity restrictions in which the m vehicle tours have to be planned before the actual supplies to be collected at each city become known. Two variants of the models are considered: they differ in terms of the time at which the information becomes available. Given the computational intractability of the general model, we then derive bounds on the optimal solutions. These bounds are obtained by solving related simpler problems.