Tabu Search Heuristic for Course Timetabling Problem

Simple item page
dc.creatorMushi, Allen R.
dc.date2016-03-16T15:08:56Z
dc.date2016-03-16T15:08:56Z
dc.date2006
dc.date.accessioned2018-03-27T08:57:50Z
dc.date.available2018-03-27T08:57:50Z
dc.descriptionIn 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.
dc.identifierMushi, A.R., 2006. Tabu search heuristic for university course timetabling problem. African Journal of Science and Technology, 7(1).
dc.identifierhttp://hdl.handle.net/123456789/1046
dc.identifier.urihttp://hdl.handle.net/123456789/4134
dc.languageen
dc.publisherAfrican Journal of Science and Technology
dc.subjectTabu Search
dc.subjectheuristics
dc.subjectTimetabling Problem
dc.titleTabu Search Heuristic for Course Timetabling Problem
dc.typeJournal Article

Files

Collections

Department of Mathematics