Course timetabling is a task that must be performed by all higher institutions. It is very difficult doing this manually and even classified as nondeterministic polynomial (NP) complete in five independent ways. Several methods (heuristics) are used to solve this problem including local search optimization methods like simulated annealing and hill climbing. This paper compares these methods used to solve the university course timetabling problem.
Key words: Hill climbing, simulated annealing, course timetabling, local search optimization.
Copyright © 2022 Author(s) retain the copyright of this article.
This article is published under the terms of the Creative Commons Attribution License 4.0