{'fraction_non_alphanumeric': 0.019635343618513323, 'fraction_numerical': 0.0, 'mean_word_length': 5.0508474576271185, '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 design and implementation of timetable system based on genetic algorithm

In this paper we establish a new algorithm based on greedy method and Genetic Algorithms to solve course timetabling problem. Timetabling is a kind of problem in which events (classes, exams, courses, etc) have to be arranged into a number of timeslots such that conflicts in using a given set of resources are avoided. First, the greedy method is used to achieve automatic course arrangement and obtain a set of feasible initial solutions. And then, use Genetic Algorithms (GA) to optimize the initial solutions of course timetables by fitness function. The experiment results show the optimized course timetables are more reasonable.