Chuan, Wei Kiat (2014) The graph heuristic with great deluge algorithm to solve the ITC2007 examination timetabling problem. Faculty of Computer Systems and Software Engineering, Universiti Malaysia Pahang.
|
PDF
FSKKP - CHUAN WEI KIAT.PDF Download (1MB) | Preview |
Abstract
Examination timetabling problem involve allocating the exams into a specific or limited number of timeslot and rooms. The produce examination timetable should meet all the hard constraints and achieve the soft constrains as much as possible. In this research, dataset of examination track from second International Timetabling Competition (ITC 2007) will be use. This dataset contains of total of twelve dataset which have different features (i.e. number of room, exam and timeslot). The graph heuristic with great deluge algorithm will be used to solve this problem. We hope that the proposed technique will be able to produce better result than other technique in the literature.
| Item Type: | Undergraduates Project Papers |
|---|---|
| Additional Information: | Project paper (Bachelor of Computer Science (Graphic and Multimedia Technology) With Honours -- Universiti Malaysia Pahang - 2014 |
| Uncontrolled Keywords: | graph heuristic; examination timetabling; great deluge algorithm |
| Subjects: | Q Science > Q Science (General) T Technology > T Technology (General) |
| Faculty/Division: | Faculty of Computer System And Software Engineering |
| Depositing User: | Ms. Nurezzatul Akmal Salleh |
| Date Deposited: | 17 Jun 2016 07:11 |
| Last Modified: | 11 Aug 2021 04:29 |
| URI: | http://umpir.ump.edu.my/id/eprint/13407 |
| Download Statistic: | View Download Statistics |
Actions (login required)
 |
View Item |