{'fraction_non_alphanumeric': 0.011893870082342177, 'fraction_numerical': 0.0, 'mean_word_length': 5.63030303030303, '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}}
Improved comparative partner selection with brood recombination for genetic programming

The aim of all evolutionary methods is to find the best solution from search space without testing every solution in search space. This study employs strengths and weaknesses of solutions for finding the best solution of any problem in genetic programming. The strengths and weaknesses are used to assist in finding the right partners (solutions) during crossover operation. The probability of crossover between two solutions is evaluated using relative strengths and weaknesses as well as overall strengths of solutions (Improved Comparative Partner Selection (ICPS)). The solutions qualifying for crossover through ICPS criteria are supposed to produce better solutions and are allowed to produce more children through brood recombination. The brood recombination helps to exploit the search space close to the optimum solution more efficiently. The proposed method is applied on different benchmarking problems and results demonstrate that the method is highly efficient in exploring the search space.