Skip to content

inscredion/PSO

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 
 
 

Repository files navigation

PSO

加权粒子群算法函数求极值c语言代码 迭代次数100次 种群数量50

经典公式如下

$$ν_{id}^{(k+1)} = ν_{id}^k + c_1 r_1 (pbest_{id}^k - x_{id}^k) + c_2 r_2 (gbest_{id}^k - x_{id}^k) x_{id}^{(k+1)} = ν_{id}^{(k+1)} + x_{id}^k$$

加权算法如下:

$$ν_{id}^{(k+1)} = w ν_{id}^k + c_1 r_1 (pbest_{id}^k - x_{id}^k) + c_2 r_2 (gbest_{id}^k - x_{id}^k) x_{id}^{(k+1)} = ν_{id}^{(k+1)} + x_{id}^k$$

上式c1 , c2取0.5时收敛效果较好,与MATLAB的最优值相比,误差较小,但任然存在。 将c1,c2设置为3时,误差达到最小。

About

加权粒子群算法函数求极值c语言代码

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors

Languages