Examination timetabling using harmony search algorithm
The examination timetabling problem concerns with the process of assigning exam entities to the particular slots and rooms in a timetable. The aim is to fulfil the hard constraints as well as the soft constraints to the highest grade possible in order to construct an optimum timetable. In this proje...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| التنسيق: | أطروحة |
| اللغة: | English English |
| منشور في: |
2015
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | http://eprints.utem.edu.my/id/eprint/15890/1/EXAMINATION%20TIMETABLING%20USING%20HARMONY%20SEARCH%20%2824%20pgs%29.pdf http://eprints.utem.edu.my/id/eprint/15890/2/Examination%20timetabling%20using%20harmony%20search%20algorithm.pdf |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| الملخص: | The examination timetabling problem concerns with the process of assigning exam entities to the particular slots and rooms in a timetable. The aim is to fulfil the hard constraints as well as the soft constraints to the highest grade possible in order to construct an optimum timetable. In this project, the Harmony Search Algorithm (HSA) has been applied to develop the examination timetable for Kolej Profesional MARA. The HSA consist of five steps, which are initialize the HSA parameters, initialize the Harmony Memory (HM), improvise new solutions, update the HM and achieve the termination criteria. The results stated in this research has been showed that the proposed examination timetable system capable to construct the timetable in fewer time compare with the current approach. |
|---|