The hybridisation of heuristic method to solve the ITC2007 examination timetabling problem / Khor Sze Khim
Material type:
TextPublication details: Kuantan, Pahang : UMP, 2013Description: xiii, 82 p. : ill. ; 30 cm. + 1 CD-ROMISBN: - THE0001981(Local)
| Item type | Current library | Call number | Copy number | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|---|
Final Year Report
|
UMPLIB GAMBANG | CD 7634 | QA76.9.S88 K46 2013 rs Bc. (Browse shelf(Opens below)) | 1 | Not for loan | 0000078911 | ||
|
Final Year Report
|
UMPLIB PEKAN | QA76.9.S88 K46 2013 rs Bc. (Browse shelf(Opens below)) | 1 | Not for loan | 0000078910 |
Project paper (Bachelor of Computer Science (Software Engineering) -- Universiti Malaysia Pahang - 2012
Bibliography : p.71-77
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.