{'fraction_non_alphanumeric': 0.01227830832196453, 'fraction_numerical': 0.0, 'mean_word_length': 5.3826086956521735, '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}}
Evolving solutions to the school timetabling problem

There has been a large amount of research into the development of automated systems for creating school timetables. Methodologies such as constraint programming, simulated annealing, and Tabu search have been applied to many school timetabling problems. The research presented in this paper forms part of work-in-progress aimed at evaluating genetic algorithms as a means of solving the school timetabling problem. In previous work a genetic algorithm was successful applied to solving the school timetabling problem with hard constraints. The paper presents our first attempt at extending this system to cater for school timetabling problems with both hard and soft constraints.