Matheuristic Techniques for Timetabling Problems

Roberto Maria Rosati

PhD Student in Information Engineering at University of Udine

Recently, matheuristics have emerged as a promising research branch in combinatorial optimization. Thanks to this collaboration supported by TAILOR connectivity fund, we will design and apply novel matheuristic techniques to a variety of timetabling problems that are under investigation at University of Udine. We are interested in particular in Construct, Merge, Solve & Adapt (CMSA), a novel method based on instance reduction under development at CSIC-IIIA in Barcelona. The objective of this project is twofold: on the one hand, we will extend the scope of application of CMSA to complex real-world problems, on the other hand, we will find out what kind of advances can be reached on some specific problems thanks to instance reduction-based matheuristics.