{'fraction_non_alphanumeric': 0.011510791366906475, 'fraction_numerical': 0.0, 'mean_word_length': 5.15929203539823, '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}}
Generating complete university course timetables by using local search methods

The course timetabling problem of large-scale size in realistic applications is considered very hard and cannot be solved by exact methods. In this paper, we present a solution method for this timetabling problem using local search methods. The solution method consists of two phases: the first phase to provide an initial solution that satisfies all hard constraints and the second phase using a local repair method with tabu mechanism to produce high quality solution, taking the soft constraints into account. We perform preliminary experiments of the method on real data set and the results are quite promising.