Multiple case-based retrieval for university course timetabling problem

This thesis presents research for Case-based reasoning (CBR), a knowledge-based reasoning technique to solve university timetabling problem such as resource allocation for student’s course timetabling. CBR model’s was reviewed on Case-based Retrieval for timetabling discloses improvement that can be...

Full description

Saved in:

Bibliographic Details
Main Author:	Hong, Siaw Theng
Format:	Thesis
Language:	English
Published:	2016
Subjects:	Universities and colleges - Management Scheduling - Data processing
Online Access:	http://psasir.upm.edu.my/id/eprint/69369/1/FSKTM%202016%2038%20IR.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-upm-ir.69369
record_format	uketd_dc
spelling	my-upm-ir.693692019-07-10T01:12:28Z Multiple case-based retrieval for university course timetabling problem 2016-01 Hong, Siaw Theng This thesis presents research for Case-based reasoning (CBR), a knowledge-based reasoning technique to solve university timetabling problem such as resource allocation for student’s course timetabling. CBR model’s was reviewed on Case-based Retrieval for timetabling discloses improvement that can be done to excel in accuracy and time consuming. From the review of past case-based retrieval techniques, a few concern is being investigate for the cases retrieval process such as the effectiveness of retrieval and time required to generate a comprehensive timetable. This research is aim to optimize the effectiveness of retrieval as well as generate a timetable in the shortest time possible with minimize violation. The case-based retrieval technique is further enhanced and improvised into a new algorithm known as Multiple Case-based Retrieval. The algorithm is combining separated distinct processes, with the combination of different functionalities: Prioritized Attributes, Frequency Grouping, and Value Difference Measurement. The algorithm was running on timetabling tests, comparing to classic Case-based retrieval and Genetic Algorithm for a wider comparison. Graphs are plot according to the readings from timetabling tests to show the result comparisons. Results from the experiments show the effectiveness and elapsed time to generate a timetable. Multiple Case-based Retrieval shows promising results in improving the effectiveness of case-based retrieval and also reduced the time required to generate a new timetable. This research summarize that the algorithm in retrieval is playing a very important role for an effective timetabling generator. Future research may concern to improve of the process of retaining cases, focus on case-based handling storage for generated cases for future review. Universities and colleges - Management Scheduling - Data processing 2016-01 Thesis http://psasir.upm.edu.my/id/eprint/69369/ http://psasir.upm.edu.my/id/eprint/69369/1/FSKTM%202016%2038%20IR.pdf text en public masters Universiti Putra Malaysia Universities and colleges - Management Scheduling - Data processing
institution	Universiti Putra Malaysia
collection	PSAS Institutional Repository
language	English
topic	Universities and colleges - Management Scheduling - Data processing
spellingShingle	Universities and colleges - Management Scheduling - Data processing Hong, Siaw Theng Multiple case-based retrieval for university course timetabling problem
description	This thesis presents research for Case-based reasoning (CBR), a knowledge-based reasoning technique to solve university timetabling problem such as resource allocation for student’s course timetabling. CBR model’s was reviewed on Case-based Retrieval for timetabling discloses improvement that can be done to excel in accuracy and time consuming. From the review of past case-based retrieval techniques, a few concern is being investigate for the cases retrieval process such as the effectiveness of retrieval and time required to generate a comprehensive timetable. This research is aim to optimize the effectiveness of retrieval as well as generate a timetable in the shortest time possible with minimize violation. The case-based retrieval technique is further enhanced and improvised into a new algorithm known as Multiple Case-based Retrieval. The algorithm is combining separated distinct processes, with the combination of different functionalities: Prioritized Attributes, Frequency Grouping, and Value Difference Measurement. The algorithm was running on timetabling tests, comparing to classic Case-based retrieval and Genetic Algorithm for a wider comparison. Graphs are plot according to the readings from timetabling tests to show the result comparisons. Results from the experiments show the effectiveness and elapsed time to generate a timetable. Multiple Case-based Retrieval shows promising results in improving the effectiveness of case-based retrieval and also reduced the time required to generate a new timetable. This research summarize that the algorithm in retrieval is playing a very important role for an effective timetabling generator. Future research may concern to improve of the process of retaining cases, focus on case-based handling storage for generated cases for future review.
format	Thesis
qualification_level	Master's degree
author	Hong, Siaw Theng
author_facet	Hong, Siaw Theng
author_sort	Hong, Siaw Theng
title	Multiple case-based retrieval for university course timetabling problem
title_short	Multiple case-based retrieval for university course timetabling problem
title_full	Multiple case-based retrieval for university course timetabling problem
title_fullStr	Multiple case-based retrieval for university course timetabling problem
title_full_unstemmed	Multiple case-based retrieval for university course timetabling problem
title_sort	multiple case-based retrieval for university course timetabling problem
granting_institution	Universiti Putra Malaysia
publishDate	2016
url	http://psasir.upm.edu.my/id/eprint/69369/1/FSKTM%202016%2038%20IR.pdf
_version_	1747812689417076736

Multiple case-based retrieval for university course timetabling problem

Similar Items