A general variable neighborhood search variants for the travelling salesman problem with draft limits
- 351 Downloads
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.
KeywordsMaritime transportation Traveling salesman problem with draft limits Sequential variable neighborhood descent General variable neighborhood search
This work was supported by the Centre National de la Recherche Scientifique (CNRS), by the Campus interdisciplinaire de recherche, d’innovation technologique et de formation Internationale sur la Sécurité et l’Intermodalité des Transports (CISIT), and by the Laboratoire d’Automatique, de Mécanique et d’Informatique industrielles et Humaines (LAMIH) of the Université de Valenciennes et du Hainaut-Cambrésis.
- 1.Battara, M., Pessoa, A.A., Subramanian, A., Uchoa, E.: Exact algorithms for the travelling salesman problem with draft limits. Eur. J. Oper. Res. doi: 10.1016/j.ejor.2013.10.042
- 4.Johnson, D.S., McGeoch, L.A.: The traveling salesman problem: a case study in local optimization. In: Aarts, E.H.L., Lenstra, J.K. (eds.) Local Search in Combinatorial Optimization, pp. 215–310. Wiley, New York (1995)Google Scholar
- 5.Mjirda, A., Jarboui, B., Macedo, R., Hanafi, S., Mladenović, N.: A two phase variable neighborhood search for the multi-product inventory routing problem. Comput. Oper. Res. doi: 10.1016/j.cor.2013.06.006i
- 8.Mladenović, N., Todosijević, R., Urosević, D.: Two level General variable neighborhood search for Attractive traveling salesman problem. Comput. Oper. Res. doi: 10.1016/j.cor.2013.04.015