{'fraction_non_alphanumeric': 0.029556650246305417, 'fraction_numerical': 0.0, 'mean_word_length': 5.233128834355829, '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}}
Self-Adaptive Parent to Mean-Centric Recombination for Real-Parameter Optimization

Most real-parameter genetic algorithms (RGAs) use a blending of participating parent solutions to create offspring solutions through its recombination operator. The blending operation creates solutions either around one of the parent solutions (having a parent-centric approach) or around the centroid of the parent solutions (having a mean-centric approach). In this paper, we argue that a self-adaptive approach in which a parent-centric or a mean-centric approach is adopted based on population statistics is a better procedure than either approach alone. We propose a self-adaptive simulated binary crossover (SA-SBX) approach for this purpose. On a suite of eight unimodal and multi-modal test problems, we demonstrate that a RGA with SASBX approach performs reliably and consistently better in locating the global optimum solution than the RGA with the original parent-centric SBX operator and the well-known CMA-ES approach.