Skip to Main content Skip to Navigation
Journal articles

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

https://hal-uphf.archives-ouvertes.fr/hal-03666023
Contributor : Kathleen TORCK Connect in order to contact the contributor
Submitted on : Thursday, May 12, 2022 - 11:22:53 AM
Last modification on : Friday, May 13, 2022 - 3:36:45 AM

Identifiers

Collections

Citation

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, Springer Verlag, 2017, 11 (6), pp.1047-1056. ⟨10.1007/s11590-014-0788-9⟩. ⟨hal-03666023⟩

Share

Metrics

Record views

1