African Journal of
Mathematics and Computer Science Research

  • Abbreviation: Afr. J. Math. Comput. Sci. Res.
  • Language: English
  • ISSN: 2006-9731
  • DOI: 10.5897/AJMCSR
  • Start Year: 2008
  • Published Articles: 254


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

Kenekayoro Patrick
Department of Mathematics and Computer Science, Niger Delta University, Wilberforce Island, P. M. B. 071, Amassoma, Bayelsa State, Nigeria
Email: [email protected]

  •  Accepted: 12 June 2012
  •  Published: 30 September 2012



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.