{'fraction_non_alphanumeric': 0.028669724770642203, 'fraction_numerical': 0.0, 'mean_word_length': 5.767441860465116, '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}}
Particle swarm optimization algorithms for mini-benchmark problems

Simulated annealing, genetic algorithms, evolutionary programming, swarm intelligence, and ant colony optimization are active research areas in Smart and intelligent innovative algorithms. In particular, Particle Swarm Intelligence (PSI) attracts more attentions because of its simplicity and time efficiency. Recent advance on PSI research includes a classification of PSI or Particle Swarm Optimization (PSO) to Standard PSO. A SPSO is supposed to work on most optimization problems (difficult or easy). However, with different problem constraints, no universal SPSO can work for all problems efficiently. Based on the idea of mini-benchmarking proposed by Maurice Clere, specified PSO (SPPSO) algorithms are proposed in this paper to address the four different problems raised in Maurice Clere's work.