|Affiliations:||Mathematical Institute of the Serbian Academy of Sciences and Arts||Title:||A general variable neighborhood search for the travelling salesman problem with draft limits||Journal:||Proceedings of 2013 International Conference on Industrial Engineering and Systems Management, IEEE - IESM 2013||Conference:||International Conference on Industrial Engineering and Systems Management, IEEE - IESM 2013; Rabat; Morocco; 28 October 2013 through 30 October 2013||Issue Date:||1-Jan-2013||Abstract:||
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.
Show full item record
checked on Apr 15, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.