Article ID: | iaor19941755 |
Country: | Germany |
Volume: | 37 |
Start Page Number: | 273 |
End Page Number: | 283 |
Publication Date: | Dec 1993 |
Journal: | Mathematical Methods of Operations Research (Heidelberg) |
Authors: | Laporte G., Louveaux F.V., Dror M. |
Keywords: | programming: travelling salesman |
This paper considers a class of stochastic vehicle routing problems (SVRPs) with random demands, in which the number of potential failures per route is restricted either by the data or the problem constraints. These are realistic cases as it makes little sense to plan vehicle routes that systematically fail a large number of times. First, a chance constrained version of the problem is considered which can be solved to optimality by algorithms similar to those developed for the deterministic vehicle routing problem (VRP). Three classes of SVRP with recourse are then analyzed. In all cases, route failures can only occur at one of the last