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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
