A general variable neighborhood search for the travelling salesman problem with draft limits - Université Polytechnique des Hauts-de-France Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

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

Résumé

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.
Fichier non déposé

Dates et versions

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

Identifiants

  • HAL Id : hal-03472974 , version 1

Citer

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⟩
11 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More