Abstract
Due to the low computational precision, local optimal solution and slow convergence speed of particle swarm optimization (PSO) algorithm, an improved PSO (SAQPSO) algorithm based on simulated annealing (SA) and quantum theory is proposed in this paper. The first, quantum theory is used to change the updating mode of the particles in order to improve the search speed and the convergence precision, and guarantee the simplification and effectiveness. Then the SA with probability and local search ability is introduced into quantum PSO (QPSO) in order to keep the diversity of the population, avoid falling into local optimum and enhance the global search ability. The SAQPSO algorithm keeps the characteristics of the simple and easy implementation, improves the global optimization ability and the convergence speed and the accuracy. Finally, some benchmark functions are used to prove the validity of the proposed SAQPSO algorithm. The computational results show that the proposed SAQPSO algorithm takes on the fast convergence speed, the better robustness and global search ability.
Sign-in/Register to access full text options 
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: International Journal of Database Theory and Application
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.
