Solving of university course timetabling problem by meta- heuristic: a literature review

Abstract

University Course Timetabling Problem (UCTP) is a difficult problem to solve. There are many constraints to be considered. Then, an appropriate and effective (quality of timetable and resource usage) method is needed. This review article had collected relevant researches for analysis, comparison, and discussion by focusing on well-known methods in meta-heuristic approach for UCTP. These methods include Genetic Algorithm (GA), Simulated Annealing (SA), Tabu Search (TS), and Ant Colony Optimization (ACO). Conclusions and suggestions are also made for future research.