Ashis Kumar, Mandal and M. N. M., Kahar (2015) Solving Examination Timetabling Problem using Partial Exam Assignment with Hill Climbing Search. In: IEEE Symposium on Computer Applications & Industrial Electronics (ISCAIE 2015) , 12-14 April 2015 , Langkawi, Kedah. pp. 84-89..
|
PDF
Solving Examination Timetabling Problem Using Partial Exam Assignment with Hill Climbing Search.pdf Download (246kB) | Preview |
Abstract
This paper describes a method that combines graph heuristics and hill climbing for addressing the examination timetable problem. In this approach, all exams are ordered with graph heuristic ordering approach and partial exams are considered for scheduling. These partial scheduled exams are then improved using hill climbing until all exams have been successfully scheduled. Various exam assignment values with different graph heuristics ordering have been investigated. The proposed approach has been tested over the twelve Toronto benchmark datasets. The experimental results and comparison with other methods demonstrate that the proposed approach is able to produce good quality timetable
| Item Type: | Conference or Workshop Item (Speech) |
|---|---|
| Additional Information: | ISBN: 978-1-4799-8968-3 |
| Uncontrolled Keywords: | Examination timetabling, scheduling, graph heuristics, hill-climbing, Toronto benchmark datasets |
| Subjects: | Q Science > QA Mathematics > QA76 Computer software |
| Faculty/Division: | Faculty of Computer System And Software Engineering Institute of Postgraduate Studies |
| Depositing User: | Mrs. Neng Sury Sulaiman |
| Date Deposited: | 09 Sep 2015 06:49 |
| Last Modified: | 21 Feb 2020 07:44 |
| URI: | http://umpir.ump.edu.my/id/eprint/5946 |
| Download Statistic: | View Download Statistics |
Actions (login required)
 |
View Item |