Abstract
This article presented a parallel metaheuristic algorithm based on the Particle Swarm Optimization (PSO) to solve global optimization problems. In recent years, many metaheuristic algorithms have been developed. The PSO is one of them is very effective to solve these problems. But PSO has some shortcomings such as premature convergence and getting stuck in local minima. To overcome these shortcomings, many variants of PSO have been proposed. The comprehensive learning particle swarm optimizer (CLPSO) is one of them. We proposed a better variation of CLPSO, called the parallel comprehensive learning particle swarm optimizer (PCLPSO) which has multiple swarms based on the master-slave paradigm and works cooperatively and concurrently. The PCLPSO algorithm was compared with nine PSO variants in the experiments. It showed a great performance over the other PSO variants in solving benchmark functions including their large scale versions. Besides, it solved extremely fast the large scale problems.
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: Engineering Applications of Artificial Intelligence
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.
