000 02472nam a2200253 a 4500
001 vtls000076584
003 KUKTEM
005 20251114204607.0
008 140110t2013 my a f m 000 0 eng d
020 _aTHE0001672(Local)
039 9 _a201905131148
_byusri
_y201401101435
_znabilah
040 _aUMP
090 _aLB2366 .L44 2013 rs Bc.
100 1 _aLee, Jian Hao
245 1 4 _aThe implementation of partial graph heuristic with improvement method to solve the UMP examination timetabling problem /
_cLee Jian Hao
260 _aKuantan, Pahang :
_bUMP,
_c2013
300 _axiii, 108 p. :
_bill. ;
_c30 cm. +
_e1 CD-ROM
502 _aProject paper (Bachelor of Computer Science (Software Engineering)) -- Universiti Malaysia Pahang – 2013
504 _aBibliography : p. 87-89
520 3 _aThe examination timetabling problem has attracted the interested of many researchers over the years. However, this problem is difficult to solve due to the lack of benchmark dataset and many constraints that need to be satisfied in examination timetabling problem. Currently, Universiti Malaysia Pahang (UMP) use proprietary system to generate the examination timetable but the weakness of this system is unable to define the quality of solution because having no evaluation function. Other than that, the UMP examination timetabling problem consist unique constraints such as distance penalty and split penalty. Having all of these constraints had made the task to solve examination timetabling problem becomes more challenging. To produce examination timetable, all of the exams need to be scheduled into timetable while satisfying the hard constraint and soft constraint. The timetable result should have the minimum penalty value in terms of spread exams, split rooms and distance between rooms. Therefore, the technique partial graph heuristic with hill climbing method should be implemented to solve UMP examination timetabling problem. The graph heuristic method will partially schedule the exam and then improved by hill climbing method. This process will be continued until finish scheduled all of the exams. By using this technique, the solution of timetable result can comply all of the constraint and has a better quality of solution compared to the result of current examination system.
650 0 _aGraph theory
650 0 _aExaminations
_xTimetables
999 _aVIRTUA40
_c4749
_d4755
999 _aVTLSSORT0080*0200*0400*0900*1000*2450*2600*3000*5020*5040*5200*6500*6501*9992