02195nam a2200289 a 4500 vtls000076645 KUKTEM 20251114204610.0 140124t2013 my a f m 000 0 eng d THE0001981(Local) 201905131552 yusri 201401241023 Fida UMP QA76.9.S88 K46 2013 rs Bc. Khor, Sze Khim The hybridisation of heuristic method to solve the ITC2007 examination timetabling problem / Khor Sze Khim Kuantan, Pahang : UMP, 2013 xiii, 82 p. : ill. ; 30 cm. + 1 CD-ROM 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. System design Management information systems Online data processing Heuristic programming Examinations Timetables 0 0 0 1 20000 20000 2019-09-04 0 QA76.9.S88 K46 2013 rs Bc. 0000078910 2019-09-04 00:00:00 1 2019-09-04 PSM 0 0 0 1 10000 10000 2019-09-04 0 CD 7634 | QA76.9.S88 K46 2013 rs Bc. 0000078911 2019-09-04 00:00:00 1 2019-09-04 PSM VIRTUA40 4834 4840 VTLSSORT0080*0200*0400*0900*1000*2450*2600*3000*5020*5040*5200*6500*6501*6502*6503*6504*9992