COSTECH Integrated Repository

Late Acceptance Heuristic for University’s Course Timetabling Problem

Show simple item record

dc.creator Mushi, Allen R.
dc.creator Marwa, Y.
dc.date 2016-03-16T15:07:50Z
dc.date 2016-03-16T15:07:50Z
dc.date 2013
dc.date.accessioned 2018-04-18T11:50:12Z
dc.date.available 2018-04-18T11:50:12Z
dc.identifier Mushi, 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.identifier 0976-5697
dc.identifier http://hdl.handle.net/123456789/1041
dc.identifier.uri http://hdl.handle.net/123456789/10638
dc.description Full text available at http://search.proquest.com/openview/83c3d0bb660d2f3330cc49bc0790d51e/1?pq-origsite=gscholar
dc.description This 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.language en
dc.publisher Journal of Advanced Research in Computer Science
dc.subject Late Acceptance
dc.subject Simulated Annealing
dc.subject Combinatorial Optimization
dc.subject Course Timetabling
dc.subject heuristics
dc.title Late Acceptance Heuristic for University’s Course Timetabling Problem
dc.type Journal Article


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search COSTECH


Advanced Search

Browse

My Account