COSTECH Integrated Repository

Two-Phase Great Deluge Algorithm for Course Timetabling Problem

Show simple item record

dc.creator Mushi, Allen R.
dc.date 2016-03-16T15:07:32Z
dc.date 2016-03-16T15:07:32Z
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 Great Deluge Algorithm for Course Timetabling Problemr. International Journal of Advanced Research in Computer Science, 2(5).
dc.identifier 0976-5697
dc.identifier http://hdl.handle.net/123456789/1039
dc.identifier.uri http://hdl.handle.net/123456789/10641
dc.description Full text available at http://search.proquest.com/openview/5278ad078e432ec3510dd85bbd6d95cb/1?pq-origsite=gscholar
dc.description Academic course timetabling involve assigning resources such as lecturers, rooms and courses to a fixed time period, normally a week, while satisfying a number of problem-specific constraints. This study describes a Great Deluge Algorithm in two phases that creates timetables by heuristically minimizing penalties over infeasibilities. The algorithm is developed with special focus on the University of Dar-as-salaam and compares the results with a previous work on Tabu Search, and a manually generated solution. We conclude that Great Deluge gives a much more stable solution because it produces good solutions with less number of parameters for tuning compared to Tabu Search.
dc.language en
dc.publisher International Journal of Advanced Research in Computer Science
dc.subject Course Timetabling
dc.subject great deluge
dc.subject Tabu Search
dc.title Two-Phase Great Deluge Algorithm for 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