半变异函数拟合指数模型.doc

半边也函数的应用半变异函数拟合指数模型程序(c+代码)#include #include #include #include #include #define S 1 /*试验次数 */#define G 2000 /*混合迭代次数*/#define P 200 /*个体总数*/#define M 20 /*族群数*/#define I 10 /*因此，一个族群中的个体数是10*/#define V 3 /*个体维数*/#define N 10 /*族群内更新次数*/#define MAX 10#define MIN 0double DMAX=1.0; /*蛙跳的最大值*/double DMIN=0.4; /*蛙跳的最大值*/double D=MAX/1; /*蛙跳的最大值*/int i1,i2,i3,i4,ii;int try_number=0;int try_max=5;double C=1.0;#define R (double)(rand()%10000)/10000)/0-1之间的随机数,精度为1/10000/#define R1 rand()%100/100.0static int kk;double PI=3.14159265;double Tolerance=0.0000001;/收敛精度double c3=0.03;/扰动幅度double e=2.718281828459;/自然对数底数int sm=3;int bz=0;/扰动因子标志double awV;double nihe172=1115.658026,8.70628355,1915.362904,8.20840555,2467.305693,9.1856689,2952.330784,9.0543057,5095.207855,9.132906445,5418.830566,8.852431395,4146.89209,9.45153145,6037.806376,9.103558859,4818.459044,7.2313171,5143.558017,9.0538129,5459.844361,9.74985695,5762.570046,8.6310193,6060.453719,9.194387,6356.051127,10.398948,6651.015103,9.8449629,6941.254523,7.2279982,7223.868903,6.579128;typedef struct double dV;double fitness;Individal;typedef struct double hV;heli;Individal pwM;/*族群中个体最差位置*/Individal pbM;/*族群中个体最好位置*/Individal px;/*全体中最好位置*/Individal individualP;/*全部个体*/Individal popMI;/*排序后的群组*/Individal tempM;Individal temp1I;Individal tem;Individal temxS;/*计算标准差*/*选择测试函数为Sphere*/double fitness(double a)int i;double sum=0.0;double sum1=0.0;double s1=0.0,h1=0.0;double x1V+1;for(i=0;iV;i+)x1i=ai;for(i=0;iV;i+) for(i=0;ix12)sum1=x10+x11;elsesum1=nihei1-(x10+x11*(1.5*nihei0-0.5*pow(nihei0,3)/pow(x12,3); sum=sum+sum1;return sum; /*对每一个个体初始化*/void init() int i,j; srand(unsigned)time(NULL)+kk+);for(i=0;iP;i+)for(j=0;jV;j+)individuali.dj=R*(MAX-MIN)+MIN;individuali.fitness=fitness(individuali.d);px.fitness=individualP-1.fitness;/*按照适应度降序对全部个体进行排序和族群划分*/void sort()int i,j,k;for(i=1;iP;i+)for(j=0;jP-i;j+)if(individualj.fitnessindividualj+1.fitness) tem=individualj;individualj=individualj+1;individualj+1=tem; k=0;/*按照规则分组*/ for(i=0;iI;i+) for(j=0;jindividualP-1.fitness)px=individualP-1;for(i=0;iM;i+)pwi=popi0;pbi=popiI-1;/*对某个群组中的个体进行重新排序*/void sortPop(int b)int i,j;for(i=1;iI;i+)for(j=0;jI-i;j+)if(popbj.fitnesspopbj+1.fitness) tem=popbj; popbj=popbj+1; popbj+1=tem; /*群组内更新*/void update()int i,j,k,l,n;double a;double b; for(n=0;nN;n+) for(i=0;iM;i+) /temp1I=popi; a=0.0; b=0.0;/fitnessFw(i);/D=DMIN+(DMAX-DMIN)*(G-i2)/G; /D=DMIN+(DMAX-DMIN)*pow(e,-30*pow(i2/G,sm); for(j=0;jD) if(tempi.dj0) tempi.dj=D;else tempi.dj=-D; tempi.dj+=pwi.dj;if(tempi.djMAX)tempi.dj=MAX; if(tempi.djMIN)tempi.dj=MIN; a=fitness(tempi.d); tempi.fitness=a; if(apwi.fitness) popi0=tempi; sortPop(i); pwi=popi0; pbi=popiI-1; else/标志 for(k=0;kD) if(tempi.dk0.0) tempi.dk=D; else tempi.dk=-D; tempi.dk+=pwi.dk;if(tempi.dkMAX)tempi.dk=MAX; if(tempi.dkMIN)tempi.dk=MIN; / a+=tempi.dk*tempi.dk;/适应度值计算/z=z+(x1i*x1i-10*cos(2*PI*x1i)+10); a=fitness(tempi.d); tempi.fitness=a; if(apwi.fitness) popi0=tempi; sortPop(i); pwi=popi0; pbi=popiI-1; else for(l=0;lV;l+) popi0.dl=R*(MAX-MIN)+MIN; / b+=popi0.dl*popi0.dl;/适应度值计算 /popi0.fitness=b; popi0.fitness=fitness(popi0.d); sortPop(i); pwi=popi0; pbi=popiI-1; /标志 /*M循环 for(ii=0;iipbii.fitness) px=pbii;/*N循环/*将popMI复制到individual*/void copy()int i,j,k;i=0;for(j=0;jM;j+) for(k=0;kI;k+) individuali=popjk; i+;void report()printf(第%d次试验极值为%.10en,i1+1,px.fitness);double sigma() int j; double f=0.0; double fitness_avg=0.0; for (j=0;jS;j+) / printf(极值e为%16fn,temxj.fitness);fitness_avg=fitness_avg+temxj.fitness; fitness_avg=fitness_avg/S; printf(平均值为%.16en,fitness_avg); /printf(%d极值e为%.16fn,j,temxj.fitness); for (j=0;jS;j+) f=f+fabs(temxj.fitness-fitness_avg)*fabs(temxj.fitness-fitness_avg); / printf(极值e为%.16fn,f); f=sqrt(f/(S-1); return f;void main() clock_t start,end; double ave,sigmax; FILE *f=fopen(result(SFLA).txt,w); ave=0.0;start=clock(); for(i1=0;i1S;i1+) init(); for(i2=0;i2G;i2+) sort(); update(); copy();temxi1=px;report(); ave=ave+px.fitness; sigmax=sigma(); end=clock(); ave=ave/S; /printf(平均极值为n%.16fnCompleted!,ave);printf(50次试验标准差为%.16en,sigmax); printf(50次试验平均运行时间=%.2fsecondsn,(double)(end-start)/(S*(double)CLOCKS_PER_SEC); printf(50次试验的