Late Acceptance Heuristic for University’s Course Timetabling Problem

dc.contributor.authorMushi, Allen R.
dc.contributor.authorMarwa, Y.
dc.date.accessioned2016-03-16T15:07:50Z
dc.date.available2016-03-16T15:07:50Z
dc.date.issued2013
dc.descriptionFull text available at http://search.proquest.com/openview/83c3d0bb660d2f3330cc49bc0790d51e/1?pq-origsite=gscholaren_US
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.citationMushi, A.R. and Marwa, Y., 2013. Late Acceptance Heuristic for University Course Timetabling Problem. International Journal of Advanced Research in Computer Science, 4(2).en_US
dc.identifier.issn0976-5697
dc.identifier.urihttp://hdl.handle.net/123456789/1041
dc.language.isoenen_US
dc.publisherJournal of Advanced Research in Computer Scienceen_US
dc.subjectLate Acceptanceen_US
dc.subjectSimulated Annealingen_US
dc.subjectCombinatorial Optimizationen_US
dc.subjectCourse Timetablingen_US
dc.subjectheuristicsen_US
dc.titleLate Acceptance Heuristic for University’s Course Timetabling Problemen_US
dc.typeJournal Articleen_US
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Late Acceptance Heuristic for University Course Timetabling Problem.pdf
Size:
4.94 KB
Format:
Adobe Portable Document Format
Description:
Abstract
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: