This Article Full Text (PDF) References Alert me when this article is cited Alert me if a correction is posted Services Email this article to a friend Similar articles in this journal Alert me to new issues of the journal Download to citation manager Citing Articles Citing Articles via HighWire Citing Articles via Google Scholar Google Scholar Articles by Kenyon, A. S. Articles by Morton, D. P. Search for Related Content

Stochastic Vehicle Routing with Random Travel Times

Institute of Mathematics B, Technical University Graz, A–8010 Graz, Austria
Graduate Program in Operations Research, The University of Texas at Austin, Austin, Texas 78712
kenyon{at}foni.net
morton{at}mail.utexas.edu

We consider stochastic vehicle routing problems on a network with random travel and service times. A fleet of one or more vehicles is available to be routed through the network to service each node. Two versions of the model are developed based on alternative objective functions. We provide bounds on optimal objective function values and conditions under which reductions to simpler models can be made. Our solution method embeds a branch–and–cut scheme within a Monte Carlo sampling–based procedure.

History: Received: July 2000; revised: August 2001; revised: October 2001; accepted: October 2001.

This article has been cited by other articles:

				S. Yan and C.-H. Tang An Integrated Framework for Intercity Bus Scheduling Under Stochastic Bus Travel Times Transportation Science, August 1, 2008; 42(3): 318 - 335. [Abstract] [PDF]

				L. M. Hvattum, A. Lokketangen, and G. Laporte Solving a Dynamic and Stochastic Vehicle Routing Problem with a Sample Scenario Hedging Heuristic Transportation Science, November 1, 2006; 40(4): 421 - 438. [Abstract] [PDF]