Comparison of simulated annealing and hill climbing in the course timetabling problem

African Journal of Mathematics and Computer Science Research

Kenekayoro Patrick¹ 

关键词: Hill climbing;    simulated annealing;    course timetabling;    local search optimization.;   

DOI  :  10.5897/AJMCSR11.151

学科分类：计算机科学（综合）

来源: Academic Journals

【 摘 要 】

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.

【 授权许可】

CC BY