Hybrid Memetic Algorithm for Uniting Classes of University Timetabling Problem

This paper issues a new problem about combining classes for timetabling due to its good result can improve the efficiency and alleviate the complexity of timetable scheduling. The optimal problem is modeled as a matter to search the max number of connected sub graphs in a non-totally connected graph. Firstly, the depth-first-search algorithm is employed to get the number of connected sub graphs. Then simulated annealing algorithm is cooperated into memetic algorithm to obtain the optimization of the problem. Finally, we test our solution on real-world data. The results show that the proposed algorithm is efficient and convergent and the optimal uniting classes´ schema will be achieved.