Staff View: A nonlinear heuristic modifier for constructing examination timetable

A nonlinear heuristic modifier for constructing examination timetable

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 difficul...

Full description

Saved in:

Bibliographic Details
Main Authors:	Abdul Rahman, Syariza, Syed Abdullah, Sharifah Shuthairah, Benjamin, Aida Mauziah
Format:	Article
Language:	English
Published:	JATIT 2017
Subjects:	QA75 Electronic computers. Computer science
Online Access:	http://repo.uum.edu.my/26045/1/JTAIT%2095%2020%202017%205142%205653.pdf http://repo.uum.edu.my/26045/ http://www.jatit.org/volumes/ninetyfive20.php
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my.uum.repo.26045
record_format	eprints
spelling	my.uum.repo.260452019-05-15T00:39:28Z http://repo.uum.edu.my/26045/ A nonlinear heuristic modifier for constructing examination timetable Abdul Rahman, Syariza Syed Abdullah, Sharifah Shuthairah Benjamin, Aida Mauziah QA75 Electronic computers. Computer science 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. JATIT 2017 Article PeerReviewed application/pdf en http://repo.uum.edu.my/26045/1/JTAIT%2095%2020%202017%205142%205653.pdf 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 http://www.jatit.org/volumes/ninetyfive20.php
institution	Universiti Utara Malaysia
building	UUM Library
collection	Institutional Repository
continent	Asia
country	Malaysia
content_provider	Universiti Utara Malaysia
content_source	UUM Institutionali Repository
url_provider	http://repo.uum.edu.my/
language	English
topic	QA75 Electronic computers. Computer science
spellingShingle	QA75 Electronic computers. Computer science Abdul Rahman, Syariza Syed Abdullah, Sharifah Shuthairah Benjamin, Aida Mauziah A nonlinear heuristic modifier for constructing examination timetable
description	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.
format	Article
author	Abdul Rahman, Syariza Syed Abdullah, Sharifah Shuthairah Benjamin, Aida Mauziah
author_facet	Abdul Rahman, Syariza Syed Abdullah, Sharifah Shuthairah Benjamin, Aida Mauziah
author_sort	Abdul Rahman, Syariza
title	A nonlinear heuristic modifier for constructing examination timetable
title_short	A nonlinear heuristic modifier for constructing examination timetable
title_full	A nonlinear heuristic modifier for constructing examination timetable
title_fullStr	A nonlinear heuristic modifier for constructing examination timetable
title_full_unstemmed	A nonlinear heuristic modifier for constructing examination timetable
title_sort	nonlinear heuristic modifier for constructing examination timetable
publisher	JATIT
publishDate	2017
url	http://repo.uum.edu.my/26045/1/JTAIT%2095%2020%202017%205142%205653.pdf http://repo.uum.edu.my/26045/ http://www.jatit.org/volumes/ninetyfive20.php
_version_	1644284490930978816
score	13.211869

A nonlinear heuristic modifier for constructing examination timetable

Similar Items