A new particle swarm optimization algorithm with adaptive inertia weight based on Bayesian techniques

Graphical abstractA new particle swarm optimization algorithm based on the Bayesian techniques(BPSO) is proposed. Fig. 1 is the comparisons between different inertia weight strategies for f5 on 10 dimensions. Fig. 2 is comparisons between different PSO methods for f5 on 10 dimensions. Parameter s is the interval of the adjacent two inertia weight change in all iterations. As shown in Fig. 3, different values of s affect the convergence rate in the test function. Fig. 4 is the change of ω in the iterations. Display Omitted HighlightsWhy BPSO can achieve the excellent balance between exploration and exploitation in optimization processing is explained.To overcome the defect of ordinary PSO, a new algorithm with adaptive inertia weight based on Bayesian techniques is proposed.Analysis of parameters s and ω in the BPSO. Particle swarm optimization is a stochastic population-based algorithm based on social interaction of bird flocking or fish schooling. In this paper, a new adaptive inertia weight adjusting approach is proposed based on Bayesian techniques in PSO, which is used to set up a sound tradeoff between the exploration and exploitation characteristics. It applies the Bayesian techniques to enhance the PSO's searching ability in the exploitation of past particle positions and uses the cauchy mutation for exploring the better solution. A suite of benchmark functions are employed to test the performance of the proposed method. The results demonstrate that the new method exhibits higher accuracy and faster convergence rate than other inertia weight adjusting methods in multimodal and unimodal functions. Furthermore, to show the generalization ability of BPSO method, it is compared with other types of improved PSO algorithms, which also performs well.