{'fraction_non_alphanumeric': 0.01834862385321101, 'fraction_numerical': 0.0, 'mean_word_length': 5.8671328671328675, '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}}
A Co-evolutionary Differential Evolution Algorithm for Constrained Optimization

In this paper, a co-evolutionary differential evolution algorithm (CODE) for constrained optimization is proposed. Two cooperative populations are constructed and evolved by independent differential evolution (DE) algorithm. The purpose of the first population is to minimize the objective function regardless of constraints, and that of the second population is to minimize the violation of constraints regardless of the objective function. Interaction and migration happens between the two populations when separate evolutions go on several generations, by migrating feasible solutions into the first group, and infeasible ones into the second group. The algorithm is tested by five famous benchmark problems, and is compared with methods based on penalty functions and cooperative co-evolutionary genetic algorithm. The results proved the proposed cooperative CODE is very effective and efficient.