Integer linear programming for the Tutor Allocation Problem
| Autor: | Giulia Caselli, Manuel Iori, Maxence Delorme |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2022 |
| Předmět: |
FOS: Computer and information sciences
Operations research Computer science Tutor Allocation Problem Set (abstract data type) Computer Science - Computers and Society Artificial Intelligence Matching under preferences Computers and Society (cs.CY) ComputingMilieux_COMPUTERSANDEDUCATION FOS: Mathematics TUTOR Preference list Integer programming Mathematics - Optimization and Control computer.programming_language Integer linear programming model Integer Linear Programming Assignment problem General Engineering Computer Science Applications Order (business) Optimization and Control (math.OC) Key (cryptography) computer |
| Zdroj: | Expert Systems with Applications. 187 |
| ISSN: | 1873-6793 0957-4174 |
| Popis: | 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. Comment: 15 pages, 4 figures |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect