Skip to Main content Skip to Navigation
Journal articles

An integration of mixed VND and VNS: the case of the multivehicle covering tour problem

Abstract : The multivehicle covering tour problem (m-CTP) is a transportation problem with different kinds of locations, where a set of locations must be visited while another set must be close enough to planned routes. Given two sets of vertices V and W, where V represents the set of vertices that may be visited and W is a set of vertices that must be covered by up to m vehicles, the m-CTP problem is to minimize vehicle routes on a subset of V including T, which represents the subset of vertices that must be visited through the use of potential locations in V. The variant of m-CTP without a route-length constraint is treated in this paper. To tackle this problem, we propose a variable neighborhood search heuristic based on variable neighborhood descent method. Experiments were conducted using the datasets based on traveling salesman problem library instances.
Document type :
Journal articles
Complete list of metadata

https://hal-uphf.archives-ouvertes.fr/hal-03400545
Contributor : Mylène Delrue Connect in order to contact the contributor
Submitted on : Monday, October 25, 2021 - 9:40:36 AM
Last modification on : Wednesday, November 3, 2021 - 5:24:23 AM

Identifiers

Collections

Citation

Manel Kammoun, Houda Derbel, Mustapha Ratli, Bassem Jarboui. An integration of mixed VND and VNS: the case of the multivehicle covering tour problem. International Transactions in Operational Research, Wiley, 2016, 24 (3), pp.663-679. ⟨10.1111/itor.12355⟩. ⟨hal-03400545⟩

Share

Metrics

Record views

4