A novel concurrent particle swarm optimization

Abstract

In this paper, a concurrent PSO (CONPSO) algorithm is proposed to alleviate the premature convergence problem of PSO algorithm. It is a type of parallel algorithm in which modified PSO and FDR-PS algorithms are simulated concurrently with frequent message passing between them. This algorithm avoids the possible crosstalk effect of pbest and gbest terms with nbest term in FDR-PSO. Thereby, search efficiency of proposed algorithm is improved. In order to demonstrate the effectiveness of the proposed algorithm, experiments were conducted on six benchmarks continuous optimization problems. Results clearly demonstrate the superior performance of the proposed algorithm in terms of solution quality, average computation time and consistency. This algorithm is very much suitable for the implementation in parallel computer.