Skip to Main content Skip to Navigation
Conference papers

A general variable neighborhood search for the travelling salesman problem with draft limits

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.
Document type :
Conference papers
Complete list of metadata

https://hal-uphf.archives-ouvertes.fr/hal-03472974
Contributor : Kathleen Torck Connect in order to contact the contributor
Submitted on : Thursday, December 9, 2021 - 4:15:22 PM
Last modification on : Friday, December 10, 2021 - 3:54:10 AM

Identifiers

  • HAL Id : hal-03472974, version 1

Collections

Citation

Raca Todosijević, Anis Mjirda, Said Hanafi, Nenad Mladenovic, Bernard Gendron. A general variable neighborhood search for the travelling salesman problem with draft limits. International Conference on Industrial Engineering and Systems Management - IESM2013, Oct 2013, Rabat, Morocco. ⟨hal-03472974⟩

Share

Metrics

Les métriques sont temporairement indisponibles