A general variable neighborhood search variants for the travelling salesman problem with draft limits

In this paper, we present two general variable neighborhood search (GVNS) based variants for solving the traveling salesman problem with draft limits (TSPDL), a recent extension of the traveling salesman problem. TSPDL arises in the context of maritime transportation. It consists of finding optimal Hamiltonian tour for a given ship which has to visit and deliver products to a set of ports while respecting the draft limit constraints. The proposed methods combine ideas in sequential variable neighborhood descent within GVNS. They are tested on a set of benchmarks from the literature as well as on a new one generated by us. Computational experiments show remarkable efficiency and effectiveness of our new approach. Moreover, new set of benchmarks instances is generated.

[1]  Anand Subramanian,et al.  Exact algorithms for the traveling salesman problem with draft limits , 2014, Eur. J. Oper. Res..

[2]  Raca Todosijevic,et al.  AN EFFICIENT GENERAL VARIABLE NEIGHBORHOOD SEARCH FOR LARGE TRAVELLING SALESMAN PROBLEM WITH TIME WINDOWS , 2012 .

[3]  David S. Johnson,et al.  The Traveling Salesman Problem: A Case Study in Local Optimization , 2008 .

[4]  P. Hansen,et al.  Variable neighbourhood search: methods and applications , 2010, Ann. Oper. Res..

[5]  Swaroop Darbha,et al.  3-Approximation algorithm for a two depot, heterogeneous traveling salesman problem , 2012, Optim. Lett..

[6]  Kjetil Fagerholt,et al.  The Traveling Salesman Problem with Draft Limits , 2012, Comput. Oper. Res..

[7]  Nenad Mladenovic,et al.  Two level General variable neighborhood search for Attractive traveling salesman problem , 2013, Comput. Oper. Res..

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

[9]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[10]  Bruce L. Golden,et al.  The hierarchical traveling salesman problem , 2013, Optim. Lett..

[11]  Dragan Urošević,et al.  A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem , 2011, Eur. J. Oper. Res..

[12]  Nenad Mladenovic,et al.  Variable neighborhood search for the travelling deliveryman problem , 2011, 4OR.

[13]  Nenad Mladenovic,et al.  A two phase variable neighborhood search for the multi-product inventory routing problem , 2014, Comput. Oper. Res..

[14]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.