{'fraction_non_alphanumeric': 0.02838221381267739, 'fraction_numerical': 0.002838221381267739, 'mean_word_length': 5.69620253164557, '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}}
Enhanced multi-operator differential evolution for constrained optimization

Over the last two decades, many differential evolution algorithms have been introduced to solve constrained optimization problems. Due to the variability of characteristics of such problems, no single algorithm performs consistently well over all of them. In this paper, for a better coverage of the problem characteristics, we introduce an enhanced multi-operator differential evolution algorithm, which utilizes the strengths of multiple search operators at each generation, and places more emphasis on the best-performing ones during the optimization process based on three measures: (1) the quality of solutions; (2) the feasibility rate; and (3) diversity. In addition, an improved self-adaptive mechanism for automatically controlling the scaling factor and crossover rate is proposed. The performance of the algorithm is assessed using a well-known set of constrained problems, with the experimental results demonstrating that it is superior to state-of-the-art algorithms.