UMP Institutional Repository

Solving the ITC2007 examination timetabling problem by using the late acceptance hill climbing technique

Lee, Kia Wei (2014) Solving the ITC2007 examination timetabling problem by using the late acceptance hill climbing technique. Faculty of Computer System and Software Engineering, Universiti Malaysia Pahang.

[img]
Preview
PDF
LEE KIA WEI.PDF

Download (1MB) | Preview

Abstract

There are many timetabling problem are studied by researchers such as the Toronto dataset, Dataset of University of Melbourne, Dataset of University of Nottingham as well as the dataset from the local University such as Dataset of University Kebangsaan Malaysia(UKM) and Dataset of University Teknologi MARA(IJiTM). For this thesis, we are concerning on solving the Second International Timetabling Competition (1TC2007) dataset. The 1TC2007 dataset is chosen because it has additional hard constraints and, software constraints compared to other datasets. Besides, 1TC2007 consists of 12 datasets with different features in the terms of number of exams, number of room and number of timeslot. We are choosing the Late Acceptance Hill Climbing method to solve this dataset. The reason why using Late Acceptance Hill Climbing is due to the Late Acceptance Hill Climbing is an effective and simple method that will ease the implementation.

Item Type: Undergraduates Project Papers
Additional Information: Undergraduates Project Papers (Bachelor of Computer Science (Computer Systems & Networking)) -- Universiti Malaysia Pahang – 2014
Uncontrolled Keywords: ITC2007 examination timetabling problem; Late Acceptance Hill Climbing method
Subjects: Q Science > QA Mathematics > QA76 Computer software
Faculty/Division: Faculty of Computer System And Software Engineering
Depositing User: Ms. 'Arifah Nadiah Che Zainol Ariff
Date Deposited: 17 Mar 2016 02:04
Last Modified: 17 Mar 2016 02:04
URI: http://umpir.ump.edu.my/id/eprint/12044
Download Statistic: View Download Statistics

Actions (login required)

View Item View Item