二进制粒子群代码 java,Matlab实现NBPSO(新的二进制粒子群优化算法)算法

本文介绍了针对传统二进制粒子群优化算法(BPSO)存在的不足,提出的一种新型二进制粒子群优化算法(NBPSO)。该算法在解决连续和离散优化问题上表现出优越性。通过对比分析,研究表明NBPSO在性能上优于BPSO。参考文献包括2006年伊朗电气工程会议论文和2008年计算机科学与工程期刊文章。
摘要由CSDN通过智能技术生成

NBPSO (New Binary Particle Swarm Optimization) Algorithm

Particle swarm optimization (PSO) is one of the modern heuristic algorithms that can be applied to continuous and discrete optimization problems.

The original binary PSO (BPSO) has got some disadvantages that make the algorithm not to converge well.

To deal with these disadvantages, a new BPSO (NBPSO) is introduced. The results provided in the fallowing papers show the superiority of the NBPSO.

[1]. M.Rostami Shahrbabak and H.Nezamabadi-pour, " New Approach to Binary PSO Algorithm" 14th Iranian Conference on Electrical Engineering, may 2006.

[2]. H.Nezamabadi-pour, M.Rostami Shahrbabaki and M.Maghfoori Farsangi "Binary Particle Swarm Optimization: Challenges and new

Solutions"The CSI Journal on Computer Science and Engineering Vol. 6, No. 1 (a), 2008.

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值