The performance analysis of hyper-heuristics algorithms over examination timetabling problems

In general, uncapacitated exam timetabling is conducted manually, which can be time-consuming. Many studies aim to automate and optimize uncapacitated exam timetabling. However, pinpointing the most efficient algorithm is challenging since most studies assert that their algorithms surpass previous ones. To identify the optimal algorithm, this research evaluates the performance of four algorithms: Hill climbing (HC), simulated annealing (SA), great deluge (GD), and tabu search (TS) in addressing the exam timetabling problem. The Kempe chain operator’s influence on optimization solutions is also examined. A simple random method is employed to select the low-level heuristic (LLH). The Carter (Toronto) dataset served as the test material, with each algorithm undergoing 200,000 iterations for comparison. The results indicate that the TS algorithm is superior, providing the best solution in 13 instances. The use of a tabu list enhanced the search process’s efficiency by preventing redundant modifications. The Kempe chain LLH exhibited a tendency towards achieving better solutions.