{'fraction_non_alphanumeric': 0.012216404886561954, 'fraction_numerical': 0.0, 'mean_word_length': 5.1063829787234045, '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}}
Parallel usage of multiple optimization algorithms for searching different candidate spaces

There are many optimization algorithms that can be used for the purpose of optimization. Those algorithms are searching the so called candidate space. Those candidates are possible solutions. We are trying to find the one that represents the best solution as possible. It is possible to use parallelization to speed up the search. We introduce in this paper an approach how to use parallelization, where we are using multiple algorithms that are searching different search spaces.