A general variable neighborhood search variants for the travelling salesman problem with draft limits |
| |
Authors: | Raca Todosijevi? Anis Mjirda Marko Mladenovi? Saïd Hanafi Bernard Gendron |
| |
Institution: | 1.LAMIH-UVHC,Le Mont Houy Valenciennes, Cedex 9,France;2.CIRRELT,Université de Montréal,Québec,Canada |
| |
Abstract: | 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. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|