Solving the ITC2007 examination timetabling problem by using the late acceptance hill climbing technique
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 Teknol...
| Main Author: | |
|---|---|
| Format: | Undergraduates Project Papers |
| Language: | English |
| Published: |
2014
|
| Subjects: | |
| Online Access: | http://umpir.ump.edu.my/id/eprint/12044/ http://umpir.ump.edu.my/id/eprint/12044/ http://umpir.ump.edu.my/id/eprint/12044/1/LEE%20KIA%20WEI.PDF |
| Summary: | 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. |
|---|