DocumentCode
685122
Title
A general variable neighborhood search for the travelling salesman problem with draft limits
Author
Todosijevic, Raca ; Mjirda, Anis ; Hanafi, Said ; Mladenovic, Nenad ; Gendron, Bernard
Author_Institution
LAMIH, UVHC Le Mont Houy, Valenciennes, France
fYear
2013
fDate
28-30 Oct. 2013
Firstpage
1
Lastpage
4
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.
Keywords
sea ports; search problems; ships; transportation; travelling salesman problems; TSPDL; draft limit constraints; general variable neighborhood search; maritime transportation; ports; travelling salesman problem; Benchmark testing; Electronic mail; Marine vehicles; Operations research; Ports (Computers); Search problems; Traveling salesman problems;
fLanguage
English
Publisher
ieee
Conference_Titel
Industrial Engineering and Systems Management (IESM), Proceedings of 2013 International Conference on
Conference_Location
Rabat
Type
conf
Filename
6761364
Link To Document