{'fraction_non_alphanumeric': 0.015350877192982455, 'fraction_numerical': 0.0, 'mean_word_length': 5.384615384615385, '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 mutation hybrid algorithm of particle swarm optimization

Many mutation functions of particle positions are discussed in this paper. It is discussed the global searching capability, the local searching capability and the traversal capability of these mutation functions. And a mutation hybrid algorithm of particle swarm optimization is brought out in this paper. In each iteration, the position of particles which is satisfied the mutation condition are mutated with many kind of mutation functions, and each mutation function is endowed a probability. The probability distribution is relied on the specific optimization problem. Some experiments results of standard PSO, single mutation PSO and multi-mutation PSO are contrasted. It indicates that if the probability distribution of mutation functions set is well formed, the multi-mutation PSO will search the global best value more quickly and effectively.