Particle swarm optimization with chaotic opposition-based population initialization and stochastic search technique

Particle swarm optimization (PSO) is a relatively new optimization algorithm that has been applied to a variety of problems. However, it may easily get trapped in a local optima when solving complex multimodal problems. To address this concerning issue, we propose a novel PSO called as CSPSO to improve the performance of PSO on complex multimodal problems in the paper. Specifically, a stochastic search technique is used to execute the exploration in PSO, so as to help the algorithm to jump out of the likely local optima. In addition, to enhance the global convergence, when producing the initial population, both opposition-based learning method and chaotic maps are employed. Moreover, numerical simulation and comparisons with some typical existing algorithms demonstrate the superiority of the proposed algorithm. (C) 2012 Elsevier B.V. All rights reserved.