论文标题
导师分配问题的整数线性编程：英国大学的一个实际情况
Integer Linear Programming for the Tutor Allocation Problem: A Practical Case in a British University
论文作者
论文摘要
在导师分配问题中，目标是为一组研讨会分配一组导师，以最大程度地提高导师的喜好。许多大学每年都解决了这个问题，每个大学都有自己的特定限制。在这项工作中，我们研究了爱丁堡大学数学学院的导师分配，并通过整数线性编程模型来解决它。我们在2019/2020案例上测试了该模型，并在使用的手动分配方面取得了重大改进。对随机创建实例的进一步测试表明，该模型可用于解决广泛关注的案例。我们还提供有意义的见解，了解输入参数（例如研讨会位置的数量和导师的偏好列表的长度）如何影响模型的性能以及满足的平均偏好次数。
In the Tutor Allocation Problem, the objective is to assign a set of tutors to a set of workshops in order to maximize tutors' preferences. The problem is solved every year by many universities, each having its own specific set of constraints. In this work, we study the tutor allocation in the School of Mathematics at the University of Edinburgh, and solve it with an integer linear programming model. We tested the model on the 2019/2020 case, obtaining a significant improvement with respect to the manual assignment in use. Further tests on randomly created instances show that the model can be used to address cases of broad interest. We also provide meaningful insights on how input parameters, such as the number of workshop locations and the length of the tutors' preference list, might affect the performance of the model and the average number of preferences satisfied.
