000			03223ntm a2200373 i 4500
999			_c99346 _d99352
003			MY-KuUP
005			20251125110727.0
006			t||||fr|||| 000 0
007			ta
008			230410t20222022my a|||fr|||| 000 0 eng d
020			_aTHE0009589 (Local) _qHardback
040			_aUMP _beng _cUMP _erda
090			_aFKOM .C43 2022 r Thesis
100	1		_aChang Ling Shing, _eauthor.
245	1	0	_aSolving ump examination timetabling problem using dynamic exploration step counting hill climbing algorithm _cChang Ling Shing
264		1	_aKuantan, Pahang : _bUMP, _c2022
264		4	_c©2022
300			_axv, 149 pages : _billustrations (some color) ; _c30 cm. + _e1 CD-ROM
336			_2rdacontent _atext
336			_2rdacontent _atext
337			_2rdamedia _aunmediated
337			_2rdamedia _acomputer
338			_2rdacarrier _avolume
338			_2rdacarrier _acomputer disc
347			_2rda _atext file _bPDF
500			_aFaculty of Computing
502			_aThesis (Master of Science) -- Universiti Malaysia Pahang – 2022
504			_aIncludes bibliographical references
520	3		_aExamination timetabling is a process that involves assigning exams to available timeslot and room(s) to satisfy the hard and soft constraints. An example of such constraint includes no clashing, back-to-back examinations, room capacity constraints and many others. These constraints complicate the assignment of examination to available timeslot and room(s). UMP currently operates from two separate campuses in Gambang and Pekan, Pahang, Malaysia. Operating from two distant campuses forms new constraints different from those reported in the literature. These new constraints further complicate the problem in obtaining a feasible and quality examination timetable. Furthermore, there is no formal mathematical model to assist UMP in evaluating the quality of the examination timetable. Therefore, this forms the motivation of this research to solve the UMP examination timetabling problem with the new examination constraints. The work starts by developing a formal mathematical model based on the new constraints and generates a feasible initial solution of the examination timetable that satisfies the hard and soft constraints (as much as possible). Then, the initial solution is improved using our enhanced algorithm called dynamic exploration step counting hill climbing (DESCHC). The DESCHC employs a dynamic decay rate value to encourage exploration of the search space. The cost bound that acts as the level of acceptance dynamically changes depending on the acceptance of the candidate and improvement in the penalty cost. Experimental results show that DESCHC was able to produce quality solutions. In semester 1-2014/2015, DESCHC produced a solution that is 92.86% better than the UMP examination timetable. In semester 2-2014/2015, DESCHC produced a solution that is 96.13% better than the UMP examination timetable. Moreover, the solution produced by DESCHC satisfies all of the hard constraints that the UMP examination timetable failed to achieve.
610	2	0	_aFaculty of Computing _xDissertations
650		0	_aUniversities and colleges _xDissertations
650		0	_aTheses
942			_2lcc _cTHESIS