03223ntm a2200373 i 4500 0 0 lcc 0 1 20000 20000 2023-04-10 0 FKOM .C43 2022 r Thesis T000002177 2023-04-10 00:00:00 2023-04-10 THESIS 0 0 lcc 0 0 20000 20000 2023-04-10 0 CD13255 T000002178 2023-04-10 00:00:00 2023-04-10 THESIS 99346 99352 MY-KuUP 20251125110727.0 t||||fr|||| 000 0 ta 230410t20222022my a|||fr|||| 000 0 eng d THE0009589 (Local) Hardback UMP eng UMP rda FKOM .C43 2022 r Thesis Chang Ling Shing, author. Solving ump examination timetabling problem using dynamic exploration step counting hill climbing algorithm Chang Ling Shing Kuantan, Pahang : UMP, 2022 ©2022 xv, 149 pages : illustrations (some color) ; 30 cm. + 1 CD-ROM rdacontent text rdacontent text rdamedia unmediated rdamedia computer rdacarrier volume rdacarrier computer disc rda text file PDF Faculty of Computing Thesis (Master of Science) -- Universiti Malaysia Pahang – 2022 Includes bibliographical references Examination 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. Faculty of Computing Dissertations Universities and colleges Dissertations Theses lcc THESIS