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...