Journal article
The probabilistic traveling salesman problem with time windows
EURO Journal on Transportation and Logistics, Vol.2(1-2), pp.89-107
05/01/2013
DOI: 10.1007/s13676-013-0018-0
Abstract
With time-definite services occupying a large part of the delivery business, the explicit consideration of time windows into a route design has the potential to reduce transportation costs and the penalty costs associated with late deliveries. In this paper, we incorporate time windows into a priori routes by introducing the probabilistic traveling salesman problem with time windows (PTSPTW). The PTSPTW is an extension of the well-known probabilistic traveling salesman problem, where in addition to stochastic customer presence, each customer has an associated time window during which deliveries must be made. We present a recourse model and a variable neighborhood search with variable neighborhood descent algorithm to solve problem instances. We also present computational experiments that demonstrate the value of incorporating stochasticity into the problem.
Details
- Title: Subtitle
- The probabilistic traveling salesman problem with time windows
- Creators
- Stacy A. Voccia - University of IowaAnn M. Campbell - University of IowaBarrett W. Thomas - University of Iowa
- Resource Type
- Journal article
- Publication Details
- EURO Journal on Transportation and Logistics, Vol.2(1-2), pp.89-107
- DOI
- 10.1007/s13676-013-0018-0
- ISSN
- 2192-4376
- eISSN
- 2192-4384
- Publisher
- Elsevier B.V
- Language
- English
- Date published
- 05/01/2013
- Academic Unit
- Bus Admin College; Business Analytics
- Record Identifier
- 9984380558602771
Metrics
13 Record Views