Decomposition-based exact algorithms for risk-constrained traveling salesman problems with discrete random arc costs

Recently increasing attentions have been given to uncertainty handling in network optimization research. Along this trend, this paper discusses traveling salesman problem with discrete random arc costs while incorporating risk constraints. Minimizing expected total cost might not be enough because total costs of some realizations of the random arc costs might exceed the resource limit. To this respect, this paper presents a model of the traveling salesman problem that incorporates risk constraints based on Conditional Value at Risk to evaluate those worst-cost scenarios. Exact solution methods are developed and applied on the risk-constrained traveling salesman problem. Numerical experiments are conducted, and the results show the ability of the proposed methods in reducing the computational complexity.

[1]  George L. Nemhauser,et al.  Dynamic Network Flow with Uncertain Arc Capacities: Decomposition Algorithm and Computational Results , 2001, Comput. Optim. Appl..

[2]  Dimitris Bertsimas,et al.  A Vehicle Routing Problem with Stochastic Demand , 1992, Oper. Res..

[3]  Alexander Shapiro,et al.  The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study , 2003, Comput. Optim. Appl..

[4]  Sergey Sarykalin,et al.  Value-at-Risk vs. Conditional Value-at-Risk in Risk Management and Optimization , 2008 .

[5]  Timo Leipälä,et al.  On the solutions of stochastic traveling salesman problems , 1978 .

[6]  R. Rockafellar,et al.  Optimization of conditional value-at risk , 2000 .

[7]  Panos M. Pardalos,et al.  Robust optimization of graph partitioning involving interval uncertainty , 2012, Theor. Comput. Sci..

[8]  T. Glenn Bailey,et al.  Reactive Tabu Search in unmanned aerial reconnaissance simulations , 1998, 1998 Winter Simulation Conference. Proceedings (Cat. No.98CH36274).

[9]  Clayton W. Commander,et al.  Polynomial-time identification of robust network flows under uncertain arc failures , 2009, Optim. Lett..

[10]  Swaroop Darbha,et al.  3-Approximation algorithm for a two depot, heterogeneous traveling salesman problem , 2012, Optim. Lett..

[11]  Alejandro Toriello,et al.  A Dynamic Traveling Salesman Problem with Stochastic Arc Costs , 2014, Oper. Res..

[12]  Swaroop Darbha,et al.  Today's Traveling Salesman Problem , 2010, IEEE Robotics & Automation Magazine.

[13]  Jorge E. Mendoza,et al.  A multi-space sampling heuristic for the vehicle routing problem with stochastic demands , 2013, Optim. Lett..

[14]  Panos M. Pardalos,et al.  A Random Keys Based Genetic Algorithm for the Target Visitation Problem , 2007 .

[15]  Alexandre M. Baptista,et al.  A Comparison of VaR and CVaR Constraints on Portfolio Selection with the Mean-Variance Model , 2004, Manag. Sci..

[16]  D. O. Marlow,et al.  The Travelling Salesman Problem in Maritime Surveillance - Techniques, Algorithms and Analysis , 2007 .

[17]  S. Travis Waller,et al.  A mean-variance model for the minimum cost flow problem with stochastic arc costs , 2010 .

[18]  K. Sundar,et al.  Heuristics for Routing Heterogeneous Unmanned Vehicles with Fuel Constraints , 2014 .

[19]  Q. Zheng,et al.  Loss-constrained minimum cost flow under arc failure uncertainty with applications in risk-aware kidney exchange , 2015 .

[20]  Panos M. Pardalos,et al.  Stochastic and Risk Management Models and Solution Algorithm for Natural Gas Transmission Network Expansion and LNG Terminal Location Planning , 2010, J. Optim. Theory Appl..

[21]  Gilbert Laporte,et al.  A concise guide to the Traveling Salesman Problem , 2010, J. Oper. Res. Soc..