4.7 Article

The balanced maximally diverse grouping problem with block constraints

期刊

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 294, 期 1, 页码 42-53

出版社

ELSEVIER
DOI: 10.1016/j.ejor.2021.01.029

关键词

Assignment; Balancing; Integer programming; Complexity analysis; Grouping

向作者/读者索取更多资源

This paper investigates the problem of maximally diverse grouping, describing optimal solutions for realistic input data and developing a new linear objective function for determining the best balanced solution. An integer program, detailed complexity analysis, and computational study are presented in the research.
The paper investigates the assignment of items to groups such that all groups are balanced, i.e. all groups contain the same number of items and all pairs of groups are as homogeneous as possible regarding the attribute values of the assigned items. Therefore, we adapt the maximally diverse grouping problem (MDGP). It is especially known in the context of students being assigned to groups. We describe the set of optimal solutions for the MDGP for realistic input data and develop a new linear objective function to determine the best balanced solution amongst all optimal solutions for the MDGP by weighting the biggest diversity between two groups with a higher value than the second biggest and so on. Furthermore, an integer program, a detailed complexity analysis, and a computational study are presented. (c) 2021 Elsevier B.V. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据