{'fraction_non_alphanumeric': 0.021148036253776436, 'fraction_numerical': 0.0, 'mean_word_length': 5.314285714285714, '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}}
A new time-dependent algorithm for post enrolment-based course timetabling problem

In this paper, we propose a new time-dependent heu-ristic algorithm for post enrolment-based course timetabling prob-lem. The algorithm operates in two stages: a constructive phase is proposed to insert events into the timetable whilst obeying most hard constraints, and a hill-climbing phase is designed to ensure the timetable meeting all the hard constraints. Each stage is allocated a time limit. The experimental results on instances from the second international timetabling competition show that our algorithm is efficient and competitive with other effective algorithms.