Tabu search for solving the black-and-white travelling salesman problem

The black-and-white travelling salesman problem (BWTSP) is an extension to the well-known TSP by partitioning the set of vertices into black and white vertices, and imposing cardinality and length constraints between two consecutive black vertices in a Hamiltonian tour. BWTSP has various applications in aircraft routing, telecommunication network design and logistics. In this paper, we develop several tabu search (TS) heuristics for solving the BWTSP. Our TS is built upon a new efficient neighbourhood structure, which exploits both the permutation and knapsack features of BWTSP. We also embed our TS as a heuristic procedure to improve the upper bound in a mixed-integer linear programming method. Extensive computational experiment on both benchmark and randomly generated instances shows effectiveness and efficiency of our algorithms. Our algorithms are able to obtain optimal and near optimal solutions to small instances in seconds, and find feasible solutions to large instances that have not been solved by the existing methods in the literature.

[1]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

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

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

[4]  Iraj Saniee,et al.  SONET Toolkit: A Decision Support System for Designing Robust and Cost-Effective Fiber-Optic Networks , 1995 .

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

[6]  Gilbert Laporte,et al.  New Insertion and Postoptimization Procedures for the Traveling Salesman Problem , 1992, Oper. Res..

[7]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Capacitated Arc Routing Problem , 2000, Oper. Res..

[8]  Michel Gendreau,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows , 1997, Transp. Sci..

[9]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[10]  Vicky H. Mak-Hau,et al.  Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs , 2007, Discret. Appl. Math..

[11]  Kalyan T. Talluri,et al.  The Four-Day Aircraft Maintenance Routing Problem , 1998, Transp. Sci..

[12]  J. K. Lenstra,et al.  Local Search in Combinatorial Optimisation. , 1997 .

[13]  Michel Gendreau,et al.  Handbook of Metaheuristics , 2010 .

[14]  Manuel Laguna,et al.  Tabu Search , 1997 .

[15]  O. J. Wasem,et al.  An algorithm for designing rings for survivable fiber networks , 1991 .

[16]  Mingchu Li,et al.  Using Gavish-Grave LP to Formulate the Directed Black and White Traveling Salesman Problem , 2007, International Conference on Computational Science.

[17]  Yves Crama,et al.  Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.

[18]  Gilbert Laporte,et al.  The Black and White Traveling Salesman Problem , 2006, Oper. Res..

[19]  Gilbert Laporte,et al.  Minimum cost path problems with relays , 2011, Comput. Oper. Res..

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

[21]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

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