The implementation of partial graph heuristic with improvement method to solve the UMP examination timetabling problem

The examination timetabling problem has attracted the interested of many researchers over the years. However, this problem is difficult to solve due to the lack of benchmark dataset and many constraints that need to be satisfied in examination timetabling problem. Currently, Universiti Malaysia...

Full description

Bibliographic Details
Main Author:	Lee Jian, Hao
Format:	Undergraduates Project Papers
Language:	English
Published:	2013
Subjects:	LB2361 Curriculum
Online Access:	http://umpir.ump.edu.my/id/eprint/6975/ http://umpir.ump.edu.my/id/eprint/6975/ http://umpir.ump.edu.my/id/eprint/6975/1/CD7651.pdf

id	ump-6975
recordtype	eprints
spelling	ump-69752015-03-03T09:33:32Z http://umpir.ump.edu.my/id/eprint/6975/ The implementation of partial graph heuristic with improvement method to solve the UMP examination timetabling problem Lee Jian, Hao LB2361 Curriculum The examination timetabling problem has attracted the interested of many researchers over the years. However, this problem is difficult to solve due to the lack of benchmark dataset and many constraints that need to be satisfied in examination timetabling problem. Currently, Universiti Malaysia Pahang (UMP) use proprietary system to generate the examination timetable but the weakness of this system is unable to define the quality of solution because having no evaluation function. Other than that, the UMP examination timetabling problem consist unique constraints such as distance penalty and split penalty. Having all of these constraints had made the task to solve examination timetabling problem becomes more challenging. To produce examination timetable, all of the exams need to be scheduled into timetable while satisfying the hard constraint and soft constraint. The timetable result should have the minimum penalty value in terms of spread exams, split rooms and distance between rooms. Therefore, the technique partial graph heuristic with hill climbing method should be implemented to solve UMP examination timetabling problem. The graph heuristic method will partially schedule the exam and then improved by hill climbing method. This process will be continued until finish scheduled all of the exams. By using this technique, the solution of timetable result can comply all of the constraint and has a better quality of solution compared to the result of current examination system. 2013 Undergraduates Project Papers NonPeerReviewed application/pdf en http://umpir.ump.edu.my/id/eprint/6975/1/CD7651.pdf Lee Jian, Hao (2013) The implementation of partial graph heuristic with improvement method to solve the UMP examination timetabling problem. Faculty of Computer System and Software Engineering, Universiti Malaysia Pahang. http://iportal.ump.edu.my/lib/item?id=chamo:76584&theme=UMP2
repository_type	Digital Repository
institution_category	Local University
institution	Universiti Malaysia Pahang
building	UMP Institutional Repository
collection	Online Access
language	English
topic	LB2361 Curriculum
spellingShingle	LB2361 Curriculum Lee Jian, Hao The implementation of partial graph heuristic with improvement method to solve the UMP examination timetabling problem
description	The examination timetabling problem has attracted the interested of many researchers over the years. However, this problem is difficult to solve due to the lack of benchmark dataset and many constraints that need to be satisfied in examination timetabling problem. Currently, Universiti Malaysia Pahang (UMP) use proprietary system to generate the examination timetable but the weakness of this system is unable to define the quality of solution because having no evaluation function. Other than that, the UMP examination timetabling problem consist unique constraints such as distance penalty and split penalty. Having all of these constraints had made the task to solve examination timetabling problem becomes more challenging. To produce examination timetable, all of the exams need to be scheduled into timetable while satisfying the hard constraint and soft constraint. The timetable result should have the minimum penalty value in terms of spread exams, split rooms and distance between rooms. Therefore, the technique partial graph heuristic with hill climbing method should be implemented to solve UMP examination timetabling problem. The graph heuristic method will partially schedule the exam and then improved by hill climbing method. This process will be continued until finish scheduled all of the exams. By using this technique, the solution of timetable result can comply all of the constraint and has a better quality of solution compared to the result of current examination system.
format	Undergraduates Project Papers
author	Lee Jian, Hao
author_facet	Lee Jian, Hao
author_sort	Lee Jian, Hao
title	The implementation of partial graph heuristic with improvement method to solve the UMP examination timetabling problem
title_short	The implementation of partial graph heuristic with improvement method to solve the UMP examination timetabling problem
title_full	The implementation of partial graph heuristic with improvement method to solve the UMP examination timetabling problem
title_fullStr	The implementation of partial graph heuristic with improvement method to solve the UMP examination timetabling problem
title_full_unstemmed	The implementation of partial graph heuristic with improvement method to solve the UMP examination timetabling problem
title_sort	implementation of partial graph heuristic with improvement method to solve the ump examination timetabling problem
publishDate	2013
url	http://umpir.ump.edu.my/id/eprint/6975/ http://umpir.ump.edu.my/id/eprint/6975/ http://umpir.ump.edu.my/id/eprint/6975/1/CD7651.pdf
first_indexed	2023-09-18T22:03:10Z
last_indexed	2023-09-18T22:03:10Z
_version_	1777414533736824832

The implementation of partial graph heuristic with improvement method to solve the UMP examination timetabling problem

Similar Items