A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints

In this paper, we present a new class of polynomial length formulations for the asymmetric traveling salesman problem (ATSP) by lifting an ordered path-based model using logical restrictions in concert with the Reformulation-Linearization Technique (RLT). We show that a relaxed version of this formulation is equivalent to a flow-based ATSP model, which in turn is tighter than the formulation based on the exponential number of Dantzig-Fulkerson-Johnson (DFJ) subtour elimination constraints. The proposed lifting idea is applied to derive a variety of new formulations for the ATSP, and we explore several dominance relationships among these. We also extend these formulations to include precedence constraints in order to enforce a partial order on the sequence of cities to be visited in a tour. Computational results are presented to exhibit the relative tightness of our formulations and the efficacy of the proposed lifting process.

[1]  Matteo Fischetti,et al.  A Polyhedral Approach to the Asymmetric Traveling Salesman Problem , 1997 .

[2]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

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

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

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

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

[7]  R. Carr,et al.  Compact vs. Exponential-Size LP Relaxations , 2000 .

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

[9]  George B. Dantzig,et al.  Solution of a Large-Scale Traveling-Salesman Problem , 1954, Oper. Res..

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

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

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

[13]  Hanif D. Sherali,et al.  A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems , 1990, SIAM J. Discret. Math..

[14]  Hanif D. Sherali,et al.  Convergence and Computational Analyses for Some Variable Target Value and Subgradient Deflection Methods , 2006, Comput. Optim. Appl..