Late Acceptance Heuristic for University’s Course Timetabling Problem

Simple item page
dc.creatorMushi, Allen R.
dc.creatorMarwa, Y.
dc.date2016-03-16T15:07:50Z
dc.date2016-03-16T15:07:50Z
dc.date2013
dc.date.accessioned2018-03-27T08:57:46Z
dc.date.available2018-03-27T08:57:46Z
dc.descriptionFull text available at http://search.proquest.com/openview/83c3d0bb660d2f3330cc49bc0790d51e/1?pq-origsite=gscholar
dc.descriptionThis 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.
dc.identifierMushi, A.R. and Marwa, Y., 2013. Late Acceptance Heuristic for University Course Timetabling Problem. International Journal of Advanced Research in Computer Science, 4(2).
dc.identifier0976-5697
dc.identifierhttp://hdl.handle.net/123456789/1041
dc.identifier.urihttp://hdl.handle.net/123456789/4118
dc.languageen
dc.publisherJournal of Advanced Research in Computer Science
dc.subjectLate Acceptance
dc.subjectSimulated Annealing
dc.subjectCombinatorial Optimization
dc.subjectCourse Timetabling
dc.subjectheuristics
dc.titleLate Acceptance Heuristic for University’s Course Timetabling Problem
dc.typeJournal Article

Files

Collections

Department of Mathematics