Late Acceptance Heuristic for University’s Course Timetabling Problem
No Thumbnail Available
Date
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Journal of Advanced Research in Computer Science
Abstract
Description
Full text available at http://search.proquest.com/openview/83c3d0bb660d2f3330cc49bc0790d51e/1?pq-origsite=gscholar
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.
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.
Keywords
Late Acceptance, Simulated Annealing, Combinatorial Optimization, Course Timetabling, heuristics