Geodesic
Two Meta-Heuristics for Solving the Multi-Vehicle Multi-Covering Tour Problem With a Constraint on the Number of Vertices
Yugoslav journal of operations research, Tome 31 (2021) no. 3, p. 299 Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts

Voir la notice de l'article

In this work we deal with a generalized variant of the multi-vehicle covering tour problem (m-CTP). The m-CTP consists of minimizing the total routing cost and satisfying the entire demand of all customers, without the restriction of visiting them all, so that each customer not included in any route is covered. In the m-CTP, only a subset of customers is visited to fulfill the total demand, but a restriction is put on the length of each route and the number of vertices that it contains. This paper tackles a generalized variant of the m-CTP, called the multi-vehicle multi-covering Tour Problem (mm-CTP), where a vertex must be covered several times instead of once. We study a particular case of the mm-CTP considering only the restriction on the number of vertices in each route and relaxing the constraint on the length (mm-CTP-p). A hybrid metaheuristic is developed by combining Genetic Algorithm (GA), Variable Neighborhood Descent method (VND), and a General Variable Neighborhood Search algorithm (GVNS) to solve the problem. Computational experiments show that our approaches are competitive with the Evolutionary Local Search (ELS) and Genetic Algorithm (GA), the methods proposed in the literature.
Classification : 90B85, 90C26
Keywords: Covering Tour Problem, Multi-Vehicle Multi-Covering Tour Problem, General Variable Neighborhood Search Algorithm, Genetic Algorithm, Variable Neighbor- hood Descent 
@article{YJOR_2021_31_3_a1,
     author = {Manel Kammoun and Houda Derbel and Bassem Jarboui},
     title = {Two {Meta-Heuristics} for {Solving} the {Multi-Vehicle} {Multi-Covering} {Tour} {Problem} {With} a {Constraint} on the {Number} of {Vertices}},
     journal = {Yugoslav journal of operations research},
     pages = {299 },
     year = {2021},
     volume = {31},
     number = {3},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/YJOR_2021_31_3_a1/}
}
TY  - JOUR
AU  - Manel Kammoun
AU  - Houda Derbel
AU  - Bassem Jarboui
TI  - Two Meta-Heuristics for Solving the Multi-Vehicle Multi-Covering Tour Problem With a Constraint on the Number of Vertices
JO  - Yugoslav journal of operations research
PY  - 2021
SP  - 299 
VL  - 31
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/YJOR_2021_31_3_a1/
LA  - en
ID  - YJOR_2021_31_3_a1
ER  - 
%0 Journal Article
%A Manel Kammoun
%A Houda Derbel
%A Bassem Jarboui
%T Two Meta-Heuristics for Solving the Multi-Vehicle Multi-Covering Tour Problem With a Constraint on the Number of Vertices
%J Yugoslav journal of operations research
%D 2021
%P 299 
%V 31
%N 3
%U http://geodesic.mathdoc.fr/item/YJOR_2021_31_3_a1/
%G en
%F YJOR_2021_31_3_a1
Manel Kammoun; Houda Derbel; Bassem Jarboui. Two Meta-Heuristics for Solving the Multi-Vehicle Multi-Covering Tour Problem With a Constraint on the Number of Vertices. Yugoslav journal of operations research, Tome 31 (2021) no. 3, p. 299 . http://geodesic.mathdoc.fr/item/YJOR_2021_31_3_a1/