Abstract

Particle swarm optimization (PSO) is an optimization algorith that has received much attention in recent years. PSO is a simple and computationally inexpensive algorithm inspired by social behavior of bird flocks and fish schools. However, PSO suffers from premature convergence, especially in high dimensional multimdoal functions. To improve PSO performance on global optimization problems, this paper proposes a novel approach, called Plowing PSO algorithm, through introductng a new operator to PSO. The proposed approach combines the exploration ability of random search with the features of PSO. Our approach is validated using ten common complex unimodal/multimodal bencmark functions. The simulation results demostrate that the proposed approach is superior in avoiding premature convergence to standard PSO, and five variation of it. Therefore, the Plowing PSO algorithm is successful in improving standard PSO to solve complex numerical function optimization problems.

Full Text
Paper version not known

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 call

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.