Particle swarm optimization (PSO) algorithm has shown promising performances on various benchmark functions and engineering optimization problems. However, it is still difficult to achieve a satisfying trade-off between exploration and exploitation for all the optimization problems and different evolving stages. Furthermore, control parameters of some related mechanisms need pre-experience by the requirement of trial-and-error scheme. This paper presents a novel PSO algorithm, which adaptively adopts various search strategies, called Self-adapting Hybrid Strategy PSO (SaHSPS). Unlike some other peer PSO variants, this method dynamically changes the probabilities of different strategies according to their previous successful searching memories, without any additional control parameters. The probabilities of different strategies would be re-initialized according to a proposed dynamic probabilistic model to diverse the population. Besides, particles are updated by probabilistically selected strategies after niching PSO with Ring topology. Moreover, a dynamic updating mechanism by niching PSO is proposed to guarantee the parallel searching capability during the whole evolution process. Thus, this proposed algorithm might be problem-independent and search-stage-independent, yielding more satisfying solutions on various optimization problems. A comprehensive experimental study is conducted on 28 benchmark functions of CEC 2013 special session on real-parameter optimization, including shifted, rotated, multi-modal, high conditioned, expanded and composition problems, compared with several state-of-the-art variants of PSO and differential evolution (DE) algorithms. Comparison results show that SaHSPS obtains outstanding performances on the majority of the test problems. Moreover, a practical engineering problem, real power loss minimization of IEEE 30-bus power system, is used to further evaluate SaHSPS. The numerical results, compared with other stochastic search algorithms, show that SaHSPS could find high-quality solutions with higher probability.
Read full abstract