{'fraction_non_alphanumeric': 0.02437106918238994, 'fraction_numerical': 0.006289308176100629, 'mean_word_length': 5.333333333333333, '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}}
HIDMS-PSO: A New Heterogeneous Improved Dynamic Multi-Swarm PSO Algorithm

In this paper, a variant of the particle swarm optimisation (PSO) algorithm is introduced with heterogeneous behaviour and a new dynamic multi-swarm topological structure. The new topological structure enables the algorithm to have more control over the interaction and information exchange between the particles to reduce the loss of diversity and avoid premature convergence. In the new algorithm, the population is initially divided into two sub-populations, first sub-population is further divided into sub-swarms that are formed using the introduced topological structure. The particles of sub-swarms are guided using heterogeneous behaviour by selecting various exemplars. The second sub-population employs the classical PSO search with local and global information to simulate a homogenous behaviour. There is information flow between the two subpopulations. The algorithm was tested on the CEC2005 and CEC2017 test suites with comparison against various state-of the-art PSO variants and other state-of-the-art meta-heuristics. The experimental results show that for the two test suites, the proposed algorithm outperformed the majority of the state-of the-art algorithms on most problems.