{'fraction_non_alphanumeric': 0.030434782608695653, 'fraction_numerical': 0.0, 'mean_word_length': 5.578571428571428, '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}}
Real-coded evolutionary algorithms with parent-centric recombination

Due to an increasing interest in solving real-world optimization problems using evolutionary algorithms (EAs), researchers have developed a number of real-parameter genetic algorithms (GAs) in the recent past. In such studies, the main research effort is spent on developing an efficient recombination operator. Such recombination operators use probability distributions around the parent solutions to create offspring. Some operators emphasize solutions at the center of mass of parents and some around the parents. We propose a generic parent-centric recombination operator (PCX) and compare its performance with a couple of commonly-used mean-centric recombination operators (UNDX and SPX). With the help of a steady-state, elite-preserving, and computationally fast EA model, simulation results show the superiority of PCX on three test problems.