Algorithms for dividing students into study groups
Abstract
Importance: After the first or second year of study, students in a specific field, such as «Economics», are assigned to specialized tracks, for example, «Finance and Credit» or «Enterprise and Organizational Economics». Once students are distributed across these tracks, it becomes necessary to form study groups. Purpose: To develop algorithms for assigning students to study groups within a track based on two optimization criteria: Maximizing the «similarity» of average academic scores across groups within the same track. Maximizing the «similarity» of group distribution to the previous one. Research design: Development of algorithms for distributing students into specialized study groups based on four optimization criteria: maximizing the «similarity» of the total and average scores within groups of the same profile, maximizing the «similarity» of academic performance among students within each group, and maximizing the «similarity» of distribute on compared to previous groupings. Results: For each problem, mixedinteger programming models were formulated, along with greedy heuristic algorithms. The mathematical models and algorithms were tested on realworld data from Saint Petersburg State University of Economics when distributing students in the «Economics» program.
Downloads
References
2. Мину М. Математическое программирование. Теория и алгоритмы. Москва, Наука, 1990. 485 c.
3. Brimberg J., Janićijević S., Mladenović N. et al. Solving the clique partitioning problem as a maximally diverse grouping problem // Optim Lett, 2017, no. 11, pp. 1123-1135.
4. Cormen T.H., Leiserson C.E., Rivest R.L., Stein C. Introduction to Algorithms, third edition. The MIT Press Cambridge, Massachusetts London, England, 2009. 1312 p.
5. De Amorim, S.G., Barthélemy JP. & Ribeiro C.C. Clustering and clique partitioning: Simulated annealing and tabu search approaches // Journal of Classification, 1992, no. 9, pp. 17-41.
6. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company. 1979. 238 p.
7. Gini C. On the Measure of Concentration with Special Reference to Income and Statistics // Colorado College Publication, General Series, 1936, no. 208, pp. 73-79.
8. Graham R.L. Bounds on multiprocessing timing anomalies // SIAM Journal on Applied Mathematics, 1969, no. 17(2), pp. 416-429.
9. Korf R. Multi-Way Number Partitioning // IJCAI International Joint Conference on Artificial Intelligence, 2009, pp. 538-543.
10. Korf R. Objective functions for MultiWay number partitioning // Proceedings of the International Symposium on Combinatorial Search, 2010, no. 1(1), pp. 71-72.
11. Melo R., Ribeiro C., Riveaux M.J. The minimum quasi-clique partitioning problem: Complexity, formulations, and a computational study // Information Sciences, 2022, no. 612.
12. Ribeiro C., Riveaux M.J. An exact algorithm for the maximum quasi-clique problem // International Transactions in Operational Research, 2019, no. 26.
13. Zhou Q., Zhu T., Wu Q., Jiang Z., Wang W. An efficient iterated local search for the minimum quasi-clique partitioning problem // Computers & Operations Research, 2025, no. 179.
