Late Acceptance Heuristic for University Course Timetabling Problem

Simple item page
dc.contributor.authorMarwa, Yohana
dc.contributor.authorMushi, Allen
dc.date.accessioned2018-11-23T07:03:35Z
dc.date.available2018-11-23T07:03:35Z
dc.date.issued2013-02
dc.description.abstractThis paper describes a Late Acceptance Heuristic for University Course Timetabling Problem, using a case study of a University College in Tanzania. Late Acceptance is one of relatively new heuristic procedures that try to improve searching by delaying acceptance of latest solutions. The results are compared with an implementation on Simulated Annealing heuristic, which is a well documented and successful heuristic procedure for similar problems. It is shown that Late Acceptance Procedure is a good procedure for Course timetabling problem and compares well with Simulated Annealing.en_US
dc.identifier.issn0976-5697
dc.identifier.urihttp://hdl.handle.net/20.500.11810/5007
dc.language.isoenen_US
dc.publisherInternational Journal of Advanced Research in Computer Scienceen_US
dc.relation.ispartofseries;Volume 4, No. 2
dc.subjectLate Acceptance, Simulated Annealing, Course Timetabling, Combinatorial Optimization, heuristicsen_US
dc.titleLate Acceptance Heuristic for University Course Timetabling Problemen_US
dc.typeJournal Articleen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
LAH for UCTP IJARC Marwa Mushi.pdf
Size:
144.51 KB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Department of Mathematics