Integer Linear Programming for the Tutor Allocation Problem: A practical case in a British University
Integer Linear Programming for the Tutor Allocation Problem: A practical case in a British University
复制标题
导师分配问题的整数线性规划：英国大学的实际案例
DOI：
10.1016/j.eswa.2021.115967
复制
发表时间：
2022
影响因子：
8.5
通讯作者：
Caselli G
中科院分区：
文献类型：
--
作者：
Caselli G
在导师分配问题中，目标是将一组导师分配到一组工作坊，以最大化导师的偏好。每年都有许多大学解决这个问题，每个大学都有自己的一套特定的约束条件。本文研究了爱丁堡大学数学学院的导师分配问题，并利用整数线性规划模型进行了求解。我们在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 and we showed that such improvement could be maintained while optimizing other key metrics such as load balance among groups of tutors and total number of courses assigned. 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.