Parallel Swarms Oriented Particle Swarm Optimization. (5th November 2013)

• Record Type: Journal Article
• Authors: Gonsalves, Tad; Egashira, Akira
• Other Names: Liu Baoding Academic Editor.
• Is Part Of: Applied computational intelligence and soft computing. Volume 2013(2013)
• Publication Date: 2013-11-05
• Subjects: Computational intelligence -- Periodicals; Soft computing -- Periodicals; 006.305
• DOI: 10.1155/2013/756719
• Languages: English
• ISSNs: 1687-9724

Abstract

Abstract : The particle swarm optimization (PSO) is a recently invented evolutionary computation technique which is gaining popularity owing to its simplicity in implementation and rapid convergence. In the case of single-peak functions, PSO rapidly converges to the peak; however, in the case of multimodal functions, the PSO particles are known to get trapped in the local optima. In this paper, we propose a variation of the algorithm called parallel swarms oriented particle swarm optimization (PSO-PSO) which consists of a multistage and a single stage of evolution. In the multi-stage of evolution, individual subswarms evolve independently in parallel, and in the single stage of evolution, the sub-swarms exchange information to search for the global-best. The two interweaved stages of evolution demonstrate better performance on test functions, especially of higher dimensions. The attractive feature of the PSO-PSO version of the algorithm is that it does not introduce any new parameters to improve its convergence performance. The strategy maintains the simple and intuitive structure as well as the implemental and computational advantages of the basic PSO.