Tabu Search Heuristic for University Course Timetabling Problem
| dc.contributor.author | Mushi, Allen | |
| dc.date.accessioned | 2018-11-23T07:02:18Z | |
| dc.date.available | 2018-11-23T07:02:18Z | |
| dc.date.issued | 2006 | |
| dc.description.abstract | In this study we have addressed the NP-Hard problem of academic course timetabling. This is the problem of 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 paper describes a Tabu Search algorithm that creates timetables by heuristically minimizing penalties over infeasibilities. The algorithm is developed with special focus on the University of Dar-assalaam and compares the results with a previous manually generated timetable. It has been found that, the Tabu Search technique gives better results given a careful selection of parameters | en_US |
| dc.identifier.issn | 1607-9949 | |
| dc.identifier.uri | http://hdl.handle.net/20.500.11810/4997 | |
| dc.language.iso | en | en_US |
| dc.publisher | African Journal of Science and Technology (AJST) | en_US |
| dc.relation.ispartofseries | Science and Engineering Series;Vol. 7, No. 1 | |
| dc.subject | Course Timetabling, Tabu Search, Heuristic Algorithms | en_US |
| dc.title | Tabu Search Heuristic for University Course Timetabling Problem | en_US |
| dc.type | Journal Article | en_US |