{'fraction_non_alphanumeric': 0.010652463382157125, 'fraction_numerical': 0.0013315579227696406, 'mean_word_length': 5.266666666666667, '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}}
Adding Knowledge And Efficient Data Structures To Evolutionary Programming: A Cultural Algorithm For Constrained Optimization

This paper proposes a technique in which domain knowledge obtained from the search is used to improve the performance of evolutionary programming. Our approach is based on the concept of a cultural algorithm and is applied to constrained optimization problems in which a map of the feasible region is used to guide the search more efficiently. Our implementation uses 2n-trees to store more efficiently this map of the feasible region. Our results indicate that the approach is able to produce very competitive results (we compared our results with respect to the homomorphous maps) at a considerably low computational cost.