COSTECH Integrated Repository

Two Phase Heuristic Algorithm for the University Course Timetabling Problem

Show simple item record

dc.creator Mushi, Allen R.
dc.date 2016-03-16T15:06:39Z
dc.date 2016-03-16T15:06:39Z
dc.date 2011
dc.date.accessioned 2018-04-18T11:50:12Z
dc.date.available 2018-04-18T11:50:12Z
dc.identifier Mushi, A.R., 2011. Two phase heuristic algorithm for the university course timetabling problem: the case of University of Dar Es Salaam. Tanzania Journal of Science, 37(1).
dc.identifier 0856 1761
dc.identifier http://hdl.handle.net/123456789/1036
dc.identifier.uri http://hdl.handle.net/123456789/10640
dc.description University 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 paramete
dc.language en
dc.publisher Tanzania Journal of Science
dc.subject Timetabling Problem
dc.subject Simulated Annealing
dc.subject Combinatorial Optimization,
dc.subject Steepest Descent
dc.title Two Phase Heuristic Algorithm for the University Course Timetabling Problem
dc.type Journal Article


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search COSTECH


Advanced Search

Browse

My Account