收稿日期: 2009-11-13
修回日期: 2010-05-04
网络出版日期: 2010-10-25
基金资助
国家“973”计划项目(20091072); 国家“十一五”重点科技攻关项目(2006BAA02A17)
Demand-Side Resource Planning Based on CNBPSO Algorithm
Received date: 2009-11-13
Revised date: 2010-05-04
Online published: 2010-10-25
Supported by
国家“973”计划项目(20091072); 国家“十一五”重点科技攻关项目(2006BAA02A17)
黄平 张尧 于金杨 . 基于CNBPSO算法的需求侧资源计划[J]. 华南理工大学学报(自然科学版), 2010 , 38(10) : 130 -133,152 . DOI: 10.3969/j.issn.1000-565X.2010.10.024
In order to avoid the local extrema of binary particle swarm optimization(BPSO),a new algorithm,namely Chaos Niche Binary Particle Swarm Optimizer(CNBPSO),is proposed by introducing chaotic parameters and the Niche technique in the velocity updating formula of particle swarm optimization(PSO) algorithm.Then,CNBPSO is used to solve two ILS problems with different complexities,and the results are compared with those obtained by BPSO.It is found that CNBPSO is superior to BPSO due to its simplicity,fast speed and equilibrium convergence.
/
| 〈 |
|
〉 |