標(biāo)準(zhǔn)遺傳算法-c++源程序(二進(jìn)制)

1、#include<stdio.h>#include<stdlib.h>#include<time.h>#include<fstream.h># include<windows.h>#define popsize 500#define maximization 1#define minimization 2#define random(x) (rand()%(x)#define cmax 100/*最大值函數(shù)適應(yīng)度的設(shè)置*/#define cmin 0/*最小值函數(shù)適應(yīng)度的設(shè)置*/#define length 1 10#define l

2、ength2 10#definechromlengthlength 1+length2int functionmode 二 maximization; /*optimization type即函數(shù)類型，是求 最大值函數(shù)還是最小值函數(shù)*/int a=100;int popsize=80;int maxgeneration=200;double pc=0.6;double pm=0.001;struct individualchar chromchromlength+1 ; double value;double fitness;；int generation;int best_index;int

3、 worst_index;struct individual bestindividual; struct individual worstindividual; struct individual currentbest;struct individual population popsize;void generatelnitialpopulation(void); void generatenextpopulation(void); void evaluatepopulation(void);longdecodechromosome(char*,int,int);void caculat

4、eobj ectvalue(void); void caculatefitnessvalue(void);voidfindbestandworstlndividual(void); void performevolution(void); void selectionoperator(void); void crossoveroperator(void); void mutationoperator(void); void outputtextreport(void);void main()srand(unsigned)time(null);隨時(shí)間而改變隨機(jī)數(shù)generation=0; gen

5、erateinitialpopulation(); evaluatepopulation(); while(generation<maxgeneration)generation+; generatenextpopulation(); evaluatepopulation(); performevolution(); outputtextreport(); void generatelnitialpopulation(void)int ij;for(i=0;i<popsize;i+)for(j=0 ;j <chromlength ;j+)populationi.chromj=

6、(random(10)<5)?t:o;population i .chromchromleng th=,0,; void generatenextpopulation(void) selectionoperator();crossoveroperator();mutationoperator();void evaluatepopulation(void)caculateobj ectvalue();caculatefitnessvalue();findbestandworstindividual();longdecodechromosome(char*string,int point,i

7、nt length)int i;long decimal二0;char pointer;for(i=0,pointer=string+point;i<length ;i+,pointer+)decimal+=(*pointer-lo,)«(length-l-ireturn(decimal);void caculateobj ectvalue(void)int i;long templ,temp2;double xl,x2;for(i=0;i<popsize;i+)temp 1 =decodechromosome(populati oni .chrom,0,length 1

8、);temp2=decodechromosome(populati on i. chrom,length 1 ,length2);xl=4.096*templ/1023.0-2.048;x2=4.096*temp2/1023.0-2.048;population i .value 二 100*(x 1 *x 1 -x2)*(xl*xlx2)+(lxl)*(lxl);void caculatefitnessvalue(void)int i;double temp;for(i=0;i<popsize;i+)if(functionmode=maximization)if(populationi

9、.value+cmin)>0.0)temp=cmin+populationi .value;else temp=0.0;if(fimctionmode 二二 minimizationif (population i .value<cmax)temp=cmax-populationi .value;else temp=0.0;population i .fitness 二 temp;voidfindbestandworstlndividual(void)int i;double sum=0.0;bestindi vidual=population 0; wors tindi vidu

10、al=population 0; for(i=l ;i<popsize;i+)if(population i. fitness>bestindi vidua 1.fitness)bestindi vidual=population i; best_index=i;if(populationi.fitness<worstindividual .fitness)worstindi vidual=population i; worst_index=i;sum+二 population i. fitness;if(generation=0)currentbest 二 bestindi

11、vidual;elseif (bestindividual. fitness>currentbest. f itness) currentbest=bestindividual;void performevolution(void)if (bestindividual. fitness>currentbest.f itness) currentbest=populationbest_index;elsepopulation worst_index=currentbest;void selectionoperator(void)int i,index;double p;double

12、sum=0.0;double c fitness popsize;structindividualnewpopulation popsize;for(i=0;i<popsize;i+)sum+二 population i. fitness;for(i=0;i<popsize;i+) cfitnessi=populationi.fitness/sum;for(i=l ;i<popsize;i+)cfitnessi =cfitness i-1 +cfitnessi;for(i=0;i<popsize;i+)p=(rand()/(double)(rand_max); inde

13、x=0;while(p>cfitnessindex) index+;newpopulation i population index;for(i=0;i<popsize;i+)population i=ne wpopulation i;void crossoveroperator(void)int i,j ；int index popsize;int point, temp; double p; char ch;for(i=0; i<pops ize; i+) index i=i; for(i=0;i<popsize;i+)point=random(popsize-i)

14、;/*random( popsize-1 )=rand()%(popsize-1 )*/ temp 二 index i;index i二 index point+i; index point+i二 temp;/*循環(huán)實(shí)現(xiàn)種群內(nèi)隨機(jī)兩兩交換打亂種群順序*/for(i=0;i<popsize;i+=2)p=(rand()/(double)(rand_max);if(p<pc)point=rand()%(chromlength-1)+1 ;/random(chromlength-1)+1;for(j 二 point ;j <chromlength ;j+)ch 二 populati

15、on index i. chrom j ;population index i. chrom j =popula tion index i+1 .chromj;population index i+1. chrom j 二 ch; void mutationoperator(void)int ij;double p;for(i=0;i<popsize;i+)for(j =0 ;j <chromlength ;j+)p=(rand()/(double)(rand_max); if(p<pm)population i. chrom j 二(population i .chromj

16、=,0f)?,r：l0,;void outputtextreport(void)int i=0;double average;fstream kan_table;kan_table.open("f:kan_table.txt",ios: app|ios:out);double sum;sum=0.0;for(i=0;i<popsize;i+) sum+=populationi .value;average=sum/popsize;kan_table«ngen=n«generation«l7l； kan_table«n ave=n «average«","