Building an application that optimizes the university’s bachelor class schedule
Details
- Supervisors
- Faculty
- Degree label
- Abstract
- For any acad emic programme, achiving an optimized course schedule has always b een a challenging task. Such a challenge is known as the course timetabling problem, which is one the most widely studied optimization problems and is classified into the NP-Complete category. A course timetable normally involves lots of hard constraints and events, which makes solving the timetabling p roblem highly complicated and time-consuming, esp ecially with manual scheduling. As such, various algorithms have b een designed and develop ed into sof tware to ols in order to assist administrative staffs in approaching a high-quality timetable. For years, th e Louvain Scho ol of Engineering (EPL) has b een using an automatic s cheduling to ol based on the MIP mo del develop ed by Professor Francois Glineur. Among many approaches suggested by researchers, Cons traint Programming (CP) has b een considered highly effective in tackling the mentioned problems while providing a h igh level of declarative language that allows users to mo del problems and describ e the prop erties of solution. Clearly, the expressiveness of CP reduces the amount of work required by the mo deler. This thesis work aims at providing a CP-based implementation of an automatic schedu lin g to ol that solves the course timetabling problem. Ad dition ally, the to ol is designed in such a way that it can b e easily mo dified when the requirements of the p roblems change, making it an efficient and flexible solution.