| Title |
Comparative performance of three metaheuristic approaches for the maximally diverse grouping problem |
| Another Title |
Trijų lygmenų transporto protokolo našumo įvertinimas. |
| Authors |
Palubeckis, Gintaras ; Karčiauskas, Eimutis ; Riškus, Aleksas |
| DOI |
10.5755/j01.itc.40.4.977 |
| Full Text |
|
| Is Part of |
Informacinės technologijos ir valdymas = Information technology and control.. Kaunas : Technologija. 2011, t. 40, Nr. 4, p. 277-285.. ISSN 1392-124X. eISSN 2335-884X |
| Keywords [eng] |
combinatorial optimization ; maximally diverse grouping ; metaheuristics ; simulated annealing ; genetic algorithm ; variable neighborhood search |
| Abstract [eng] |
Given a set of elements and a symmetric matrix representing dissimilarities between them, the maximally diverse grouping problem asks to find a partitioning of the elements into a fixed number of restricted size-groups such that the sum of pairwise dissimilarities between elements in the same group is maximized. We present multistart simulated annealing, hybrid genetic and variable neighborhood search algorithms for solving this problem. We report on computational experiments that compare the performance of these algorithms on benchmark instances of size up to 2000 elements. |
| Published |
Kaunas : Technologija |
| Type |
Journal article |
| Language |
English |
| Publication date |
2011 |
| CC license |
|
