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

In this paper, we present two General Variable Neighborhood Search for the Traveling Salesman Problem with Draft Limits (TSPDL), a recent variant 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 are tested on a set of benchmarks from the literature and computational experiments show their efficiency.