Skip to Main content Skip to Navigation
Journal articles

A variable neighborhood search for solving the multi-vehicle covering tour problem

Abstract : In this article, we consider a transportation problem with different kinds of locations: V , T, and W. The set T ⊂ V consists of vertices that must be visited through the use of potential locations in V and W consists of locations that must be covered. The problem consists in minimizing vehicle routes on a subset of V including T. We develop a variable neighborhood search heuristic based on a variable neighborhood descent in which a set of locations must be visited, whereas another subset must be close enough to the planned routes. We tested and compared our algorithm on datasets based on TSP Library instances.
Document type :
Journal articles
Complete list of metadata

https://hal-uphf.archives-ouvertes.fr/hal-03401415
Contributor : Mylène Delrue Connect in order to contact the contributor
Submitted on : Monday, October 25, 2021 - 1:11:39 PM
Last modification on : Tuesday, October 26, 2021 - 4:00:32 AM

Identifiers

Collections

Citation

Manel Kammoun, Houda Derbel, Mustapha Ratli, Bassem Jarboui. A variable neighborhood search for solving the multi-vehicle covering tour problem. Electronic Notes in Discrete Mathematics, Elsevier, 2015, 47, pp.285-292. ⟨10.1016/j.endm.2014.11.037⟩. ⟨hal-03401415⟩

Share

Metrics

Record views

13