{'fraction_non_alphanumeric': 0.013806706114398421, 'fraction_numerical': 0.0, 'mean_word_length': 6.055555555555555, '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 metaevolutionary approach for the traveling salesman problem

The metaevolutionary approach used in searching for the best combination of crossover operators for the traveling salesman problem is described. Since different crossover operators preserve different useful properties, the combination of operators may out-perform a single operator. Rather than randomly search for the best combination of crossover operators, the metaevolutionary approach is used. Preliminary results confirm this hypothesis.