The balanced maximally diverse grouping problem with block constraints
Publication date
2021-01-22
Document type
Forschungsartikel
Author
Organisational unit
Institut für Operations Management, Universität Hamburg
Scopus ID
Publisher
Elsevier
Series or journal
European Journal of Operational Research
ISSN
Periodical volume
294
Periodical issue
1
First page
42
Last page
53
Peer-reviewed
✅
Part of the university bibliography
Nein
Language
English
Keyword
Assignment
Balancing
Complexity analysis
Grouping
Integer programming
Abstract
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.
Version
Published version
Access right on openHSU
Metadata only access