{'fraction_non_alphanumeric': 0.019933554817275746, 'fraction_numerical': 0.0, 'mean_word_length': 5.216494845360825, '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 Study in Set Recombination

A family of problems for which the solution is a fixed size set is studied, using fitness functions with varying degrees of epistasis. An empirical comparison between a traditional crossover operator with a binary representation and a penalty function, and the representationindependent Random Assorting Recombination Operator (RAR) is performed. RAR is found to perform marginally better in all cases. Since RAR is a parameterised operator, a study of the effect of varying its parameter, which can control any trade-off between respect and assortment, is also presented.