{'fraction_non_alphanumeric': 0.023323615160349854, 'fraction_numerical': 0.0, 'mean_word_length': 5.735294117647059, '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}}
Adaptive particle swarm optimization algorithm

The particle swarm optimization (PSO) has exhibited good performance on optimization. However, the parameters, which greatly influence the algorithm stability and performance, are selected depending on experience of designer. The selection of parameters needs to consider both the convergence and avoiding premature convergence. Adaptive PSO (APSO) was presented, based on the stability criterion of the PSO as a time-varying discrete system. Simulation results of some well-known problems show that APSO not only ensure the stability of algorithm, but also avoid premature convergence effectively and clearly outperform the standard PSO.