{'fraction_non_alphanumeric': 0.015594541910331383, 'fraction_numerical': 0.0, 'mean_word_length': 5.339506172839506, '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 Degree of Oneness Conor Ryan Computer Science Department University College Cork Ireland conor

This paper investigates the use of diploid structures and the possibility of using diploidy in non-standard, non-binary Genetic Algorithms. Unlike the conventional implementation of diploidy in GAs, which typically involves the use of dominance operators, the diploid schemes presented in this paper avoid the use of dominance altogether, while still being rooted firmly in natural biology. The use of diploid structures allows a population to adapt more quickly in unstable environments, which allows the varying of testcases, whether through evolution to gently increase the difficulty of the problem or through some other selection method to reduce testing time. Two new schemes are introduced, additive diploidy and polygenic inheritance, both of which outperform current methods, and both of which are general enough to be applied to a GA with any number of phenotypes, without any need for the use of dominace operators.