scholarly journals A new enhanced support vector model based on general variable neighborhood search algorithm for supplier performance evaluation: A case study

2017 ◽  
Vol 10 (1) ◽  
pp. 293 ◽  
Author(s):  
Behnam Vahdani ◽  
S. Meysam Mousavi ◽  
R. Tavakkoli-Moghaddam ◽  
H. Hashemi
Keyword(s):  
Performance Evaluation ◽  
Variable Neighborhood Search ◽  
Search Algorithm ◽  
Vector Model ◽  
Neighborhood Search ◽  
Support Vector ◽  
Model Based ◽  
Supplier Performance ◽  
Neighborhood Search Algorithm

A variable neighborhood search algorithm for optimal protection coordination of power systems

2021 ◽  
Author(s):  
H. R. E. H. Bouchekara ◽  
M. S. Shahriar ◽  
M. S. Javaid ◽  
Y. A. Sha’aban ◽  
M. Zellagui ◽  
...  
Keyword(s):  
Power Systems ◽  
Variable Neighborhood Search ◽  
Search Algorithm ◽  
Neighborhood Search ◽  
Neighborhood Search Algorithm ◽  
Optimal Protection

scholarly journals Two meta-heuristics for solving the multi-vehicle multi-covering tour problem with a constraint on the number of vertices

2020 ◽  
pp. 14-14
Author(s):  
Manel Kammoun ◽  
Houda Derbel ◽  
Bassem Jarboui
Keyword(s):  
Genetic Algorithm ◽  
Local Search ◽  
Variable Neighborhood Search ◽  
Search Algorithm ◽  
Descent Method ◽  
Computational Experiments ◽  
Neighborhood Search ◽  
Variable Neighborhood Descent ◽  
Covering Tour Problem ◽  
Neighborhood Search Algorithm

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 developet 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.

Sign in / Sign up

Export Citation Format

Share Document