Solving Toronto Examination Timetabling Using Heuristic Method

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. Toronto benchmark data contains 13...

Full description

Bibliographic Details
Main Author:	Lim Ruey, Long
Format:	Undergraduates Project Papers
Language:	English
Published:	2013
Subjects:	QA76 Computer software
Online Access:	http://umpir.ump.edu.my/id/eprint/7253/ http://umpir.ump.edu.my/id/eprint/7253/ http://umpir.ump.edu.my/id/eprint/7253/1/CD7618.pdf

id	ump-7253
recordtype	eprints
spelling	ump-72532015-03-03T09:35:00Z http://umpir.ump.edu.my/id/eprint/7253/ Solving Toronto Examination Timetabling Using Heuristic Method Lim Ruey, Long QA76 Computer software 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. Toronto benchmark data contains 13 real-world examination timetabling problem which have different conflict density for every dataset. Many researchers solved Toronto benchmark data using different method in order to produce a timetable which is feasible and solve all the constraints. To produce a feasible examination timetable, all the exams need to be scheduled into timeslot while satisfying the hard constraint and soft constraint. The timetable result should have the minimum penalty value in term of spread exams. Therefore, the technique partial graph heuristic with hill climbing method should be implemented to solve Toronto examination timetabling problem. The graph heuristic method will partially schedule the exam and then improved by hill climbing method. This process will be repeated until all the exams are scheduled. By using this technique, the solution of timetable result can comply all of the constraints and has a competitive result compared to other researchers' result. 2013 Undergraduates Project Papers NonPeerReviewed application/pdf en http://umpir.ump.edu.my/id/eprint/7253/1/CD7618.pdf Lim Ruey, Long (2013) Solving Toronto Examination Timetabling Using Heuristic Method. Faculty of Computer Systems & Software Engineering, Universiti Malaysia Pahang. http://iportal.ump.edu.my/lib/item?id=chamo:77107&theme=UMP2
repository_type	Digital Repository
institution_category	Local University
institution	Universiti Malaysia Pahang
building	UMP Institutional Repository
collection	Online Access
language	English
topic	QA76 Computer software
spellingShingle	QA76 Computer software Lim Ruey, Long Solving Toronto Examination Timetabling Using Heuristic Method
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. Toronto benchmark data contains 13 real-world examination timetabling problem which have different conflict density for every dataset. Many researchers solved Toronto benchmark data using different method in order to produce a timetable which is feasible and solve all the constraints. To produce a feasible examination timetable, all the exams need to be scheduled into timeslot while satisfying the hard constraint and soft constraint. The timetable result should have the minimum penalty value in term of spread exams. Therefore, the technique partial graph heuristic with hill climbing method should be implemented to solve Toronto examination timetabling problem. The graph heuristic method will partially schedule the exam and then improved by hill climbing method. This process will be repeated until all the exams are scheduled. By using this technique, the solution of timetable result can comply all of the constraints and has a competitive result compared to other researchers' result.
format	Undergraduates Project Papers
author	Lim Ruey, Long
author_facet	Lim Ruey, Long
author_sort	Lim Ruey, Long
title	Solving Toronto Examination Timetabling Using Heuristic Method
title_short	Solving Toronto Examination Timetabling Using Heuristic Method
title_full	Solving Toronto Examination Timetabling Using Heuristic Method
title_fullStr	Solving Toronto Examination Timetabling Using Heuristic Method
title_full_unstemmed	Solving Toronto Examination Timetabling Using Heuristic Method
title_sort	solving toronto examination timetabling using heuristic method
publishDate	2013
url	http://umpir.ump.edu.my/id/eprint/7253/ http://umpir.ump.edu.my/id/eprint/7253/ http://umpir.ump.edu.my/id/eprint/7253/1/CD7618.pdf
first_indexed	2023-09-18T22:03:48Z
last_indexed	2023-09-18T22:03:48Z
_version_	1777414573990608896

Solving Toronto Examination Timetabling Using Heuristic Method

Similar Items