A note on the Miller-Tucker-Zemlin model for the asymmetric traveling salesman problem

An enhancement of the Miller-Tucker-Zemlin (MTZ) model for the asymmetric traveling salesman problem is presented by introducing additional constraints to the initial formulation. The constraints account for ordering of boundary nodes as well as all successive nodes in the salesman tour. The enhanced MTZ subtour elimination constraints are computationally compared with the basic MTZ constraints and the version of MTZ lifted by Desrochers and Laporte. The proposed enhancement shows improved performance on a number of asymmetric TSPLIB instances.

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

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

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

[4]  Luís Gouveia,et al.  The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints , 2001, Discret. Appl. Math..

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

[6]  Weixiong Zhang,et al.  The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests , 2001, ALENEX.

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

[8]  Gregory Gutin,et al.  Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP , 2001, Discret. Appl. Math..

[9]  Christos H. Papadimitriou,et al.  Local Search for the Asymmetric Traveling Salesman Problem , 1980, Oper. Res..

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

[11]  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..

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