UMP Institutional Repository

Solving Examination Timetabling Problem using Partial Exam Assignment with Great Deluge Algorithm

Ashis Kumar, Mandal and M. N. M., Kahar (2015) Solving Examination Timetabling Problem using Partial Exam Assignment with Great Deluge Algorithm. In: 2015 International Conference on Computer, Communications, and Control Technology (I4CT), 21-23 April 2015 , Kuching, Sarawak. pp. 535-539., 11 (8). ISSN 1097-8135 (Unpublished)

[img]
Preview
PDF
Solving Examination Timetabling Problem using Partial Exam Assignment with Great Deluge Algorithm.pdf - Published Version

Download (270kB) | Preview

Abstract

Constructing a quality solution for the examination timetable problem is a difficult task. This paper presents a partial exam assignment approach with great deluge algorithm as the improvement mechanism in order to generate good quality timetable. In this approach, exams are ordered based on graph heuristics and only selected exams (partial exams) are scheduled first and then improved using great deluge algorithm. The entire process continues until all of the exams have been scheduled. We implement the proposed technique on the Toronto benchmark datasets. Experimental results indicate that in all problem instances, this proposed method outperforms traditional great deluge algorithm and when comparing with the state-of-the-art approaches, our approach produces competitive solution for all instances, with some cases outperform other reported result.

Item Type: Conference or Workshop Item (Other)
Uncontrolled Keywords: graph heuristic, great deluge algorithm, timetable
Subjects: Q Science > QA Mathematics > QA76 Computer software
Faculty/Division: Faculty of Computer System And Software Engineering
Depositing User: Mrs. Neng Sury Sulaiman
Date Deposited: 13 Jul 2015 02:50
Last Modified: 13 Jul 2015 02:50
URI: http://umpir.ump.edu.my/id/eprint/6220
Download Statistic: View Download Statistics

Actions (login required)

View Item View Item