Skip to Main content Skip to Navigation
Journal articles

Solving the maximally diverse grouping problem by skewed general variable neighborhood search

Abstract : The maximally diverse grouping problem requires finding a partition of a given set of elements into a fixed number of mutually disjoint subsets (or groups) in order to maximize the overall diversity between elements of the same group. In this paper we develop a new variant of variable neighborhood search for solving the problem. The extensive computational results show that our new heuristic significantly outperforms the current state of the art. Moreover, the best known solutions have been improved on 531 out of 540 test instances from the literature.
Document type :
Journal articles
Complete list of metadata

https://hal-uphf.archives-ouvertes.fr/hal-03401528
Contributor : Mylène Delrue Connect in order to contact the contributor
Submitted on : Monday, October 25, 2021 - 1:38:45 PM
Last modification on : Tuesday, October 26, 2021 - 4:00:31 AM

Identifiers

Collections

Citation

Jack Brimberg, Nenad Mladenovic, Dragan Urošević. Solving the maximally diverse grouping problem by skewed general variable neighborhood search. Information Sciences, Elsevier, 2015, 295, pp.650-675. ⟨10.1016/j.ins.2014.10.043⟩. ⟨hal-03401528⟩

Share

Metrics

Record views

7