TO GET THE COMPLETE JOURNAL/THESIS FOR TOPIC BELOW,
CALL: 08168759420, 08068231953
COMPARISON OF SIMULATED ANNEALING AND HILL CLIMBING IN THE COURSE TIMETABLING PROBLEM
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.