Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs

The asymmetric travelling salesman problem with replenishment arcs (RATSP), arising from work related to aircraft routing, is a generalisation of the well-known ATSP. In this paper, we introduce a polynomial size mixed-integer linear programming (MILP) formulation for the RATSP, and improve an existing exponential size ILP formulation of Zhu [The aircraft rotation problem, Ph.D. Thesis, Georgia Institute of Technology, Atlanta, 1994] by proposing two classes of stronger cuts. We present results that under certain conditions, these two classes of stronger cuts are facet-defining for the RATS polytope, and that ATSP facets can be lifted, to give RATSP facets. We implement our polyhedral findings and develop a Lagrangean relaxation (LR)-based branch-and-bound (BNB) algorithm for the RATSP, and compare this method with solving the polynomial size formulation using ILOG Cplex 9.0, using both randomly generated problems and aircraft routing problems. Finally we compare our methods with the existing method of Boland et al. [The asymmetric traveling salesman problem with replenishment arcs, European J. Oper. Res. 123 (2000) 408-427]. It turns out that both of our methods are much faster than that of Boland et al. [The asymmetric traveling salesman problem with replenishment arcs, European J. Oper. Res. 123 (2000) 408-427], and that the LR-based BNB method is more efficient for problems that resemble the aircraft rotation problems.

[1]  P. Toth,et al.  Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem , 1980 .

[2]  Boris Polyak.  Minimization of unsmooth functionals , 1969 .

[3]  M. Grötschel,et al.  A polyhedral study of the asymmetric traveling salesman problem with time windows , 2000 .

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

[5]  George L. Nemhauser,et al.  The aircraft rotation problem , 1997, Ann. Oper. Res..

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

[7]  George L. Nemhauser,et al.  Flight String Models for Aircraft Fleeting and Routing , 1998, Transp. Sci..

[8]  Jacques Desrosiers,et al.  Time Constrained Routing and Scheduling , 1992 .

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

[10]  George L. Nemhauser,et al.  The asymmetric traveling salesman problem with replenishment arcs , 2000, Eur. J. Oper. Res..

[11]  G. Nemhauser,et al.  Integer Programming , 2020 .

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

[13]  Marshall L. Fisher,et al.  Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees , 1994, Oper. Res..

[14]  Robert S. Garfinkel,et al.  Technical Note - On Partitioning the Feasible Set in a Branch-and-Bound Algorithm for the Asymmetric Traveling-Salesman Problem , 1973, Oper. Res..

[15]  Daniele Vigo,et al.  A heuristic algorithm for the asymmetric capacitated vehicle routing problem , 1996 .

[16]  Gang Yu,et al.  A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows , 2002, Transp. Sci..

[17]  Niklas Kohl,et al.  An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation , 1997, Oper. Res..

[18]  Gerald L. Thompson,et al.  Computational Performance of Three Subtour Elimination Algorithms for Solving Asymmetric Traveling Salesman Problems. , 1977 .

[19]  M. Patriksson,et al.  Conditional subgradient optimization -- Theory and applications , 1996 .

[20]  Matteo Fischetti,et al.  Konrad-zuse-zentrum F ¨ Ur Informationstechnik Berlin Solving the Asymmetric Travelling Salesman Problem with Time Windows by Branch-and-cut Solving the Asymmetric Travelling Salesman Problem with Time Windows by Branch-and-cut , 2022 .

[21]  Jacques Desrosiers,et al.  2-Path Cuts for the Vehicle Routing Problem with Time Windows , 1997, Transp. Sci..

[22]  Renato F. Werneck,et al.  Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem , 2004, Math. Program..

[23]  N. Boland,et al.  Heuristic approaches to the asymmetric travelling salesman problem with replenishment arcs , 2000 .

[24]  Egon Balas,et al.  A restricted Lagrangean approach to the traveling salesman problem , 1981, Math. Program..

[25]  Gilbert Laporte,et al.  Heuristics for the black and white traveling salesman problem , 2003, Comput. Oper. Res..

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

[27]  T. H. C. Smith.  A LIFO implicit enumeration algorithm for the asymmetric travelling salesman problem using a one-arborescence relaxation , 1980 .

[28]  Marshall L. Fisher,et al.  An Applications Oriented Guide to Lagrangian Relaxation , 1985 .

[29]  Martin Desrochers,et al.  A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..

[30]  Paolo Toth,et al.  Exact solution of large-scale, asymmetric traveling salesman problems , 1995, TOMS.

[31]  Joseph F. Pekny,et al.  A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems , 1992, Math. Program..

[32]  Kavindra Malik,et al.  A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships , 1994, Ann. Oper. Res..

[33]  Matteo Fischetti,et al.  An additive bounding procedure for the asymmetric travelling salesman problem , 1992, Math. Program..

[34]  Matteo Fischetti,et al.  A polyhedral study of the asymmetric traveling salesman problem with time windows , 2000, Networks.

[35]  Steven E. Butt,et al.  An optimal solution procedure for the multiple tour maximum collection problem using column generation , 1999, Comput. Oper. Res..