Memetic algorithms for timetabling

Course timetabling problems are real world constraint optimization problems that are often coped with educational institutions, such as universities or high schools. In this paper, we present a variety of new operators that can be also applied in evolutionary algorithms for other timetabling problems, such as, exam timetabling. Operators include violation directed mutations, crossovers, and a successful violation directed hierarchical hill climbing method. Tests are performed on a small portion of a real data and results are promising.