Timetabling tasks form a widely studied type of resource scheduling problem, with important real-world applications in schools, universities and other educational settings. In this work, we focus on postenrollment course timetabling, the problem that was covered by Track 2 of the recent 2nd International Timetabling Competition (ITC2007). Following an approach that makes strong use of automated exploration of a large design space of modular and highly parameterised stochastic local search algorithms for this problem, we have obtained a solver that achieves consistently better performance than the top-ranked solver from the competition. This represents a substantial improvement in the state of the art for post-enrollment course timetabling.
Doctoral Symposium on Engineering Stochastic Local Search Algorithms, 2009, p. 16-20
Main Research Area:
Iridia - Technical Report Series
Engineering Stochastic Local Search Algorithms, 2009
IRIDIA, Institut de Recherches Interdisciplinaires