标准遗传算法 c++源程序(二进制)

1、#include#include#include#include#include#definePOPSIZE500#defineMAXIMIZATION1#defineMINIMIZATION2#definerandom(x)(rand()%(x)#defineCmax100/*最大值函数适应度的设置*/#defineCmin0/*最小值函数适应度的设置*/#defineLENGTH110#defineLENGTH210#defineCHROMLENGTHLENGTH1+LENGTH2intFunctionMode=MAXIMIZATION;/optimizationtype即函数类型，是求最

2、大值函数还是最小值函数*/inta=100;intPopSize=80;intMaxGeneration=200;doublePc=0.6;doublePm=0.001;structindividualcharchromCHROMLENGTH+1;doublevalue;doublefitness;intgeneration;intbest_index;intworst_index;structindividualbestindividual;structindividualworstindividual;structindividualcurrentbest;structindividual

3、populationPOPSIZE;voidGenerateInitialPopulation(void);voidGenerateNextPopulation(void);voidEvaluatePopulation(void);longDecodeChromosome(char*,int,int);voidCaculateObjectValue(void);voidCaculateFitnessValue(void);voidFindBestAndWorstIndividual(void);voidPerformEvolution(void);voidSelectionOperator(v

4、oid);voidCrossoverOperator(void);voidMutationOperator(void);voidOutputTextReport(void);voidmain()srand(unsigned)time(NULL);/generation=0;GenerateInitialPopulation();EvaluatePopulation();while(generationMaxGeneration)generation+;GenerateNextPopulation();EvaluatePopulation();PerformEvolution();OutputT

5、extReport();voidGenerateInitialPopulation(void)inti,j;for(i=0;iPopSize;i+)for(j=0;jCHROMLENGTH;j+)populationi.chromj=(random(10)5)?1:0;populationi.chromCHROMLENGTH=0;voidGenerateNextPopulation(void)SelectionOperator();CrossoverOperator();MutationOperator();voidEvaluatePopulation(void)CaculateObjectV

6、alue();CaculateFitnessValue();FindBestAndWorstIndividual();longDecodeChromosome(char*string,intpoint,intlength)inti;longdecimal=0;char*pointer;for(i=0,pointer=string+point;ilength;i+,pointer+)decimal+=(*pointer-0)(length-1-i);return(decimal);voidCaculateObjectValue(void)inti;longtemp1,temp2;doublex1

7、,x2;for(i=0;iPopSize;i+)temp1=DecodeChromosome(populationi.chrom,0,LENGTH1);temp2=DecodeChromosome(populationi.chrom,LENGTH1,LENGTH2);x1=4.096*temp1/1023.0-2.048;x2=4.096*temp2/1023.0-2.048;populationi.value=100*(x1*x1-x2)*(x1*x1-x2)+(1-x1)*(1-x1);voidCaculateFitnessValue(void)inti;doubletemp;for(i=

8、0;i0.0)temp=Cmin+populationi.value;elsetemp=0.0;if(FunctionMode=MINIMIZATION)if(populationi.valueCmax)temp=Cmax-populationi.value;elsetemp=0.0;populationi.fitness=temp;voidFindBestAndWorstIndividual(void)inti;doublesum=0.0;bestindividual=population0;worstindividual=population0;for(i=1;ibestindividua

9、l.fitness)bestindividual=populationi;best_index=i;if(populationi.fitnesscurrentbest.fitness)currentbest=bestindividual;voidPerformEvolution(void)if(bestindividual.fitnesscurrentbest.fitness)currentbest=populationbest_index;elsepopulationworst_index=currentbest;voidSelectionOperator(void)inti,index;d

10、oublep;doublesum=0.0;doublecfitnessPOPSIZE;structindividualnewpopulationPOPSIZE;for(i=0;iPopSize;i+)sum+=populationi.fitness;for(i=0;iPopSize;i+)cfitnessi=populationi.fitness/sum;for(i=1;iPopSize;i+)cfitnessi=cfitnessi-1+cfitnessi;for(i=0;icfitnessindex)index+;newpopulationi=populationindex;for(i=0;

11、iPopSize;i+)populationi=newpopulationi;voidCrossoverOperator(void)inti,j;intindexPOPSIZE;intpoint,temp;doublep;charch;for(i=0;iPopSize;i+)indexi=i;for(i=0;iPopSize;i+)point=random(PopSize-i);/*random(PopSize-1)=rand()%(PopSize-1)*/temp=indexi;indexi=indexpoint+i;indexpoint+i=temp;/*/for(i=0;iPopSize

12、;i+=2)p=(rand()/(double)(RAND_MAX);if(pPc)point=rand()%(CHROMLENGTH-1)+1;/random(CHROMLENGTH-1)+1;for(j=point;jCHROMLENGTH;j+)ch=populationindexi.chromj;populationindexi.chromj=populationindexi+1.chromj;populationindexi+1.chromj=ch;voidMutationOperator(void)inti,j;doublep;for(i=0;iPopSize;i+)for(j=0

13、;jCHROMLENGTH;j+)p=(rand()/(double)(RAND_MAX);if(pPm)populationi.chromj=(populationi.chromj=0)?1:0;voidOutputTextReport(void)inti=0;doubleaverage;fstreamkan_table;kan_table.open(f:kan_table.txt,ios:app|ios:out);doublesum;sum=0.0;for(i=0;iPopSize;i+)sum+=populationi.value;average=sum/PopSize;kan_tablegen=generation,;kan_tablea