{'fraction_non_alphanumeric': 0.008888888888888889, 'fraction_numerical': 0.0, 'mean_word_length': 5.361581920903955, '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}}
New Metropolis coefficients of Particle Swarm Optimization

This paper is presented to improve the optimizing efficiency and stability of the particle swarm optimization (PSO) algorithm in real number space by developing the learning coefficients of the PSO. The new variable coefficients, which are named metropolis coefficients due to the originality and similarity of the metropolis probability in the simulated annealing, are presented as nonlinear functions of the generation of particles and the distances from each particle to the private and social optimal position in the problem space. This approach about the Metropolis coefficients is not only the graft but the fusion of PSO and simulated annealing. The application tests show that the improved PSO with the Metropolis coefficients can get the optimal position in the problem space by using less iteration steps than the traditional PSO, and the added computation of the variable coefficients does not increase the single iteration computing time much. So the new metropolis coefficients can save both the iteration and time of the optimization computing of PSO.