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 algor ithm 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Computational Methods in Sciences and Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
