Name
Abstract | ||
|---|---|---|
The maximally diverse grouping problem (MDGP) consists of finding a partition of a set of elements into a given number of mutually disjoint groups, while respecting the requirements of group size constraints and diversity. In this paper, we propose an iterated tabu search (ITS) algorithm for solving this problem. We report computational results on three sets of benchmark MDGP instances of size up to 960 elements and provide comparisons of ITS to five state-of-the-art heuristic methods from the literature. The results demonstrate the superiority of the ITS algorithm over alternative approaches. The source code of the algorithm is available for free download via the internet. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1057/jors.2014.23 | JORS |
Keywords | Field | DocType |
optimization,maximally diverse grouping,metaheuristics,tabu search | Heuristic,Mathematical optimization,Disjoint sets,Source code,Computer science,Partition of a set,Iterated function,Tabu search,The Internet,Metaheuristic | Journal |
Volume | Issue | ISSN |
66 | 4 | 0160-5682 |
Citations | PageRank | References |
1 | 0.34 | 13 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| G. Palubeckis | 1 | 8 | 1.85 |
| Armantas Ostreika | 2 | 2 | 1.71 |
| Dalius Rubliauskas | 3 | 1 | 0.34 |