1、 double pc; /交叉率 double pm; /变异率struct individual char chromchromlength+1;double value; double fitness; /适应度;int generation; /世代数int best_index;int worst_index;struct individual bestindividual; /最佳个体struct individual worstindividual; /最差个体struct individual currentbest;struct individual populationPOP
2、SIZE;/函数声明 void generateinitialpopulation();void generatenextpopulation();void evaluatepopulation();long decodechromosome(char *,int,int);void calculateobjectvalue();void calculatefitnessvalue();void findbestandworstindividual();void performevolution();void selectoperator();void crossoveroperator();
3、void mutationoperator();void input();void outputtextreport();void generateinitialpopulation( ) /种群初始化 int i,j; for (i=0;ipopsize; i+) for(j=0;jchromlength;j+)populationi.chromj=(rand()%2010)?0:1; populationi.chromchromlength=0 void generatenextpopulation() /生成下一代 selectoperator(); crossoveroperator(
4、); mutationoperator();void evaluatepopulation() /评价个体,求最佳个体 calculateobjectvalue(); calculatefitnessvalue(); findbestandworstindividual();long decodechromosome(char *string ,int point,int length) /给染色体解码 int i; long decimal=0; char*pointer;for(i=0,pointer=string+point;length;i+,pointer+) if(*pointer
5、-) decimal +=(long)pow(2,i); return (decimal);void calculateobjectvalue() /计算函数值 long temp1,temp2; double x1; i0.0) temp=cmin+populationi.value; else temp=0.0;else if (functionmode=minimization) if(populationi.valuebestindividual.fitness) bestindividual=populationi; best_index=i; else if (population
6、i.fitness=currentbest.fitness) currentbest=bestindividual;void performevolution() /演示评价结果 if (bestindividual.fitnesscurrentbest.fitness) currentbest=populationbest_index; populationworst_index=currentbest;void selectoperator() /比例选择算法 int i,index; double p,sum=0.0; double cfitnessPOPSIZE; struct ind
7、ividual newpopulationPOPSIZE;sum+=populationi.fitness;for(i=0; cfitnessi=populationi.fitness/sum; for(i=1; cfitnessi=cfitnessi-1+cfitnessi; p=rand()%1000/1000.0; index=0; while (pcfitnessindex) index+; newpopulationi=populationindex; populationi=newpopulationi;void crossoveroperator() /交叉算法 int inde
8、xPOPSIZE; int point,temp; double p; char ch;i+) indexi=i; point=rand()%(popsize-i); temp=indexi; indexi=indexpoint+i; indexpoint+i=temp;popsize-1;i+=2) if (ppc) point=rand()%(chromlength-1)+1; for (j=point; jj+) ch=populationindexi.chromj; populationindexi.chromj=populationindexi+1.chromj; populatio
9、nindexi+1.chromj=ch; void mutationoperator() /变异操作 p=rand()%1000/1000.0; if (ppm) populationi.chromj=(populationi.chromj=)?void input() /数据输入 /printf(初始化全局变量:n); /printf( 种群大小(50-500): /scanf(%d, &popsize);popsize=500; if(popsize%2) != 0) /printf( 种群大小已设置为偶数n popsize+; 最大世代数(100-300):maxgeneration);
10、maxgeneration=200; 交叉率(0.2-0.99):%fpc);pc=0.95; 变异率(0.001-0.1):pm);pm=0.03;void outputtextreport()/数据输出double sum;double average;sum=0.0;sum+=populationi.value;average=sum/popsize;printf(当前世代=%dn当前世代平均函数值=%fn当前世代最优函数值=%fn,generation,average,populationbest_index.value);void main() /主函数 int i;long tem
11、p1,temp2; double x1,x2; generation=0; input(); generateinitialpopulation(); evaluatepopulation(); while(generationmaxgeneration) generation+; generatenextpopulation(); evaluatepopulation(); performevolution(); outputtextreport(); printf( 统计结果: /printf(最大函数值等于:%fn,currentbest.fitness);其染色体编码为:%c,curr
12、entbest.chromi); temp1=decodechromosome(currentbest.chrom,0,length1); printf(x1=%lfn,x1); /这是需要修改的地方最优值等于:,(pow(x1,5)-3*x1-1)*(pow(x1,5)-3*x1-1);+二元函数代码+#define POPSIZE 500#define length2 20#define chromlength length1+length2 /染色体长度/-求最大还是最小值int functionmode=maximization;/-/-变量上下界float min_x1=0;float max_x1=3;float min_x2=1;float max_x2=5;populationi.chromj=(rand()%4020)? temp2=decodechromosome(populationi.chrom,length1,length2); x2=(max_x2-min_x2)*temp2/(1024*1024-1)+min_x2; /-函数populationi.value=x1*x1+sin(x1*x2)-x2*x2; populationwor
copyright@ 2008-2022 冰豆网网站版权所有
经营许可证编号:鄂ICP备2022015515号-1