The Stochastic Capacitated Traveling Salesmen Location Problem: A Computational Comparison for a United States Instance☆

We study a problem in which a facility has to be located in a given area to serve a given number of customers. The position of the customers is not known. The service to the customers is carried out by several traveling salesmen. Each of them has a capacity in terms of the maximum number of customers that can be served in any tour. The aim is to determine the service zone (in a shape of a circle) that minimizes the expected cost of the traveled routes. The center of the circle is the location of the facility. Once the position of the customers is revealed, the customers located outside the service zone are served with a recourse action at a greater unit cost. For this problem, we compare the performance of two different approaches. The first is a solution based on a heuristic proposed for a similar well known problem and the second is a solution based on a stochastic second–order cone model. An illustrative example on a United States instance with 13509 nodes shows the different solutions and expected costs obtained by the two approaches.

[1]  Antonio Alonso Ayuso,et al.  Introduction to Stochastic Programming , 2009 .

[2]  Francisco Saldanha-da-Gama,et al.  Facility location and supply chain management - A review , 2009, Eur. J. Oper. Res..

[3]  Saïd Salhi,et al.  Location-routing: Issues, models and methods , 2007, Eur. J. Oper. Res..

[4]  Marc Goetschalckx,et al.  A stochastic programming approach for supply chain network design under uncertainty , 2004, Eur. J. Oper. Res..

[5]  K. A. Ariyawansa,et al.  A preliminary set of applications leading to stochastic semidefinite programs and chance-constrained semidefinite programs , 2011 .

[6]  Peng Sun,et al.  Computation of Minimum Volume Covering Ellipsoids , 2002, Oper. Res..

[7]  Dimitris Bertsimas.  Traveling Salesman Facility Location Problems , 1989, Transp. Sci..

[8]  Elisabetta Allevi,et al.  Stochastic Second-Order Cone Programming in Mobile Ad Hoc Networks , 2009 .

[9]  David Simchi-Levi,et al.  Minisum location of a traveling salesman , 1986, Networks.

[10]  Colin McDiarmid.  Probability Modelling and Optimal Location of a Travelling Salesman , 1992 .

[11]  R. Wets,et al.  Stochastic programming , 1989 .

[12]  K. A. Ariyawansa,et al.  Stochastic semidefinite programming: a new paradigm for stochastic optimization , 2006, 4OR.

[13]  Michal Kaut,et al.  Evaluation of scenario-generation methods for stochastic programming , 2007 .

[14]  Marida Bertocchi,et al.  Sensitivity Analysis in Stochastic Second Order Cone Programming for Mobile Ad Hoc Networks , 2010 .

[15]  Nitin H. Vaidya,et al.  Location-aided routing (LAR) in mobile ad hoc networks , 1998, MobiCom '98.

[16]  Ryuichi Hirabayashi,et al.  The capacitated traveling salesmen location problem , 1994 .

[17]  J A White,et al.  TRAVELING SALESMAN LOCATION PROBLEM , 1976 .

[18]  Donald Goldfarb,et al.  Second-order cone programming , 2003, Math. Program..

[19]  Andreas Drexl,et al.  Facility location models for distribution system design , 2005, Eur. J. Oper. Res..

[20]  David Simchi-Levi,et al.  A Heuristic Algorithm for the Traveling Salesman Location Problem on Networks , 1988, Oper. Res..

[21]  Alexander Shapiro,et al.  Stochastic programming approach to optimization under uncertainty , 2007, Math. Program..

[22]  Carlos F. Daganzo,et al.  The Distance Traveled to Visit N Points with a Maximum of C Stops per Vehicle: An Analytic Model and an Application , 1984, Transp. Sci..

[23]  Anton van den Hengel,et al.  Semidefinite Programming , 2014, Computer Vision, A Reference Guide.

[24]  Stein W. Wallace,et al.  Analyzing the quality of the expected value solution in stochastic programming , 2012, Ann. Oper. Res..

[25]  David Simchi-Levi.  The Capacitated Traveling Salesman Location Problem , 1991, Transp. Sci..

[26]  Xiangtong Qi,et al.  A logistics scheduling model: scheduling and transshipment for two processing centers , 2006 .

[27]  Patrizia Beraldi,et al.  A probabilistic model applied to emergency service vehicle location , 2009, Eur. J. Oper. Res..

[28]  Lawrence V. Snyder,et al.  Facility location under uncertainty: a review , 2006 .

[29]  Horst A. Eiselt,et al.  Location analysis: A synthesis and survey , 2005, Eur. J. Oper. Res..

[30]  D. Simchi-Levi,et al.  Heuristics and bounds for the travelling salesman location problem on the plane , 1987 .

[31]  Michal Kaut,et al.  Stochastic optimization models for a single-sink transportation problem , 2009, Comput. Manag. Sci..

[32]  Gilbert Laporte,et al.  Fifty Years of Vehicle Routing , 2009, Transp. Sci..

[33]  Alain Martel,et al.  The Stochastic Multiperiod Location Transportation Problem , 2010, Transp. Sci..