Normal view MARC view ISBD view

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

By:

Lee, Jian Hao

Material type: Text

TextPublication details: Kuantan, Pahang : UMP, 2013Description: xiii, 108 p. : ill. ; 30 cm. + 1 CD-ROMISBN:

THE0001672(Local)

Subject(s):

Dissertation note: Project paper (Bachelor of Computer Science (Software Engineering)) -- Universiti Malaysia Pahang – 2013 Abstract: 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.

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings ( 2 )
Title notes ( 3 )

Holdings
Item type	Current library	Call number	Copy number	Status	Date due	Barcode
Final Year Report	UMPLIB GAMBANG	LB2366 .L44 2013 rs Bc. (Browse shelf(Opens below))	1	Not for loan		0000078945
Final Year Report	UMPLIB GAMBANG	CD 7651 \| LB2366 .L44 2013 rs Bc. (Browse shelf(Opens below))	1	Not for loan		0000078946

Project paper (Bachelor of Computer Science (Software Engineering)) -- Universiti Malaysia Pahang – 2013

Bibliography : p. 87-89

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.