{'fraction_non_alphanumeric': 0.008860759493670886, 'fraction_numerical': 0.0, 'mean_word_length': 5.760683760683761, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Solving examination timetabling problem using partial exam assignment with hill climbing search

This paper describes a method that combines graph heuristics and hill climbing for addressing the examination timetable problem. In this approach, all exams are ordered with graph heuristic ordering approach and partial exams are considered for scheduling. These partial scheduled exams are then improved using hill climbing until all exams have been successfully scheduled. Various exam assignment values with different graph heuristics ordering have been investigated. The proposed approach has been tested over the twelve Toronto benchmark datasets. The experimental results and comparison with other methods demonstrate that the proposed approach is able to produce good quality timetable.