Comparing genetic operators for the timetabling problem

This paper describes a genetic algorithm used to solve the timetabling problem. Our approach will deal with the weekly curriculum based timetabling problem using real datasets from the University of Udine. Before proposing an algorithm we examine and compare the performance of the different genetic operators.