A general variable neighborhood search variants for the travelling salesman problem with draft limits - Université Polytechnique des Hauts-de-France Access content directly
Journal Articles Optimization Letters Year : 2017

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

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.
Not file

Dates and versions

hal-03666023 , version 1 (12-05-2022)

Identifiers

Cite

Raca Todosijević, Anis Mjirda, Marko Mladenovic, Said Hanafi, Bernard Gendron. A general variable neighborhood search variants for the travelling salesman problem with draft limits. Optimization Letters, 2017, 11 (6), pp.1047-1056. ⟨10.1007/s11590-014-0788-9⟩. ⟨hal-03666023⟩
2 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More