{'fraction_non_alphanumeric': 0.01473922902494331, 'fraction_numerical': 0.0, 'mean_word_length': 5.398550724637682, '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}}
Reducing the Timeslot Used in Examination Timetable Problem

In general, a university examination timetabling problem concerns with the task of matching a set of exams to resources (timeslots and rooms) in such a way that meets some predefined requirements. Majority of the examination timetabling problems are NP-complete. This paper addresses the so-called graph coloring reduction of examination timetabling problem which is to find a feasible examination timetable with minimum timeslots used. The report contains an investigation on the implementation of a heuristic hybridized with a simulated annealing-based heuristic using three different neighborhood structures. The method is tested on a popular dataset, and compare the results with several other authors. The method is capable of finding the best solutions ever reported as well as improving current best known results.