The probabilistic traveling salesman problem with time windows
 Stacy A. Voccia,
 Ann M. Campbell,
 Barrett W. Thomas
 … show all 3 hide
Abstract
With timedefinite 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 wellknown 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.
 blah 13676_2013_18_MOESM1_ESM.pdf (159KB)
 Balaprakash, P, Birattari, M, Stützle, T, Yuan, Z, Dorigo, M (2009) Estimationbased ant colony optimization and local search for the probabilistic traveling salesman problem. Swarm Intelligence 3: pp. 223242 CrossRef
 Bierwirth C, Mattfeld D, Kopfer H (1996) On permutation representations for scheduling problems. In: Voigt HM, Ebeling W, Rechenberg I, Schwefel HP (eds) Parallel Problem Solving from Nature PPSN IV, Lecture Notes in Computer Science, vol 1141. Springer,Berlin, pp 310–318
 Birattari, M, Balaprakash, P, Stutzle, T, Dorigo, M (2008) Estimationbased local search for stochastic combinatorial optimization using delta evaluations: A case study on the probabilistic traveling salesman problem. INFORMS J Comput 20: pp. 644658 CrossRef
 Campbell A, Thomas B (2006) PTSPD benchmark data sets. http://myweb.uiowa.edu/bthoa/PTSPDBenchmarkDataSets.htm. Accessed 22 Nov 2011
 Campbell A, Gendreau M, Thomas B (2011) The orienteering problem with stochastic travel and service times. Annals Operat Res :1–21
 Campbell, AM, Thomas, BW (2008) Probabilistic traveling salesman problem with deadlines. Transp Sci 42: pp. 121 CrossRef
 Campbell, AM, Thomas, BW (2009) Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines. Comput Operat Res 36: pp. 12311248 CrossRef
 Chang, TS, Wan, YW, Ooi, WT (2009) A stochastic dynamic traveling salesman problem with hard time windows. Eur J Operat Res 198: pp. 748759 CrossRef
 Charnsirisakskul, K, Griffin, PM, Keskinocak, P (2004) Order selection and scheduling with leadtime flexibility. IEE Trans 36: pp. 697707 CrossRef
 Chen, S, Golden, B, Wong, R, Zhong, H (2009) Arcrouting models for smallpackage local routing. Transp Sci 43: pp. 4355 CrossRef
 Datamonitor (2009) Express logistics industry profile: Europe. Tech. rep., http://www.datamonitor.com. Accessed 3 Nov 2011
 Datamonitor (2010a) Express logistics industry profile: Europe. Tech. rep., http://www.datamonitor.com. Accessed 3 Nov 2011
 Datamonitor (2010b) Express logistics industry profile: United States. Tech. rep., http://www.datamonitor.com. Accessed 13 May 2011
 Dumas, Y, Desrosiers, J, Gelinas, E, Solomon, MM (1995) An optimal algorithm for the traveling salesman problem with time windows. Operat Res 43: pp. 367371 CrossRef
 Ehmke, JF, Steinert, A, Mattfeld, DC (2012) Advanced routing for city logistics service providers based on timedependent travel times. J Comput Sci 4: pp. 193205
 Erera, AL, Savelsbergh, M, Uyar, E (2009) Fixed routes with backup vehicles for stochastic vehicle routing problems with time constraints. Networks 54: pp. 270283 CrossRef
 FedEx (2005) Surface mode optimization blended services freight forwarder service guide FDFF 201C. http://customcritical.fedex.com/us/serviceinfo/documents/pdf/fdff201c.pdf. Accessed 3 Nov 2011
 FedEx (2011) Service guide: Moneyback guarantee. http://www.fedex.com/us/serviceguide/options/moneybackguarantee.html. Accessed 3 Nov 2011
 Goodson JC, Ohlmann JW, Thomas BW (2012) Rollout policies for dynamic solutions to the multivehicle routing problem with stochastic demand and duration limits. Operations Research Submitted
 Hansen P, Mladenovic N, Brimberg J, Moreno~Perez JA (2010) Variable Neighborhood Search, chap. 3. Springer US, Boston, pp 61–86
 Jaillet, P (1988) A priori solution of a traveling salesman problem in which a random subset of the customers are visited. Operat Res 36: pp. 929936 CrossRef
 Jaillet P, Qi J, Sim M (2012) Routing optimization with deadlines under uncertainty Working paper
 Lei, H, Laporte, G, Guo, B (2011) The capacitated vehicle routing problem with stochastic demands and time windows. Comput Operat Res 38: pp. 17751783 CrossRef
 Li, X, Tian, P, Leung, SC (2010) Vehicle routing problems with time windows and stochastic travel and service times: Models and algorithm. Int J Prod Econ 125: pp. 137145 CrossRef
 Liu, YH (2008) Diversified local search strategy under scatter search framework for the probabilistic traveling salesman problem. Eur J Operat Res 191: pp. 332346 CrossRef
 Manni, E (2009) Topics in realtime fleet management.. 4OR: A Quarterly J Operat Res 7: pp. 203206 CrossRef
 Marinakis Y, Marinaki M (2009) A hybrid honey bees mating optimization algorithm for the probabilistic traveling salesman problem. In: 2009 IEEE Congress on Evolutionary Computation, IEEE, pp 1762–1769
 Marinakis, Y, Marinaki, M (2010) A Hybrid MultiSwarm Particle Swarm Optimization algorithm for the Probabilistic Traveling Salesman Problem. Comput Operat Res 37: pp. 432442 CrossRef
 Marinakis, Y, Migdalas, A, Pardalos, PM (2008) Expanding neighborhood search– GRASP for the probabilistic traveling salesman problem. Optim Lett 2: pp. 351361 CrossRef
 Mohan, S, Gendreau, M, Rousseau, JM (2008) The stochastic Eulerian tour problem. Transp Sci 42: pp. 166174 CrossRef
 Schultz JD (2008) 2008 is it trucking’s bounce back year?. Logistics Manag 47(3):S65 – S71
 da Silva, RF, Urrutia, S (2010) A general VNS heuristic for the traveling salesman problem with time windows. Discrete Optim 7: pp. 203211 CrossRef
 da Silva RF, Urrutia S (2010) The traveling salesman problem with time windows—approaches & additional resources. http://homepages.dcc.ufmg.br/rfsilva/tsptw. Accessed 22 Nov2011
 Slotnick, SA, Sobel, MJ (2005) Manufacturing leadtime rules: Customer retention versus tardiness costs. Eur J Operat Res 163: pp. 825856 CrossRef
 Tang, H, MillerHooks, E (2005) Algorithms for a stochastic selective traveling salesperson problem. J Operat Res Soc 56: pp. 439452 CrossRef
 Terreri, A (2011) Technology powers LTL leaders. World Trade, WT 100: pp. 1823
 United Parcel Service (2011) Support FAQ. http://www.ups.com/content/us/en/resources/sri/ctc1.html. Accessed 3 Nov 2011
 Weyland D, Bianchi L, Gambardella L (2009) New ApproximationBased Local Search Algorithms for the Probabilistic Traveling Salesman Problem, Lecture Notes in Computer Science, vol 5717. Springer, Berlin, pp 681–688
 Weyland D, Montemanni R, Gambardella LM (2011) New heuristics for the probabilistic traveling salesman problem with deadlines based on quasiparallel monte carlo sampling, submitted
 Weyland D, Montemanni R, Gambardella LM (2012) Hardness results for the probabilistic traveling salesman problem with deadlines Working paper
 Title
 The probabilistic traveling salesman problem with time windows
 Journal

EURO Journal on Transportation and Logistics
Volume 2, Issue 12 , pp 89107
 Cover Date
 20130501
 DOI
 10.1007/s1367601300180
 Print ISSN
 21924376
 Online ISSN
 21924384
 Publisher
 SpringerVerlag
 Additional Links
 Topics
 Keywords

 Traveling salesman problem
 Probabilistic
 Time windows
 Authors

 Stacy A. Voccia ^{(1)}
 Ann M. Campbell ^{(1)}
 Barrett W. Thomas ^{(1)}
 Author Affiliations

 1. Department Of Management Sciences, University Of Iowa, 108 John Pappajohn Business Building, Iowa City, IA, 522421994, USA