Abstract
Particle swarm optimization is a powerful algorithm that has been applied to various kinds of problems. However, it suffers from falling into local minimum and prematurity especially on multimodal function optimization problems. In this paper, a phased adaptive particle swarm optimization(PAPSO) is proposed to solve such problem. The process is divided into the initial particle pre-searching phase and the post-searching cooperative phase. In the post phase, the strategy of selecting randomly a certain number of particles for entering the reverse-learning is one of the most effective ways of escaping local stagnation. The illustrative example is provided to confirm the validity, as compared with the SPSO, Dynamic Inertia Weight PSO(PSO-W), and Tradeoff PSO(PSO-T) in terms of convergence speed and the ability of jumping out of the local optimal value. Simulation results confirm that the proposed algorithm is effective and feasible.
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 callDisclaimer: 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.
