Two-Phase Great Deluge Algorithm for Course Timetabling Problem
| dc.contributor.author | Mushi, Allen | |
| dc.date.accessioned | 2018-11-23T07:02:58Z | |
| dc.date.available | 2018-11-23T07:02:58Z | |
| dc.date.issued | 2011-09 | |
| dc.description.abstract | 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. | en_US |
| dc.identifier.issn | 0976-5697 | |
| dc.identifier.uri | http://hdl.handle.net/20.500.11810/5002 | |
| dc.language.iso | en | en_US |
| dc.relation.ispartofseries | Vol. 2;No. 5 | |
| dc.subject | Course Timetabling, Great Deluge, Tabu Search | en_US |
| dc.title | Two-Phase Great Deluge Algorithm for Course Timetabling Problem | en_US |
| dc.type | Journal Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- L_2366_1632.16 Two Phase GD for CTP.pdf
- Size:
- 234.08 KB
- Format:
- Adobe Portable Document Format
- Description:
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed upon to submission
- Description: