A MIP based approach for International Timetabling Competition 2019
Dennis Søren Holm, Rasmus Ørnstrup Mikkelsen, Matias Sørensen, Thomas Stidsen · Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU) · 2020
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.