Single-commodity flow-based formulations and accelerated benders algorithms for the high-multiplicity asymmetric traveling salesman problem and its extensions

Abstract In this paper, we present a single-commodity flow-based formulation for the high-multiplicity asymmetric traveling salesman problem (HMATSP), which is an extension of the asymmetric traveling salesman problem (ATSP) wherein a city can be visited multiple times. We show that even though this formulation is not as tight as the best known formulation for the HMATSP, it is faster and easier to use for direct solution by CPLEX and can be used to model several variants or extensions of the HMATSP that have not been studied in the literature. Furthermore, we propose effective accelerated Benders algorithms that are demonstrated to solve instances of the HMATSP and its extensions, which are derived from the well-known ATSP libraries and involve up to 1001 cities, within an hour of CPU time. These are the largest-sized HMATSP instances solved to optimality in the literature.

[1]  Aguayo Bustos,et al.  MODELING, ANALYSIS, AND EXACT ALGORITHMS FOR SOME BIOMASS LOGISTICS SUPPLY CHAIN DESIGN AND ROUTING PROBLEMS. , 2016 .

[2]  Matteo Fischetti,et al.  A note on the selection of Benders’ cuts , 2010, Math. Program..

[3]  Gerd Finke,et al.  Identical coupled task scheduling: polynomial complexity of the cyclic case , 2015, J. Sched..

[4]  Christos H. Papadimitriou,et al.  The Traveling Salesman Problem with Many Visits to Few Cities , 1984, SIAM J. Comput..

[5]  Marc E. Posner,et al.  Parallel machine scheduling with high multiplicity , 2001, Math. Program..

[6]  Ron Shamir,et al.  Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem , 1991, Oper. Res..

[7]  David Gamarnik,et al.  From Fluid Relaxations to Practical Algorithms for High-Multiplicity Job-Shop Scheduling: The Holding Cost Objective , 2003, Oper. Res..

[8]  Thomas L. Magnanti,et al.  Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria , 1981, Oper. Res..

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

[10]  Nikolaos Papadakos,et al.  Practical enhancements to the Magnanti-Wong method , 2008, Oper. Res. Lett..

[11]  Hanif D. Sherali,et al.  Primary pharmaceutical manufacturing scheduling problem , 2014 .

[12]  Carlo Filippi,et al.  Exact and approximate algorithms for high-multiplicity parallel machine scheduling , 2009, J. Sched..

[13]  Michael Masin,et al.  Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem , 2014, J. Sched..

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

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

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

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

[18]  Alexander Grigoriev,et al.  On the high multiplicity traveling salesman problem , 2006, Discret. Optim..

[19]  Z. Taşkın.  Benders Decomposition ∗ , 2015 .

[20]  Hanif D. Sherali,et al.  New formulation for the high multiplicity asymmetric traveling salesman problem with application to the Chesapeake problem , 2011, Optim. Lett..

[21]  Yves Crama,et al.  Throughput optimization in two-machine flowshops with flexible operations , 2010, J. Sched..

[22]  Alexander Grigoriev,et al.  A Framework for the Complexity of High-Multiplicity Scheduling Problems , 2005, J. Comb. Optim..

[23]  Carlo Filippi.  An approximate algorithm for a high-multiplicity parallel machine scheduling problem , 2010, Oper. Res. Lett..

[24]  Shuzhong Zhang,et al.  Low-complexity algorithms for sequencing jobs with a fixed number of job-classes , 1996, Comput. Oper. Res..

[25]  Alexandra M. Newman,et al.  Benders decomposition: Solving binary master problems by enumeration , 2016, Oper. Res. Lett..

[26]  Tracy Kimbrel,et al.  High-multiplicity cyclic job shop scheduling , 2008, Oper. Res. Lett..

[27]  Nadia Brauner,et al.  High-multiplicity scheduling on one machine with forbidden start and completion times , 2016, J. Sched..

[28]  Egon Balas,et al.  A lift-and-project cutting plane algorithm for mixed 0–1 programs , 1993, Math. Program..

[29]  Joseph Y.-T. Leung,et al.  On Scheduling Independent Tasks with Restricted Execution Times , 1982, Oper. Res..

[30]  Harilaos N. Psaraftis,et al.  A Dynamic Programming Approach for Sequencing Groups of Identical Jobs , 1980, Oper. Res..

[31]  T. C. Edwin Cheng,et al.  An alternative approach for proving the NP-hardness of optimization problems , 2016, Eur. J. Oper. Res..

[32]  Stephen C. Graves,et al.  The Travelling Salesman Problem and Related Problems , 1978 .

[33]  Alexander Grigoriev,et al.  Multiplicity and complexity issues in contemporary production scheduling , 2007 .

[34]  Michael Rothkopf,et al.  Letter to the Editor - The Traveling Salesman Problem: On the Reduction of Certain Large Problems to Smaller Ones , 1966, Operational Research.