Abstract
This summary paper was written as a part of the submission for the International Timetabling Competition 2019 (ITC2019). It aims to give an overview description of the algorithm used to solve the ITC2019 problem instances. Since the paper is limited to 4 pages, the description cannot be very comprehensive. The algorithm is divided into different parts. First part is a reduction algorithm where unnecessary information in the data is removed. It is followed up by two initial solution algorithms and a Fix-and-Optimize matheuristic. The initial solution algorithms and Fix-and-Optimize algorithms all depend on a Mixed Integer Programming (MIP) formulation, which will also be described briefly. Finally the computational setup is presented as it defines the resulting algorithm.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 13th International Conference on the Practice and Theory of Automated Timetabling - PATAT 2022 |
| Number of pages | 4 |
| Volume | 3 |
| Publication date | 2022 |
| ISBN (Electronic) | 978-0-9929984-5-5 |
| Publication status | Published - 2022 |
| Event | 13th International Conference on the Practice and Theory of Automated Timetabling - Irish College, Leuven, Belgium Duration: 30 Aug 2022 → 3 Sept 2022 Conference number: 13 https://www.patatconference.org/patat2022/index.html |
Conference
| Conference | 13th International Conference on the Practice and Theory of Automated Timetabling |
|---|---|
| Number | 13 |
| Location | Irish College |
| Country/Territory | Belgium |
| City | Leuven |
| Period | 30/08/2022 → 03/09/2022 |
| Internet address |