Abstract
Workgroup assignment problems commonly appear in various settings including international business schools. Especially if diverse people, like students, need to be divided into workgroups one may seek environments where diversity is fostered by generating heterogeneous workgroups. We study a problem of workgroups diversity maximization, i.e., the problem of building workgroups with the goal of maximizing intra-group diversity, while minimizing inter-group heterogeneity. For solving this problem with different objectives we propose a hybrid metaheuristic approach which combines local search techniques with a population based metaheuristic, including the cross entropy method as well as path relinking as ingredients. Numerical results are presented on some real-world instances.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Baker, K.R., Powell, S.G.: Methods for Assigning Students to Groups: A Study of Alternative Objective Functions. Journal of the Operational Research Society 53(4), 397–404 (2002)
Beheshtian-Ardekani, M., Mahmood, M.A.: Development and Validation of a Tool for Assigning Students to Groups for Class Projects. Decision Sciences 17(1), 92–113 (1986)
Caserta, M., Quiñonez, E.: A Cross Entropy-Lagrangean Hybrid Algorithm for the Multi-item Capacitated Lot-sizing Problem with Setup Times. Computers & Operations Research 36(2), 530–548 (2009)
De Boer, P., Kroese, D.P., Mannor, S., Rubinstein, R.Y.: A Tutorial on the Cross-Entropy Method. Annals of Operations Research 134, 19–67 (2005)
Desrosiers, J., Mladenovic, N., Villeneuve, D.: Design of Balanced MBA Student Teams. Journal of the Operational Research Society 56(1), 60–66 (2005)
Fan, Z.P., Chen, Y., Zeng, S.: A Hybrid Genetic Algorthmic Approach to the Maximally Diverse Grouping Problem. Journal of the Operational Research Society 62(7), 1423–1430 (2011)
Mingers, J., O’Brien, F.A.: Creating Students Groups with Similar Characteristics: A Heuristic Approach. Omega 23(3), 313–321 (1995)
O’Brien, F.A., Mingers, J.: A Heuristic Algorithm for the Equitable Partitioning Problem. Omega 25(2), 215–223 (1997)
Rubinstein, R.Y., Kroese, D.P.: The Cross-Entropy Method: A Unified Approach to Combinatorial Optimization, Monte Carlo Simulation, and Machine Learning. Springer, Berlin (2004)
Scholl, A.: Robuste Planung und Optimierung: Grundlagen - Konzepte und Methoden - Experimentelle Untersuchungen. Physica, Heidelberg (2004)
Weitz, R.R., Jelassi, M.T.: Assigning Students to Groups: A Multi-Criteria Decision Support System Approach. Decision Sciences 23(3), 746–757 (1992)
Weitz, R.R., Lakshminarayanan, S.: An Empirical Comparison of Heuristic Methods for Creating Maximally Diverse Groups. Journal of the Operational Research Society 49(6), 635–646 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Caserta, M., Voß, S. (2013). Workgroups Diversity Maximization: A Metaheuristic Approach. In: Blesa, M.J., Blum, C., Festa, P., Roli, A., Sampels, M. (eds) Hybrid Metaheuristics. HM 2013. Lecture Notes in Computer Science, vol 7919. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38516-2_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-38516-2_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38515-5
Online ISBN: 978-3-642-38516-2
eBook Packages: Computer ScienceComputer Science (R0)