{'fraction_non_alphanumeric': 0.031135531135531136, 'fraction_numerical': 0.003663003663003663, 'mean_word_length': 5.287356321839081, '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 Fast Opposition-Based Differential Evolution with Cauchy Mutation

Opposition-based Differential Evolution (ODE) has been proved to be an effective method to Differential Evolution (DE) in solving many optimization functions, and it's faster and more robust convergence than classical DE. In this paper, a fast ODE algorithm (FODE), using a local search method with Cauchy mutation is proposed. The simulation experiments are conducted on a comprehensive set of 10 complex benchmark functions. Compared with ODE, FODE is faster and more robust.