模式识别与人工智能
Sunday, Apr. 13, 2025 Home      About Journal      Editorial Board      Instructions      Ethics Statement      Contact Us                   中文
  2007, Vol. 20 Issue (6): 788-793    DOI:
Papers and Reports Current Issue| Next Issue| Archive| Adv Search |
An Improved Binary Particle Swarm Optimizer
XU YiChun, XIAO RenBin
CAD Center, Huazhong University of Science and Technology, Wuhan 430074

Download: PDF (549 KB)   HTML (1 KB) 
Export: BibTeX | EndNote (RIS)      
Abstract  To solve 01 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.
Key wordsParticle Swarm Optimization      01 Integer Programming      Knapsack Problem     
Received: 18 September 2006     
ZTFLH: TP181  
Service
E-mail this article
Add to my bookshelf
Add to citation manager
E-mail Alert
RSS
Articles by authors
XU YiChun
XIAO RenBin
Cite this article:   
XU YiChun,XIAO RenBin. An Improved Binary Particle Swarm Optimizer[J]. , 2007, 20(6): 788-793.
URL:  
http://manu46.magtech.com.cn/Jweb_prai/EN/      OR     http://manu46.magtech.com.cn/Jweb_prai/EN/Y2007/V20/I6/788
Copyright © 2010 Editorial Office of Pattern Recognition and Artificial Intelligence
Address: No.350 Shushanhu Road, Hefei, Anhui Province, P.R. China Tel: 0551-65591176 Fax:0551-65591176 Email: bjb@iim.ac.cn
Supported by Beijing Magtech  Email:support@magtech.com.cn