{'fraction_non_alphanumeric': 0.012237762237762238, 'fraction_numerical': 0.0, 'mean_word_length': 5.122994652406417, '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}}
Managing search in a partitioned Search space in GA

Converging to suboptimal solutions in genetic algorithms prevents the search from reaching the global optima. Search space could have several suboptimal but one optimal solution. As the suboptimal solutions are within the search space, dividing the search space would bound them in different divisions. Thus, searching in each division separately would increase the probability of reaching the global optima. In other words, the optimal solution would be bounded in one of the divisions and then searching that division would result in finding the optimal solution. Although, the suboptimal solutions could be in the same division as optimal solution but the chance of finding the optimal solution in this case would be more compared to the cases that have no division. The proposed methodology divide the search space into partitions called regions. Individuals will be assigned to each region. The search continues while each set of individuals are focused in searching a region. Preliminary results shows a fair improvement in the performance and efficiency compared to genetic algorithm.