Formation of student groups with the help of optimisation
研究如何将学生分组，使各组在某些方面尽可能均衡，且成员与之前分组相比变动最大，将其建模为混合整数规划问题，并开发启发式和元启发式算法在60秒内找到满意解。
We study the problem of forming groups of students so that the groups are as even as possible with respect to certain aspects and group members are changed as much as possible compared to previous groups, and formulate it as a mixed integer programming problem. We find that standard software cannot solve real life sized instances, so we develop several heuristics and metaheuristics for the problem. Computational tests are made on randomly generated instances as well as real life instances. Some of the heuristics give good solutions in short time, and tests on real life problems indicate that satisfactory solutions can be found within 60 seconds.