Abstract
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 un-capacitated one. This paper implements graph heuristic with hill climbing search to solve the capacitated examination timetabling considering partial examination assignment concepts. The algorithm starts with ordering all the exams according to graph heuristic approach and then partial exams are considered for construction. Afterwards, the qualities of these exams are improved using hill climbing search. The entire process continues until scheduling all the exams. The effects of different graph heuristic orderings and exam assignment values on the quality of the solutions are studied. We test the proposed approach on ITC2007 benchmark exam datasets which contains highly constraint capacitated datasets. Experimental results reveal that the approach is able to produce quality solutions for all datasets and competitive results with competition results.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
