{'fraction_non_alphanumeric': 0.013718411552346571, 'fraction_numerical': 0.0, 'mean_word_length': 5.328767123287672, '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}}
The incorporation of late acceptance hill climbing strategy in the deterministic optimization of examination scheduling framework: A comparison with the traditional hill climbing

In this study, we are incorporating the Late Acceptance Hill Climbing (LAHC) strategy in the proposed Domain Transformation Approach (DTA) to solve the university examination scheduling problem. This is with the aim to test whether LAHC can substitute the original traditional greedy Hill Climbing (HC) in the proposed framework, in order to clarify that the DTA is flexible enough to accommodate different search procedures in its optimization stage. We would also like to investigate the performance of LAHC in comparison to the HC optimization in producing solutions based on the Toronto standard benchmark datasets problem. Based on our findings, it was shown that LAHC has been incorporated successfully in the proposed DTA and therefore DTA is proven to be very flexible and systematic approach. The LAHC procedure had produced very encouraging results during the experiments. LAHC managed to outperformed HC results for some datasets but on average both quality solutions were on par. Since it is hard to predict the quality of the solutions using LAHC, it is suggested that HC optimization is more reliable, robust and efficient in generating good quality timetables in the proposed DTA framework.