Maximally diverse grouping: an iterated tabu search approach

Maximally diverse grouping: an iterated tabu search approach

0.00 Avg rating0 Votes
Article ID: iaor201525783
Volume: 66
Issue: 4
Start Page Number: 579
End Page Number: 592
Publication Date: Apr 2015
Journal: Journal of the Operational Research Society
Authors: , ,
Keywords: heuristics: tabu search
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.

Reviews

Required fields are marked *. Your email address will not be published.