Probabilistic Traveling Salesman Problem with Deadlines

Ann M. Campbell () and Barrett W. Thomas ()
Additional contact information
Ann M. Campbell: Department of Management Sciences, University of Iowa, Iowa City, Iowa 52242
Barrett W. Thomas: Department of Management Sciences, University of Iowa, Iowa City, Iowa 52242

Transportation Science, 2008, vol. 42, issue 1, 1-21

Abstract: Time-constrained deliveries are one of the fastest growing segments of the delivery business, and yet there is surprisingly little literature that addresses time constraints in the context of stochastic customer presence. We begin to fill that void by introducing the probabilistic traveling salesman problem with deadlines (PTSPD). The PTSPD is an extension of the well-known probabilistic traveling salesman problem (PTSP) in which, in addition to stochastic presence, customers must also be visited before a known deadline. We present two recourse models and a chance constrained model for the PTSPD. Special cases are discussed for each model, and computational experiments are used to illustrate under what conditions stochastic and deterministic models lead to different solutions.

Keywords: vehicle routing; traveling salesman problem; probabilistic; deadlines (search for similar items in EconPapers)
Date: 2008
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (21)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.1070.0203 (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:42:y:2008:i:1:p:1-21

Access Statistics for this article

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