https://hal-uphf.archives-ouvertes.fr/hal-03400545Kammoun, ManelManelKammounUniversité de Sfax - University of SfaxDerbel, HoudaHoudaDerbelUniversité de Sfax - University of SfaxRatli, MustaphaMustaphaRatliLAMIH - Laboratoire d'Automatique, de Mécanique et d'Informatique industrielles et Humaines - UMR 8201 - UVHC - Université de Valenciennes et du Hainaut-Cambrésis - CNRS - Centre National de la Recherche Scientifique - INSA Hauts-De-France - INSA Institut National des Sciences Appliquées Hauts-de-FranceJarboui, BassemBassemJarbouiEmirates College of Technology - Emirates College of TechnologyAn integration of mixed VND and VNS: the case of the multivehicle covering tour problemHAL CCSD2016[INFO] Computer Science [cs]Delrue, Mylène2021-10-25 09:40:362022-11-03 11:12:042021-10-25 09:40:36enJournal articles10.1111/itor.123551The 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.