The University Course Timetabling Problem: A case study Design of the LSM course timetable using an Iterated Local Search
Files
DIVE_60401200_2020.pdf
Open access - Adobe PDF
- 1.67 MB
Details
- Supervisors
- Faculty
- Degree label
- Abstract
- Every year, universities face the challenge to build a course timetable which due to their large size, usually require a huge amount of time and human resources. In this thesis, we develop a model of an automated course timetable for the Louvain School of Management (LSM-UCLouvain). To do so, a hybridised algorithm has been designed and implemented in Mosel language. The model is composed of two phases. The first stage consists in generating a feasible initial solution using the combination of a Graph Colouring algorithm and a Maximum Matching algorithm. The second phase consists in applying a metaheuristic called "Iterated Local Search" to improve the initial solution until reaching a satisfactory solution timetable, ready to use. That strategy has produced effective and promising results, and the best solution obtained seemed to outperform the real LSM timetable value currently used. However, further improvements and data refinement may be necessary to be used by the LSM.
Citations
Dive, E. (2020). The University Course Timetabling Problem: A case study Design of the LSM course timetable using an Iterated Local Search. https://dial-mem.test.bib.ucl.ac.be/handle/2078.2/17830