Combination of Graph Heuristic with Hill Climbing Search for Solving Capacitated Examination Timetabling Problem
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...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2015
|
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1109/ICSECS.2015.7333095 http://dx.doi.org/10.1109/ICSECS.2015.7333095 http://umpir.ump.edu.my/11072/1/Combination%20of%20Graph%20Heuristic%20with%20Hill%20Climbing%20Search%20for%20Solving%20Capacitated%20Examination%20Timetabling%20Problem.pdf http://umpir.ump.edu.my/11072/7/fskkp-ashis%20kumar%20mandal-combination%20of%20graph%20heuristic.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Internet
http://dx.doi.org/10.1109/ICSECS.2015.7333095http://dx.doi.org/10.1109/ICSECS.2015.7333095
http://umpir.ump.edu.my/11072/1/Combination%20of%20Graph%20Heuristic%20with%20Hill%20Climbing%20Search%20for%20Solving%20Capacitated%20Examination%20Timetabling%20Problem.pdf
http://umpir.ump.edu.my/11072/7/fskkp-ashis%20kumar%20mandal-combination%20of%20graph%20heuristic.pdf