The Vehicle Routing Problem with Stochastic Travel Times

Gilbert Laporte, François Louveaux and Hélène Mercure
Additional contact information
Gilbert Laporte: Centre de recherche sur les transports, Université de Montréal, C.P. 6128, Succursale A, Montréal, Canada H3C 3J7
François Louveaux: Facultés Universitaires Notre-Dame de la Paix, 8 Rempart de la Vierge, B-5000 Namur, Belgium
Hélène Mercure: GERAD, École des Hautes Études Commerciales de Montréal, 5255 avenue Decelles, Montréal, Canada H3T 1V6

Transportation Science, 1992, vol. 26, issue 3, 161-170

Abstract: 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.

Date: 1992
References: Add references at CitEc
Citations: View citations in EconPapers (85)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.26.3.161 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:26:y:1992:i:3:p:161-170

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().