Laporte, Gilbert; Louveaux, François; Mercure, Hélène The vehicle routing problem with stochastic travel times. (English) Zbl 0761.90035 Transp. Sci. 26, No. 3, 161-170 (1992). Summary: This paper considers vehicle routing problems (VRPs) with stochastic service and travel times, in which vehicles incur a penalty proportional to the duration of their route in excess of a preset constant. Three mathematical programming models are presented: a chance constrained model, a three-index simple recourse model and a two-index recourse model. A general branch and cut algorithm for the three models is described. Computational results indicate that moderate size problems can be solved to optimality. Cited in 61 Documents MSC: 90B06 Transportation, logistics and supply chain management 90C15 Stochastic programming 90-02 Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming Keywords:vehicle routing; stochastic service and travel times; chance constrained model; three-index simple recourse model; branch and cut algorithm PDFBibTeX XMLCite \textit{G. Laporte} et al., Transp. Sci. 26, No. 3, 161--170 (1992; Zbl 0761.90035) Full Text: DOI