C++實現(xiàn)粒子群優(yōu)化算法代碼

#include<iostream>#include<cmath>#include<ctime>#include<cstdlib>usingnamespacestd;constintpNum=10;constintgeneration=100;constintdim=2;constdoublelow=-10;constdoublehigh=10;constdoublevMax=10;constdoublew=0.5;constdoublec1=2;constdoublec2=2;doublep[pNum][dim];〃粒子群體doublepv[pNum][dim];〃速度向量doublepBest[pNum][dim];〃每個粒子的局部最優(yōu)向量doublepFitness[pNum];〃每個粒子的最優(yōu)最適值doublegFitness;//全局最優(yōu)適應(yīng)值doublegBest[dim];〃全局最優(yōu)向量doublefitness(doublep[]){returnp[0]*p[0]+p[1]*p[1];//根據(jù)自己的需要更改函數(shù)的適應(yīng)值}voidinitialize。{for(inti=0;i<pNum;i++){for(intj=0;j<dim;j++){p[i][j]=low+(high-low)*1.0*rand()/RAND_MAX;pBest[i][j]=p[1][j];pv[i][j]=-vMax+2.0*vMax*rand()/RAND_MAX;}}for(inti=0;i<pNum;i++)pFitness[i]=fitness(p[i]);gFitness=pFitness[O];for(inti=0;i<dim;i++){gBest[i]=pBest[0][i];}for(inti=1;i<pNum;i++){if(gFitness>pFitness[i]){gFitness=pFitness[i];for(intj=0;j<dim;j++){gBest[j]=pBest[i][j];}}}}voidupdate(){for(inti=0;i<pNum;i++){for(intj=0;j<dim;j++){pv[i][j]=w*pv[i][j]+cl*rand()/RAND_MAX*(pBest[i][j]-p[i][j])+c2*rand()/RAND_MAX*(gBest[j]-p[i][j]);if(pv[i][j]<-vMax)pv[i][j]=-vMax;if(pv[i][j]>vMax)pv[i][j]=vMax;p[i][j]=p[i][j]+pv[i][j];if(p[i]j>high)p[i][j]=high;if(p[i][j]<low)p[i][j]=low;}}}voidget_pBest(){for(inti=0;i<pNum;i++)if(pFitness[i]>fitness(p[i])){pFitness[i]=fitness(p[i]);for(intj=0;j<dim;j++){pBest[i][j]=p[i][j]；}}}}voidget_gBest(){for(inti=0;i<pNum;i++){if(pFitness[i]<gFitness){for(intj=0;j<dim;j++){gBest[j]=pBest[i][j];}gFitness=pFitness[i];}}}intmain(){srand(time(O));initialize。；for(intn=0;n<generation;n++){update();get_pBest();get_gBest();}cout<<"gBestis(";for(inti=0;i<dim-1;i++)cout<<gBest[i]<<