The Analysis and Improvement of Binary Particle Swarm Optimization

In this paper, the binary Particle Swarm Optimization (PSO) is analyzed with bit change rate and velocity expected value, which results is that binary PSO is more and more stochastic, has the powerful ability of global search, but cannot converge to the optimal particle of swarm. So the Binary PSO is lack of local exploration which instructs the improvement of BPSO. Based on the analysis, an improved Binary PSO is proposed which changes the formula of its probability mapping and the formula of bit obtaining value. The new formulas are favorable of particle’ s convergence to the optimal particle and to intensify the local exploration of binary PSO. With 0/1 knapsack problem, the experiment conducted in this paper shows that the improved binary PSO is outperformed to original binary PSO.

[1]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[2]  Yang Guangyou,et al.  A Modified Particle Swarm Optimizer Algorithm , 2007, 2007 8th International Conference on Electronic Measurement and Instruments.

[3]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[4]  Peng-Yeng Yin,et al.  A discrete particle swarm algorithm for optimal polygonal approximation of digital curves , 2004, J. Vis. Commun. Image Represent..

[5]  Xingsheng Gu,et al.  A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan ☆ , 2008 .

[6]  Pin Luarn,et al.  A discrete version of particle swarm optimization for flowshop scheduling problems , 2007, Comput. Oper. Res..

[7]  Colin G. Johnson,et al.  Particle swarm for attribute selection in Bayesian classification: an application to protein function prediction , 2008 .

[8]  Wei Kong,et al.  A combination of modified particle swarm optimization algorithm and support vector machine for gene selection and tumor classification. , 2007, Talanta.

[9]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

[10]  Imtiaz Ahmad,et al.  Particle swarm optimization for task assignment problem , 2002, Microprocess. Microsystems.