MARC View

000			02195nam a2200289 a 4500
001			vtls000076645
003			KUKTEM
005			20251114204610.0
008			140124t2013 my a f m 000 0 eng d
020			_aTHE0001981(Local)
039		9	_a201905131552 _byusri _y201401241023 _zFida
040			_aUMP
090			_aQA76.9.S88 K46 2013 rs Bc.
100	1		_aKhor, Sze Khim
245	1	4	_aThe hybridisation of heuristic method to solve the ITC2007 examination timetabling problem / _cKhor Sze Khim
260			_aKuantan, Pahang : _bUMP, _c2013
300			_axiii, 82 p. : _bill. ; _c30 cm. + _e1 CD-ROM
502			_aProject paper (Bachelor of Computer Science (Software Engineering) -- Universiti Malaysia Pahang - 2012
504			_aBibliography : p.71-77
520	3		_aThe 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.
650		0	_aSystem design
650		0	_aManagement information systems
650		0	_aOnline data processing
650		0	_aHeuristic programming
650		0	_aExaminations _xTimetables
999			_aVIRTUA40 _c4834 _d4840
999			_aVTLSSORT00800200040009001000245026003000502050405200650065016502650365049992