The ITC 2019 has described a general formulation of the tactical level university timetabling problem. The competition provides real data from universities worldwide. We have implemented a high-performance algorithm to solve any university timetabling problem formulated in the ITC2019 format.
Our algorithm is based on a Mixed Integer Programming model which provides us with information about a lower bound and when an instance is solved to optimality.
5 of our solutions to the ITC 2019 instances are proven optimal.
We have improved 21 of our competition solutions since the competition deadline (November 18, 2019).
Most recent improvement: January 1st, 2023.
Skriv en mail til os hvis der er yderligere spørgsmål til datasættet. Evt lidt mere tekst