Geodesic
Variable Neighborhood Search for Maximum Diverse Grouping Problem
Yugoslav journal of operations research, Tome 24 (2014) no. 1, p. 21 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

This paper presents a general variable neighborhood search (GVNS) heuristic for solving the maximum diverse grouping problem. Extensive computational experiments performed on a series of large random graphs as well as on several instances of the maximum diversity problem taken from the literature show that the results obtained by GVNS consistently outperform the best heuristics from the literature.
Classification : 90C59, 90C27, 90C06, 90C20.
Keywords: Combinatorial optimization, Maximum Diverse Grouping, Metaheuristics, Variable Neighborhood Search. 
@article{YJOR_2014_24_1_a1,
     author = {Dragan Uro\v{s}evi\'c},
     title = {Variable {Neighborhood} {Search} for {Maximum} {Diverse} {Grouping} {Problem}},
     journal = {Yugoslav journal of operations research},
     pages = {21 },
     year = {2014},
     volume = {24},
     number = {1},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/YJOR_2014_24_1_a1/}
}
TY  - JOUR
AU  - Dragan Urošević
TI  - Variable Neighborhood Search for Maximum Diverse Grouping Problem
JO  - Yugoslav journal of operations research
PY  - 2014
SP  - 21 
VL  - 24
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/YJOR_2014_24_1_a1/
LA  - en
ID  - YJOR_2014_24_1_a1
ER  - 
%0 Journal Article
%A Dragan Urošević
%T Variable Neighborhood Search for Maximum Diverse Grouping Problem
%J Yugoslav journal of operations research
%D 2014
%P 21 
%V 24
%N 1
%U http://geodesic.mathdoc.fr/item/YJOR_2014_24_1_a1/
%G en
%F YJOR_2014_24_1_a1
Dragan Urošević. Variable Neighborhood Search for Maximum Diverse Grouping Problem. Yugoslav journal of operations research, Tome 24 (2014) no. 1, p. 21 . http://geodesic.mathdoc.fr/item/YJOR_2014_24_1_a1/