A Survey on Parallel Particle Swarm Optimization Algorithms

摘要

Most of the complex research problems can be formulated as optimization problems. Emergence of big data technologies have also commenced the generation of complex optimization problems with large size. The high computational cost of these problems has rendered the development of optimization algorithms with parallelization. Particle swarm optimization (PSO) algorithm is one of the most popular swarm intelligence-based algorithm, which is enriched with robustness, simplicity and global search capabilities. However, one of the major hindrance with PSO is its susceptibility of getting entrapped in local optima and; alike other evolutionary algorithms the performance of PSO gets deteriorated as soon as the dimension of the problem increases. Hence, several efforts are made to enhance its performance that includes the parallelization of PSO. The basic architecture of PSO inherits a natural parallelism, and receptiveness of fast processing machines has made this task pretty convenient. Therefore, parallelized PSO (PPSO) has emerged as a well-accepted algorithm by the research community. Several studies have been performed on parallelizing PSO algorithm so far. Proposed work presents a comprehensive and systematic survey of the studies on PPSO algorithms and variants along with their parallelization strategies and applications.