Abstract
The quantum behavior particle swarm optimization algorithm is analyzed in this paper. The swarm particle search behavior is studied in the algorithm. The local attractive points of the algorithm are analyzed. The different search environments are given for particles in the search process. The algorithm can adaptively learn to optimize the problem environment, and appropriate learning mode is adopt to improve the overall optimization performance of the algorithm. The self-learning quantum particle swarm optimization algorithm is compared with other improved methods by CEC2014 benchmark test function. Finally, the results are analyzed. The simulation results show that the self-learning method can significantly improve the performance of the quantum particle swarm optimization algorithm.
Keywords
Get full access to this article
View all access options for this article.
