{'fraction_non_alphanumeric': 0.02053388090349076, 'fraction_numerical': 0.0, 'mean_word_length': 6.065217391304348, '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}}
Organizational evolutionary applied on geometric constraints solving

In this paper, a new optimization method, Organizational Evolutionary Algorithm (OEA), is proposed, in which a population is made of organizations and whose evolution is led by three organizational evolutionary operators, i.e. the splitting operator, the merging operator and the cooperating operator; the splitting operator controls the size of organizations and make part of organizations enter into next generation directly, which are benefit for keeping the diversity of populations; the merging operator acts as a local searching function with taking advantage of leaders information; the cooperating operator increases the adaptability degree through the interactions of organizations. OEA is successfully applied to solve the non-linear parameterization design problems. Experiments show that OEA performs better than original Generic algorithm (GA) in this application of parameterization design.