|
|
|
| An Improved Binary Particle Swarm Optimizer |
| XU YiChun, XIAO RenBin |
| CAD Center, Huazhong University of Science and Technology, Wuhan 430074 |
|
|
|
|
Abstract To solve 01 integer programming, an improved optimizer is proposed based on Kenney and Eberhart's binary particle swarm optimizer (BPSO). In the proposed optimizer (IBPSO) the probability calculation is simplified. The probability of the position vector depends on the values of the global best position and the private best position, and the current position does not affect the next position any more. On the test functions of De Jong, IBPSO performs better than BPSO. The results of IBPSO on the knapsack problem show IBPSO has higher convergence speed than the genetic algorithm.
|
|
Received: 18 September 2006
|
|
|
|
|
|
[1] Kennedy J, Eberhart R C. Particle Swarm Optimization // Proc of the IEEE International Conference on Neural Networks. Perth, Australia, 1995, Ⅳ: 19421948
[2] Kenney J, Eberhart R C. A Discrete Binary Version of the Particle Swarm Algorithm // Proc of the IEEE International Conference on Systems, Man and Cybernetics. Orlando, USA, 1997, Ⅴ: 41044108
[3] Kennedy J, Eberhart R C, Shi Y. Swarm Intelligence. San Francisco, USA: Morgan Kaufmann Publishers, 2001
[4] Rao S S. Engineering Optimization-Theory and Practice. New York, USA: John Wiley, 1996
[5] Laskari E C, Parsopoulos K E, Vrahatis M N. Particle Swarm Optimization for Integer Programming // Proc of the Congress on Evolutionary Computation. Honolulu, USA, 2002, Ⅱ: 15821587
[6] Boeringer D W, Werner D H. Particle Swarm Optimization versus Genetic Algorithms for Phased Array Synthesis. IEEE Trans on Antennas and Propagation, 2004, 52(3): 771779
[7] Onwubolu G C, Clerc M. Optimal Path for Automated Drilling Operations by a New Heuristic Approach Using Particle Swarm Optimization. International Journal of Production Research, 2004, 42(3): 473491
[8] Gao Haibing, Zhou Chi, Gao Liang. General Particle Swarm Optimization Model. Chinese Journal of Computers, 2005, 28(12): 19801987 (in Chinese)
(高海兵,周 驰,高 亮.广义粒子群优化模型.计算机学报, 2005, 28(12): 19801987)
[9] Li Juan, Fang Ping, Zhou Ming. A Hybrid Genetic Algorithm for Knapsack Problem. Journal of Nanchang Institute of Aeronautical Technology, 1998, 12(3): 3135 (in Chinese)
(李 娟,方 平,周 明.一种求解背包问题的混合遗传算法.南昌航空工业学院学报, 1998, 12(3): 3135)
[10] Zhang Ling, Zhang Bo. Good Point Set Based Genetic Algorithm. Chinese Journal of Computers, 2001, 24(9): 917922 (in Chinese)
(张 铃,张 钹.佳点集遗传算法.计算机学报, 2001, 24(9): 917922) |
|
|
|
2007, Vol. 20 
