Combination of Graph Heuristic with Hill Climbing Search for Solving Capacitated Examination Timetabling Problem

• المؤلفون الرئيسيون: Ashis Kumar, Mandal, M. N. M., Kahar
• التنسيق: Conference or Workshop Item
• اللغة: English; English
• منشور في: 2015
• الموضوعات: QA76 Computer software
• الوصول للمادة أونلاين: http://umpir.ump.edu.my/id/eprint/11072/1/Combination%20of%20Graph%20Heuristic%20with%20Hill%20Climbing%20Search%20for%20Solving%20Capacitated%20Examination%20Timetabling%20Problem.pdf; http://umpir.ump.edu.my/id/eprint/11072/7/fskkp-ashis%20kumar%20mandal-combination%20of%20graph%20heuristic.pdf; http://umpir.ump.edu.my/id/eprint/11072/; http://dx.doi.org/10.1109/ICSECS.2015.7333095

Examination timetabling problem is a nontrivial task due to its NP-hard nature as well as the involvement of numerous constraints. Moreover, solving capacitated examination timetabling is more challenging compared to uncapacitated one. This paper implements graph heuristic with hill climbing search...