Stochastic Vehicle Routing with Random Travel Times

Astrid S. Kenyon () and David P. Morton ()
Additional contact information
Astrid S. Kenyon: Institute of Mathematics B, Technical University Graz, A-8010 Graz, Austria
David P. Morton: Graduate Program in Operations Research, The University of Texas at Austin, Austin, Texas 78712

Transportation Science, 2003, vol. 37, issue 1, 69-82

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

Date: 2003
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (78)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.37.1.69.12820 (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:37:y:2003:i:1:p:69-82

Access Statistics for this article

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