{'fraction_non_alphanumeric': 0.016853932584269662, 'fraction_numerical': 0.003745318352059925, 'mean_word_length': 5.412, '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 self-generating memetic algorithm for examination timetabling

Timetabling problems encompasses educational timetabling, nurse rostering, transportation timetabling and so on. The educational timetabling is one of the most widely studied timetabling problems including high school timetabling, university course and examination timetabling. In this study, we focus on the examination timetabling problem, which is one of the most important and repetitive administrative activities that occur in the educational institutions. In the last ten years or so, many methodologies have been developed to solve the examination timetabling problem. An examination timetabling problem consists of the designation of a set of exams to a given set of timeslots subject to various practical constraints. The generated timetable must satisfy all the hard constraints of a problem is called a feasible timetable. The hard constraints can not be violated. Soft constraints represent preferences that can be violated, but in many cases solution approaches attempt to reduce the number of such violations as much as they can to improve the quality of a generated timetable further. More on examination timetabling can be found in Qu et al. 2009 [12]. This study presents a self-generating multimeme algorithm for solving an examination timetabling problem at Suleyman Demirel University (SDU). Unlike previous multimeme algorithms, each meme in the proposed algorithm encodes a score as a performance indicator of the associated operator. Those scores are then used in the process of choosing operators to create/modify