{'fraction_non_alphanumeric': 0.016593886462882096, 'fraction_numerical': 0.0, 'mean_word_length': 5.47457627118644, '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}}
Quantum-Behaved Particle Swarm Optimization with Novel Adaptive Strategies

Quantum-behaved particle swarm optimization (QPSO), motivated by analysis from particle swarm optimization (PSO) and quantum mechanics, has shown excellent performance in finding the optimal solutions for many optimization problems. In QPSO, the mean best position, defined as the average of the personal best positions of all the particles in a swarm, is employed as a global attractor to attract the particles to search solutions globally. This paper presents a comprehensive analysis of the mean best position and proposes several novel adaptive strategies to determine the position. In particular, four variants of mean best position are proposed to serve as global attractors and the corresponding parameter selection methods are also provided. Empirical studies on a suite of well-known benchmark functions are undertaken in order to make an overall performance comparison among the proposed methods and other QPSO and PSO variants. The simulation results show that the proposed QPSO algorithm have some advantages over the original QPSO and other PSO algorithms.