TY  - BOOK
AU  - Khor,Sze Khim
TI  - The hybridisation of heuristic method to solve the ITC2007 examination timetabling problem
SN  - THE0001981(Local)
PY  - 2013///
CY  - Kuantan, Pahang
PB  - UMP
KW  - System design
KW  - Management information systems
KW  - Online data processing
KW  - Heuristic programming
KW  - Examinations
KW  - Timetables
N1  - Project paper (Bachelor of  Computer Science (Software Engineering) -- Universiti Malaysia Pahang - 2012; Bibliography : p.71-77
N2  - The examination timetabling (exam-timeslot-room assignment) problem involves assigning exams to a specific or limited number of timeslots and rooms, with the aim of satisfying the hard constraints and soft constraints as much as possible. Most of the techniques reported in the literature have been applied to solve simplified examination benchmark datasets, available within the scientific literature. For this research, the dataset is drawn from the examination track of the second International Timetabling Competition (ITC2007). This dataset had several novel constraints, in addition to those commonly used in the literature. There are a total of twelve data set that are having different features (i.e. number of exam, number of timeslot and also number of room). A hybridization of graph heuristic and hill climbing is being used to solve the timetabling problem. For the graph heuristic method, it is being used to generate an initial solution. After that, the solution is improved by using the hill climbing method. At the end, it will produce a better solution that fulfill all the require constraints
ER  -