Two Phase Heuristic Algorithm for the University Course Timetabling Problem: The Case of University of Dar Es Salaam
AbstractUniversity course timetabling is the problem of scheduling resources such as lecturers, courses, and rooms to a number of timeslots over a planning horizon, normally a week, while satisfying a number of problem-specific constraints. Since timetabling problems differ from one institution to another, this paper investigated the case of the University of Dar Es salaam, based on the combination of Simulated Annealing (SA), and steepest descent in a two-phase approach. Solutions have been generated which greatly outperform the manually generated ones. Furthermore, the method compares well with previous work on Tabu Search but with faster execution time and higher quality on rooms allocation. It is concluded that the approach gives good results given a careful selection of parameters.
Keywords: Timetabling Problem, Simulated Annealing, Combinatorial Optimization, Steepest Descent
Tanz. J. Sci. Vol. 37 2011
Copyright for articles published in this journal is retained by the journal.
This journal provides immediate open access to its content on the principle that making research freely available to the public supports a greater global exchange of knowledge