粒子群算法(C语言版本).docx

粒子群算法/ PSO.cpp : Defines the entry point for the console application./#include stdafx.h#includestdio.h#includestdlib.h#includetime.h#includemath.h#define rdint(i) (rand()%(int)(i)/*随机数的定义*/#define rdft() (double)(double)rdint(16384)/(16383.0)#define rnd(a,b) (rdint(int)(b)-(int)(a)+1)+(int)(a)#define POPSIZE 20#define DIMENSION1 2 /* 目标函数中所含变量x的个数 */#define DIMENSION2 6 /约束条件的个数double W=1.0;double C1=1.8;double C2=1.8;double VMAX=3.0;double XMIN=2.0;double XMAX=4.0;double PDIMENSION1;double PBEST;double H,K;double gDIMENSION2;/约束条件的值struct indidouble numberDIMENSION1;double bestDIMENSION1;double bestfitness;double fitness;double speedDIMENSION1;individualPOPSIZE;void initiate(void);void calculation(int number);void globalbest(int number);void localbest(int number);void judge(int num);void judge(int num)/* 6个约束条件 */g0=4*individualnum.number0-individualnum.number1;g1=individualnum.number1-10*individualnum.number0;g2=-2*K*individualnum.number1+3*3.14*pow(individualnum.number0,3);g3=-50*K*individualnum.number1+75*3.14*pow(individualnum.number0,3);g4=-H+3.98*individualnum.number1;g5=3*pow(individualnum.number1,3)-2000*pow(individualnum.number0,4);void initiate()int i,j;for(i=0;iPOPSIZE;i+) do for(j=0;jDIMENSION1;j+)individuali.numberj=rdft()*(XMAX-XMIN)+XMIN;judge(i);while(g0=0 & g1=0 & g2=0 & g3=0 & g4=0 & g5=0);/如果不在可行域就对这个粒子重新进行初始化for(i=0;iPOPSIZE;i+)for(j=0;jDIMENSION1;j+)individuali.speedj=VMAX*rdft();for(i=0;iPOPSIZE;i+)for(j=0;jDIMENSION1;j+)individuali.bestj=individuali.numberj;for(i=0;iPOPSIZE;i+)calculation(i);for(i=0;iPOPSIZE;i+)individuali.bestfitness=individuali.fitness;globalbest(0);void localbest(int number)int i;judge(number);/进行判断，如果不在可行域内就不对粒子的历史最优值进行更新bool bTrue=g0=0 & g1=0 & g2=0 & g3=0 & g4=0 & g5individualnumber.fitness&bTrue)for(i=0;iDIMENSION1;i+)individualnumber.besti=individualnumber.numberi;individualnumber.bestfitness=individualnumber.fitness;void globalbest(int number)int i,j;double s=0;int flag=0;if(number=0)s=individual0.fitness;flag=0;for(i=1;iPOPSIZE;i+)if(individuali.fitnesss)s=individuali.fitness;flag=i;for(i=0;iDIMENSION1;i+)Pi=individualflag.numberi;PBEST=individualflag.fitness;elsefor(i=0;iPOPSIZE;i+)if(individuali.bestfitnessPBEST)for(j=0;jDIMENSION1;j+)Pj=individuali.bestj;PBEST=individuali.bestfitness;void calculation(int num)K=(4*individualnum.number1-individualnum.number0)/4*(individualnum.number1-individualnum.number0)+0.615*individualnum.number0/individualnum.number1;H=(2000*pow(individualnum.number0,5)/pow(individualnum.number1,3)+1.5*individualnum.number0+75*3.14*pow(individualnum.number0,3)/(4*K);/L=2000*3.14*pow(individualnum.number0,4)/pow(individualnum.number1,2)+1.5*3.14*individualnum.number1;individualnum.fitness=0.25*3.14*pow(individualnum.number1,2)*H;void main(void)int i,j,k,t,total=0;double sum=0;/srand(time(NULL);for(j=0;j10;j+)initiate();for(i=0;i5000;i+)W=1.0-i*0.6/4999;if(PBEST-67997.0)0.1)total+;sum=sum+i;break;elsefor(k=0;kPOPSIZE;k+)for(t=0;tVMAX)individualk.speedt=VMAX;individualk.numbert=individualk.numbert+individualk.speedt;if(individualk.numbertXMAX)individualk.numbert=fmod(individualk.numbert,(XMAX-XMIN)+XMIN;calculation(k);localbest