{'fraction_non_alphanumeric': 0.012345679012345678, 'fraction_numerical': 0.0, 'mean_word_length': 5.9523809523809526, '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 GA-based multiple simulated annealing

The design of hybrid metaheuristics with ideas from the simulated annealing and evolutionary algorithms fields is a fruitful research line. In this paper, we present a new hybrid algorithm based on a genetic algorithm, whose search process simulates several parallel simulated annealing processes. An empirical study comparing the new model with classic simulated annealing, hybrid metaheuristics based on evolutionary algorithms and simulated annealing, and two evolutionary algorithms, concludes that the alternative scheme for combining ideas from simulated annealing and evolutionary algorithms introduced by the proposal may improve the performance of this kind of hybrid algorithms.