{'fraction_non_alphanumeric': 0.02456140350877193, 'fraction_numerical': 0.0, 'mean_word_length': 5.6395348837209305, '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}}
An evolution strategy with competing subpopulations

Evolution strategies, based on the natural evolution, are the algorithms to solve the parameter optimization problems numerically. In this paper, a new evolution strategy (ES) is proposed to solve optimal control problems. With a view to making a balance between exploration and exploitation, a competing subpopulation based arithmetical crossover technique is proposed. The effectiveness of the proposed ES is illustrated by some simulations for the push-cart (a discrete-time optimal control model) control problem.