A general neighborhood search for Traveling Salesman Problem with Draft Limits - Université Polytechnique des Hauts-de-France Access content directly
Conference Papers Year :

A general neighborhood search for Traveling Salesman Problem with Draft Limits

Abstract

Traveling Salesman Problem with Draft Limits (TSPDL) is a new variant of the well-known Traveling Salesman Problem (TSP), proposed recently in the context of maritime transportation. TSPDL consists of visiting and delivering goods for a set of ports using a ship located initially at a depot. Since each port has a delivery demand known in advance the ship starts tour with a load equal to the total demand, visits each port exactly once and comes back to the depot performing the lowest cost tour. However, to each port is assigned a draft limit, which represent the maximal allowed load on the ship upon entering some port. We propose two General Variable Neighborhood Search for solving Traveling Salesman Problem with Draft Limits. The proposed methods are tested on a set of benchmark instances from the literature and computational results shows that they are very efficient in solving this problem.
Not file

Dates and versions

hal-03473171 , version 1 (09-12-2021)

Identifiers

  • HAL Id : hal-03473171 , version 1

Cite

Raca Todosijević, Anis Mjirda, Said Hanafi. A general neighborhood search for Traveling Salesman Problem with Draft Limits. BALCOR 2013, XI Balkan Conference on Operational Research, Sep 2013, Belgrade, Serbia. ⟨hal-03473171⟩
12 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More