粒子群算法(C++版)

《粒子群算法(C++版)》由会员上传分享，免费在线阅读，更多相关内容在行业资料-天天文库。

1、//#pragmawarning(disable:4786)//#pragmacomment(linker,"/STACK:16777216")//HEAD#include#include#include#include#include#include#include#include#include

2、algorithm>#include#includeusingnamespacestd;typedeflonglongLL;constdoubleMAX_VAL=(double)1e18;constintMAX_GEN=30;///最大迭代次数constintMAX_SCALE=3000;///最大种群规模constintMAX_CITY=20+2;///最大城市数constdoubleW_VAL=0.729;///structSO{intx,y;SO(){}SO(intx,inty):x(x),y(y){

3、}};structPoint{doublex,y;Point(){}Point(intx,inty):x(x),y(y){};voidread(){scanf("%lf%lf",&x,&y);}};inlineintrandomI(intx){returnrand()%x;}inlinedoublerandomD(){return(double)rand()/RAND_MAX;}inlinedoublegetDist(Pointa,Pointb){returnsqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b

4、.y));}structPSO{doublew;intscale;intcityNum;intnowGen;///当前代数intmaxGen;///迭代次数intbestNum;intbestGen;///最佳出现代数doubledist[MAX_CITY][MAX_CITY];intoPop[MAX_SCALE][MAX_CITY];///粒子群doublefitness[MAX_SCALE];///种群适应度，表示种群中各个个体的适应度vectorlistV[MAX_SCALE];///每科粒子的初始交换序列intPd[MAX_

5、SCALE][MAX_CITY];///一颗粒子历代中出现最好的解，doublevPd[MAX_SCALE];///解的评价值intPgd[MAX_CITY];///整个粒子群经历过的的最好的解，每个粒子都能记住自己搜索到的最好解doublevPgd;///最好的解的评价值PSO(){}PSO(ints,intc,intmG,doubleww,doubled[MAX_CITY][MAX_CITY]){scale=s;cityNum=c;maxGen=mG;w=ww;for(inti=0;i

6、cityNum;j++)dist[i][j]=d[i][j];}voidcopyArray(doublea[],doubleb[],intn){for(inti=0;i

7、++){if(x==oPop[i][r])break;}if(r==j){oPop[i][j]=x;//cout<

8、[i].push_back(so);//cout<