Abdul Rahman, Syariza and Syed Abdullah, Sharifah Shuthairah and Benjamin, Aida Mauziah (2017) A nonlinear heuristic modifier for constructing examination timetable. Journal of Theoretical and Applied Information Technology, 95 (20). pp. 5642-5653. ISSN 1992-8645

PDF Restricted to Registered users only Download (282kB) | Request a copy

Abstract

This research focuses on solving an examination timetabling problem by constructing solution using nonlinear heuristic modifier of Graph Coloring Heuristics.Two graph coloring heuristics i.e. largest degree and saturation degree were used within the nonlinear heuristic modifier to generate difficulty value of each examination, where it was modified non linearly whenever an examination cannot be scheduled in the previous iteration. Next, new ordering of examinations was obtained based on the new difficulty values and each examination was scheduled until a complete timetable is obtained. The nonlinear heuristic modifier is proposed to set a difficulty value of an examination within a nonlinear range, so that an effective estimation of examination’s difficulty could be obtained. The Toronto benchmark datasets were used in the experiment where the aim is to obtain an examination schedule with minimum penalty value. It is found that the proposed method is comparable with other approaches, hence gives better examination ordering.

Item Type:	Article
Uncontrolled Keywords:	Examination timetabling problem; nonlinear heuristic modifier; Graph Coloring Heuristics; Toronto Benchmark Datasets
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions:	School of Quantitative Sciences
Depositing User:	Mrs. Norazmilah Yaakub
Date Deposited:	15 May 2019 00:39
Last Modified:	15 May 2019 00:39
URI:	https://repo.uum.edu.my/id/eprint/26045

Actions (login required)

View Item