Strong multi-commodity flow formulations for the asymmetric traveling salesman problem

Abstract We provide new compact formulations of polynomial size for the asymmetric traveling salesman problem obtained through the Reformulation-Linearization Technique. The first one is obtained directly by this latter approach while the two others are derived by performing projections of this formulation on the variables of the existing models. We show that the devised formulations are stronger than the state-of-the-art models. Computational experiments conducted on benchmark instances for the classical variant and with precedence constraints confirm the better quality of the relaxations provided by our proposed formulations.

[1]  Warren P. Adams,et al.  A hierarchy of relaxation between the continuous and convex hull representations , 1990 .

[2]  Bart De Schutter,et al.  A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem , 2018, Eur. J. Oper. Res..

[3]  Luís Gouveia,et al.  The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints , 1999, Eur. J. Oper. Res..

[4]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[5]  Hanif D. Sherali,et al.  A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints , 2006, Discret. Optim..

[6]  Gilbert Laporte,et al.  Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints , 1991, Oper. Res. Lett..

[7]  Daniele Vigo,et al.  Chapter 6 Vehicle Routing , 2007, Transportation.

[8]  Paolo Toth,et al.  Models and algorithms for the Asymmetric Traveling Salesman Problem: an experimental comparison , 2012, EURO J. Transp. Logist..

[9]  Hanif D. Sherali,et al.  New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints , 2005, Oper. Res. Lett..

[10]  Luís Gouveia,et al.  Requiem for the Miller-Tucker-Zemlin subtour elimination constraints? , 2014, Eur. J. Oper. Res..

[11]  Hanif D. Sherali,et al.  On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems , 2002, Oper. Res..

[12]  R. A. Zemlin,et al.  Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

[13]  Temel Öncan,et al.  A comparative analysis of several asymmetric traveling salesman problem formulations , 2009, Comput. Oper. Res..

[14]  William J. Cook,et al.  Solution of a Large-Scale Traveling-Salesman Problem , 1954, 50 Years of Integer Programming.

[15]  H. P. Williams,et al.  A Survey of Different Integer Programming Formulations of the Travelling Salesman Problem , 2007 .

[16]  A. Claus.  A new formulation for the travelling salesman problem , 1984 .

[17]  Hanif D. Sherali,et al.  A Hierarchy of Relaxations and Convex Hull Characterizations for Mixed-integer Zero-one Programming Problems , 1994, Discret. Appl. Math..