详细介绍如何利用各种语言(C++,C,JAV等)实现遗传算法

%TSP问题（又名：旅行商问题，货郎担问题）遗传算法通用matlab程序 (2)一个C++的程序： (4)C语言程序： (8)改进后用来求解VRP问题的Delphi程序： (21)%TSP问题（又名：旅行商问题，货郎担问题）遗传算法通用matlab程序%D是距离矩阵，n为种群个数,建议取为城市个数的1~2倍，%C为停止代数，遗传到第C代时程序停止,C的具体取值视问题的规模和耗费的时间而定%m为适应值归一化淘汰加速指数,最好取为1,2,3,4 ,不宜太大%alpha为淘汰保护指数,可取为0~1之间任意小数,取1时关闭保护功能,最好取为0.8~1.0 %R为最短路径,Rlength为路径长度function [R,Rlength]=geneticTSP(D,n,C,m,alpha)[N,NN]=size(D);farm=zeros(n,N);%用于存储种群for i=1:nfarm(i,:)=randperm(N);%随机生成初始种群endR=farm(1,:);%存储最优种群len=zeros(n,1);%存储路径长度fitness=zeros(n,1);%存储归一化适应值counter=0;while counter<Cfor i=1:nlen(i,1)=myLength(D,farm(i,:));%计算路径长度endmaxlen=max(len);minlen=min(len);fitness=fit(len,m,maxlen,minlen);%计算归一化适应值rr=find(len==minlen);R=farm(rr(1,1),:);%更新最短路径FARM=farm;%优胜劣汰，nn记录了复制的个数nn=0;for i=1:nif fitness(i,1)>=alpha*randnn=nn+1;FARM(nn,:)=farm(i,:);endendFARM=FARM(1:nn,:);[aa,bb]=size(FARM);%交叉和变异while aa<nif nn<=2nnper=randperm(2);elsennper=randperm(nn);endA=FARM(nnper(1),:);B=FARM(nnper(2),:);[A,B]=intercross(A,B);FARM=[FARM;A;B];[aa,bb]=size(FARM);endif aa>nFARM=FARM(1:n,:);%保持种群规模为nendfarm=FARM;clear FARMcounter=counter+1endRlength=myLength(D,R);function [a,b]=intercross(a,b)L=length(a);if L<=10%确定交叉宽度W=1;elseif ((L/10)-floor(L/10))>=rand&&L>10W=ceil(L/10);elseW=floor(L/10);endp=unidrnd(L-W+1);%随机选择交叉范围，从p到p+W for i=1:W%交叉x=find(a==b(1,p+i-1));y=find(b==a(1,p+i-1));[a(1,p+i-1),b(1,p+i-1)]=exchange(a(1,p+i-1),b(1,p+i-1)); [a(1,x),b(1,y)]=exchange(a(1,x),b(1,y));endfunction [x,y]=exchange(x,y)x=y;y=temp;% 计算路径的子程序function len=myLength(D,p)[N,NN]=size(D);len=D(p(1,N),p(1,1));for i=1:(N-1)len=len+D(p(1,i),p(1,i+1));end%计算归一化适应值子程序function fitness=fit(len,m,maxlen,minlen)fitness=len;for i=1:length(len)fitness(i,1)=(1-((len(i,1)-minlen)/(maxlen-minlen+0.000001))).^m; end一个C++的程序：//c++的程序#include<iostream.h>#include<stdlib.h>template<class T>class Graph{public:Graph(int vertices=10){n=vertices;e=0;}~Graph(){}virtual bool Add(int u,int v,const T& w)=0;virtual bool Delete(int u,int v)=0;virtual bool Exist(int u,int v)const=0;int V ertices()const{return n;}int Edges()const{return e;}protected:int n;};template<class T>class MGraph:public Graph<T>{public:MGraph(int V ertices=10,T noEdge=0);~MGraph();bool Add(int u,int v,const T& w);bool Delete(int u,int v);bool Exist(int u,int v)const;void Floyd(T**& d,int**& path);void print(int V ertices);private:T NoEdge;T** a;};template<class T>MGraph<T>::MGraph(int V ertices,T noEdge){n=V ertices;NoEdge=noEdge;a=new T* [n];for(int i=0;i<n;i++){a[i]=new T[n];a[i][i]=0;for(int j=0;j<n;j++)if(i!=j)a[i][j]=NoEdge;}}template<class T>MGraph<T>::~MGraph(){for(int i=0;i<n;i++)delete[]a[i];delete[]a;}template<class T>bool MGraph<T>::Exist(int u,int v)const{if(u<0||v<0||u>n-1||v>n-1||u==v||a[u][v]==NoEdge)return false; return true;}template<class T>bool MGraph<T>::Add(int u,int v,const T& w){if(u<0||v<0||u>n-1||v>n-1||u==v||a[u][v]!=NoEdge){ cerr<<"BadInput!"<<endl;return false;}a[u][v]=w;e++;return true;}template<class T>bool MGraph<T>:delete(int u,int v){if(u<0||v<0||u>n-1||v>n-1||u==v||a[u][v]==NoEdge){ cerr<<"BadInput!"<<endl;return false;}a[u][v]=NoEdge;e--;return true;}template<class T>void MGraph<T>::Floyd(T**& d,int**& path) {d=new T* [n];path=new int* [n];for(int i=0;i<n;i++){d[i]=new T[n];path[i]=new int[n];for(int j=0;j<n;j++){d[i][j]=a[i][j];if(i!=j&&a[i][j]<NoEdge)path[i][j]=i;else path[i][j]=-1;}}for(int k=0;k<n;k++){for(i=0;i<n;i++)for(int j=0;j<n;j++)if(d[i][k]+d[k][j]<d[i][j]){d[i][j]=d[i][k]+d[k][j];path[i][j]=path[k][j];}}}template<class T>void MGraph<T>::print(int V ertices){for(int i=0;i<V ertices;i++)for(int j=0;j<V ertices;j++){cout<<a[i][j]<<' ';if(j==V ertices-1)cout<<endl; }}#define noEdge 10000#include<iostream.h>void main(){cout<<"请输入该图的节点数："<<endl;int vertices;cin>>vertices;MGraph<float> b(vertices,noEdge);cout<<"请输入u,v,w:"<<endl;int u,v;float w;cin>>u>>v>>w;while(w!=noEdge){//u=u-1;b.Add(u-1,v-1,w);b.Add(v-1,u-1,w);cout<<"请输入u,v,w:"<<endl;cin>>u>>v>>w;}b.print(vertices);int** Path;int**& path=Path;float** D;float**& d=D;b.Floyd(d,path);for(int i=0;i<vertices;i++){for(int j=0;j<vertices;j++){cout<<Path[i][j]<<' ';if(j==vertices-1)cout<<endl;}}int *V;V=new int[vertices+1];cout<<"请输入任意一个初始H-圈："<<endl; for(int n=0;n<=vertices;n++){cin>>V[n];}for(n=0;n<55;n++){for(i=0;i<n-1;i++){for(int j=0;j<n-1;j++){if(i+1>0&&j>i+1&&j<n-1){if(D[V[i]][V[j]]+D[V[i+1]][V[j+1]]<D[V[i]][V[i+1]]+D[V[j]][V[j+1]]){ int l;l=V[i+1];V[i+1]=V[j];V[j]=l;}}}}}float total=0;cout<<"最小回路："<<endl;for(i=0;i<=vertices;i++){cout<<V[i]+1<<' ';}cout<<endl;for(i=0;i<vertices;i++)total+=D[V[i]][V[i+1]];cout<<"最短路径长度："<<endl;cout<<total;}C语言程序：#include<stdio.h>#include<stdlib.h>#include<math.h>#include<alloc.h>#include<conio.h>#include<float.h>#include<time.h>#include<graphics.h>#include<bios.h>#define maxpop 100#define maxstring 100struct pp{unsigned char chrom[maxstring];float x,fitness;unsigned int parent1,parent2,xsite;};struct pp *oldpop,*newpop,*p1;unsigned int popsize,lchrom,gem,maxgen,co_min,jrand;unsigned int nmutation,ncross,jcross,maxpp,minpp,maxxy;float pcross,pmutation,sumfitness,avg,max,min,seed,maxold,oldrand[maxstring]; unsigned char x[maxstring],y[maxstring][ ];float *dd,ff,maxdd,refpd,fm[201];FILE *fp,*fp1;float objfunc(float);void statistics();int select();int flip(float);int crossover();void generation();void initialize();void report();float decode();void crtinit();void inversion();float random1();void randomize1();main(){unsigned int gen,k,j,tt;char fname[10];float ttt;clrscr();co_min=0;if((oldpop=(struct pp *)farmalloc(maxpop*sizeof(struct pp)))==NULL){printf("memory requst fail!\n");exit(0);}if((dd=(float *)farmalloc(maxstring*maxstring*sizeof(float)))==NULL) {printf("memory requst fail!\n");exit(0);}if((newpop=(struct pp *)farmalloc(maxpop*sizeof(struct pp)))==NULL) {printf("memory requst fail!\n");exit(0);}if((p1=(struct pp *)farmalloc(sizeof(struct pp)))==NULL){printf("memory requst fail!\n");exit(0);}for(k=0;k<maxpop;k++) oldpop[k].chrom[0]='\0';for(k=0;k<maxpop;k++) newpop[k].chrom[0]='\0';printf("Enter Result Data Filename:");gets(fname);if((fp=fopen(fname,"w+"))==NULL){printf("cannot open file\n");exit(0);}gen=0;randomize();initialize();fputs("this is result of the TSP problem:",fp);fprintf(fp,"city: %2d psize: %3d Ref.TSP_path: %f\n",lchrom,popsize,refpd); fprintf(fp,"Pc: %f Pm: %f Seed: %f\n",pcross,pmutation,seed);fprintf(fp,"X site:\n");for(k=0;k<lchrom;k++){if((k%16)==0) fprintf(fp,"\n");fprintf(fp,"%5d",x[k]);}fprintf(fp,"\n Y site:\n");for(k=0;k<lchrom;k++){if((k%16)==0) fprintf(fp,"\n");fprintf(fp,"%5d",y[k]);}fprintf(fp,"\n");crtinit();statistics(oldpop);report(gen,oldpop);getch();maxold=min;fm[0]=100.0*oldpop[maxpp].x/ff;do {gen=gen+1;generation();statistics(oldpop);if(max>maxold){maxold=max;co_min=0;}fm[gen%200]=100.0*oldpop[maxpp].x/ff;report(gen,oldpop);gotoxy(30,25);ttt=clock()/18.2;printf("Run Clock: %2d: %2d: %4.2f",tt/60,tt%60,ttt-tt*60.0); printf("Min=%6.4f Nm:%d\n",min,co_min);}while((gen<100)&&!bioskey(1));printf("\n gen= %d",gen);do{gen=gen+1;generation();statistics(oldpop);if(max>maxold){maxold=max;co_min=0;}fm[gen%200]=100.0*oldpop[maxpp].x/ff;report(gen,oldpop);if((gen%100)==0)report(gen,oldpop);gotoxy(30,25);ttt=clock()/18.2;tt=ttt/60;printf("Run Clock: %2d: %2d: %4.2f",tt/60,tt%60,ttt-tt*60.0); printf("Min=%6.4f Nm:%d\n",min,co_min);}while((gen<maxgen)&&!bioskey(1));getch();for(k=0;k<lchrom;k++){if((k%16)==0)fprintf(fp,"\n");fprintf(fp,"%5d",oldpop[maxpp].chrom[k] ); }fprintf(fp,"\n");fclose(fp);farfree(dd);farfree(p1);farfree(oldpop);farfree(newpop);restorecrtmode();exit(0);}/*%%%%%%%%%%%%%%%%*/float objfunc(float x1){float y;y=100.0*ff/x1;}/*&&&&&&&&&&&&&&&&&&&*/void statistics(pop)struct pp *pop;{int j;sumfitness=pop[0].fitness;min=pop[0].fitness;max=pop[0].fitness;maxpp=0;minpp=0;for(j=1;j<popsize;j++){sumfitness=sumfitness+pop[j].fitness;if(pop[j].fitness>max){max=pop[j].fitness;maxpp=j;}if(pop[j].fitness<min){min=pop[j].fitness;minpp=j;}}avg=sumfitness/(float)popsize;}/*%%%%%%%%%%%%%%%%%%%%*/void generation(){unsigned int k,j,j1,j2,i1,i2,mate1,mate2;float f1,f2;j=0;do{mate1=select();pp:mate2=select();if(mate1==mate2)goto pp;crossover(oldpop[mate1].chrom,oldpop[mate2].chrom,j); newpop[j].x=(float)decode(newpop[j].chrom);newpop[j].fitness=objfunc(newpop[j].x);newpop[j].parent1=mate1;newpop[j].parent2=mate2;newpop[j].xsite=jcross;newpop[j+1].x=(float)decode(newpop[j+1].chrom);newpop[j+1].fitness=objfunc(newpop[j+1].x);newpop[j+1].parent1=mate1;newpop[j+1].parent2=mate2;newpop[j+1].xsite=jcross;if(newpop[j].fitness>min){for(k=0;k<lchrom;k++)oldpop[minpp].chrom[k]=newpop[j].chrom[k];oldpop[minpp].x=newpop[j].x;oldpop[minpp].fitness=newpop[j].fitness;co_min++;return;}if(newpop[j+1].fitness>min){for(k=0;k<lchrom;k++)oldpop[minpp].chrom[k]=newpop[j+1].chrom[k];oldpop[minpp].x=newpop[j+1].x;oldpop[minpp].fitness=newpop[j+1].fitness;co_min++;return;}j=j+2;}while(j<popsize);}/*%%%%%%%%%%%%%%%%%*/void initdata(){unsigned int ch,j;clrscr();printf("-----------------------\n");printf("A SGA\n");printf("------------------------\n");/*pause();*/clrscr();printf("*******SGA DA TA ENTRY AND INITILIZA TION *******\n"); printf("\n");printf("input pop size");scanf("%d",&popsize);printf("input chrom length");scanf("%d",&lchrom);printf("input max generations");scanf("%d",&maxgen);printf("input crossover probability");scanf("%f",&pcross);printf("input mutation prob");scanf("%f",&pmutation);randomize1();clrscr();nmutation=0;ncross=0;}/*%%%%%%%%%%%%%%%%%%%%*/void initreport(){int j,k;printf("pop size=%d\n",popsize);printf("chromosome length=%d\n",lchrom); printf("maxgen=%d\n",maxgen);printf("pmutation=%f\n",pmutation);printf("pcross=%f\n",pcross);printf("initial generation statistics\n");printf("ini pop max fitness=%f\n",max);printf("ini pop avr fitness=%f\n",avg);printf("ini pop min fitness=%f\n",min);printf("ini pop sum fit=%f\n",sumfitness);}void initpop( ){unsigned char j1;unsigned int k5,i1,i2,j,i,k,j2,j3,j4,p5[maxstring]; float f1,f2;j=0;for(k=0;k<lchrom;k++)oldpop[j].chrom[k]=k;for(k=0;k<lchrom;k++)p5[k]=oldpop[j].chrom[k];randomize();for(;j<popsize;j++){j2=random(lchrom);for(k=0;k<j2+20;k++){j3=random(lchrom);j4=random(lchrom);j1=p5[j3];p5[j3]=p5[j4];p5[j4]=j1;}for(k=0;k<lchrom;k++)oldpop[j].chrom[k]=p5[k];}for(k=0;k<lchrom;k++)for(j=0;j<lchrom;j++)dd[k*lchrom+j]=hypot(x[k]-x[j],y[k]-y[j]);for(j=0;j<popsize;j++){oldpop[j].x=(float)decode(oldpop[j].chrom); oldpop[j].fitness=objfunc(oldpop[j].x);oldpop[j].parent1=0;oldpop[j].parent2=0;oldpop[j].xsite=0;}}/*&&&&&&&&&&&&&&&&&*/void initialize(){int k,j,minx,miny,maxx,maxy;initdata();minx=0;miny=0;maxx=0;maxy=0;for(k=0;k<lchrom;k++){x[k]=rand();if(x[k]>maxx)maxx=x[k];if(x[k]<minx)minx=x[k];y[k]=rand();if(y[k]>maxy)maxy=y[k];if(y[k]<miny)miny=y[k];}if((maxx-minx)>(maxy-miny)){maxxy=maxx-minx;}else {maxxy=maxy-miny;}maxdd=0.0;for(k=0;k<lchrom;k++)for(j=0;j<lchrom;j++){dd[k*lchrom+j]=hypot(x[k]-x[j],y[k]-y[j]);if(maxdd<dd[k*lchrom+j])maxdd=dd[k*lchrom+j]; }refpd=dd[lchrom-1];for(k=0;k<lchrom;k++)refpd=refpd+dd[k*lchrom+k+2];for(j=0;j<lchrom;j++)dd[j*lchrom+j]=4.0*maxdd;ff=(0.765*maxxy*pow(lchrom,0.5));minpp=0;min=dd[lchrom-1];for(j=0;j<lchrom-1;j++){if(dd[lchrom*j+lchrom-1]<min){min=dd[lchrom*j+lchrom-1];minpp=j;}}initpop();statistics(oldpop);initreport();}/*&&&&&&&&&&&&&&&&&&*/void report(int l,struct pp *pop){int k,ix,iy,jx,jy;unsigned int tt;float ttt;cleardevice();gotoxy(1,1);printf("city:%4d para_size:%4d maxgen:%4d ref_tour:%f\n",lchrom,popsize,maxgen,refpd);printf("ncross:%4d Nmutation:%4d Rungen:%4d A VG=%8.4f MIN=%8.4f\n\n" ,ncross,nmutation,l,avg,min);printf("inpath:%6.4f Minpath length:%10.4f Ref_co_tour:%f\n",pop[maxpp].x/maxxy,pop[maxpp].x,ff);printf("Co_minpath:%6.4f Maxfit:%10.8f",100.0*pop[maxpp].x/ff,pop[maxpp].fitness);ttt=clock()/18.2;tt=ttt/60;printf("Run clock:%2d:%2d:%4d.2f\n",tt/60,tt%60,ttt-tt*60.0);setcolor(1%15+1);for(k=0;k<lchrom-1;k++){ix=x[pop[maxpp].chrom[k]];iy=y[pop[maxpp].chrom[k]]+110;jx=x[pop[maxpp].chrom[k+1]];jy=y[pop[maxpp].chrom[k+1]]+110;line(ix,iy,jx,jy);putpixel(ix,iy,RED);}ix=x[pop[maxpp].chrom[0]];iy=y[pop[maxpp].chrom[0]]+110;jx=x[pop[maxpp].chrom[lchrom-1]];jy=y[pop[maxpp].chrom[lchrom-1]]+110;line(ix,iy,jx,jy);putpixel(jx,jy,RED);setcolor(11);outtextxy(ix,iy,"*");setcolor(12);for(k=0;k<1%200;k++){ix=k+280;iy=366-fm[k]/3;jx=ix+1;jy=366-fm[k+1]/3;line(ix,iy,jx,jy);putpixel(ix,iy,RED);}printf("GEN:%3d",l);printf("Minpath:%f Maxfit:%f",pop[maxpp].x,pop[maxpp].fitness); printf("Clock:%2d:%2d:%4.2f\n",tt/60,tt%60,ttt-tt*60.0);}/*###############*/float decode(unsigned char *pp){int j,k,l;float tt;tt=dd[pp[0]*lchrom+pp[lchrom-1]];for(j=0;j<lchrom-1;j++){tt=tt+dd[pp[j]*lchrom+pp[j+1]];}l=0;for(k=0;k<lchrom-1;k++)for(j=k+1;j<lchrom;j++){if(pp[j]==pp[k])l++;}return tt+4*l*maxdd;}/*%%%%%%%%%%%%%%%%%%*/void crtinit(){int driver,mode;struct palettetype p;driver=DETECT;mode=0;initgraph(&driver,&mode,"");cleardevice();}/*$$$$$$$$$$$$$$$$$$$$*/int select(){double rand1,partsum;float r1;int j;partsum=0.0;j=0;rand1=random1()*sumfitness;do{partsum=partsum+oldpop[j].fitness;j=j+1;}while((partsum<rand1)&&(j<popsize));return j-1;}/*$$$$$$$$$$$$$$$*/int crossover(unsigned char *parent1,unsigned char *parent2,int k5) {int k,j,mutate,i1,i2,j5;int j1,j2,j3,s0,s1,s2;unsigned char jj,ts1[maxstring],ts2[maxstring];float f1,f2;s0=0;s1=0;s2=0;if(flip(pcross)){jcross=random(lchrom-1);j5=random(lchrom-1);ncross=ncross+1;if(jcross>j5){k=jcross;jcross=j5;j5=k;}}else jcross=lchrom;if(jcross!=lchrom){s0=1;k=0;for(j=jcross;j<j5;j++){ts1[k]=parent1[j];ts2[k]=parent2[j];k++;}j3=k;for(j=0;j<lchrom;j++){j2=0;while((parent2[j]!=ts1[j2])&&(j2<k)){j2++;}if(j2==k){ts1[j3]=parent2[j];j3++;}}j3=k;for(j=0;j<lchrom;j++){j2=0;while((parent1[j]!=ts2[j2])&&(j2<k)){j2++;}if(j2==k){ts2[j3]=parent1[j];j3++;}}for(j=0;j<lchrom;j++){newpop[k5].chrom[j]=ts1[j];newpop[k5+1].chrom[j]=ts2[j];}}else{for(j=0;j<lchrom;j++){newpop[k5].chrom[j]=parent1[j];newpop[k5+1].chrom[j]=parent2[j];}mutate=flip(pmutation);if(mutate){s1=1;nmutation=nmutation+1;for(j3=0;j3<200;j3++){j1=random(lchrom);j=random(lchrom);jj=newpop[k5].chrom[j];newpop[k5].chrom[j]=newpop[k5].chrom[j1]; newpop[k5].chrom[j1]=jj;}}mutate=flip(pmutation);if(mutate){s2=1;nmutation=nmutation+1;for(j3=0;j3<100;j3++){j1=random(lchrom);j=random(lchrom);jj=newpop[k5+1].chrom[j];newpop[k5+1].chrom[j]=newpop[k5+1].chrom[j1]; newpop[k5+1].chrom[j1]=jj;}}}j2=random(2*lchrom/3);for(j=j2;j<j2+lchrom/3-1;j++)for(k=0;k<lchrom;k++){if(k==j)continue;if(k>j){i2=k;i1=j;}else{i1=k;i2=j;}f1=dd[lchrom*newpop[k5].chrom[i1]+newpop[k5].chrom[i2]];f1=f1+dd[lchrom*newpop[k5].chrom[(i1+1)%lchrom]+newpop[k5].chrom[(i2+1)%lchrom]];f2=dd[lchrom*newpop[k5].chrom[i1]+newpop[k5].chrom[(i1+1)%lchrom]];f2=f2+dd[lchrom*newpop[k5].chrom[i2]+newpop[k5].chrom[(i2+1)%lchrom]];if(f1<f2){inversion(i1,i2,newpop[k5].chrom);}}j2=random(2*lchrom/3);for(j=j2;j<j2+lchrom/3-1;j++)for(k=0;k<lchrom;k++){if(k==j)continue;if(k>j){i2=k;i1=j;}else{i1=k;i2=j;}f1=dd[lchrom*newpop[k5+1].chrom[i1]+newpop[k5+1].chrom[i2]]; f1=f1+dd[lchrom*newpop[k5+1].chrom[(i1+1)%lchrom]+ newpop[k5+1].chrom[(i2+1)%lchrom]];f2=dd[lchrom*newpop[k5+1].chrom[i1]+newpop[k5+1].chrom[(i1+1)%lchrom]];f2=f2+dd[lchrom*newpop[k5+1].chrom[i2]+newpop[k5+1].chrom[(i2+1)%lchrom]];if(f1<f2){inversion(i1,i2,newpop[k5+1].chrom);}}return 1;}/*$$$$$$$$$$$$$$$*/void inversion(unsigned int k,unsigned int j,unsigned char *ss) {unsigned int l1,i;unsigned char tt;l1=(j-k)/2;for(i=0;i<l1;i++){tt=ss[k+i+1];ss[k+i+1]=ss[j-i];ss[j-i]=tt;}}/*%%%%%%%%%%%%%%%*/void randomize1(){int i;randomize();for(i=0;i<lchrom;i++)oldrand[i]=random(30001)/30000.0;jrand=0;}/*%%%%%%%%%%%*/float random1(){jrand=jrand+1;if(jrand>=lchrom){jrand=0;randomize1();}return oldrand[jrand];}/*%%%%%%%%%%*/int flip(float probability){float ppp;ppp=random(20001)/20000.0;if(ppp<=probability)return 1;return 0;}改进后用来求解VRP问题的Delphi程序：unit uEA;interfaceusesuUtilsEA, uIEA, uITSP, Classes, GaPara, windows, SysUtils, fEA_TSP;typeTIndividual = class(TInterfacedObject, IIndividual)private// The internally stored fitness valuefFitness: TFloat;fWeConstrain: integer;fBackConstrain: integer;fTimeConstrain: integer;procedure SetFitness(const V alue: TFloat);function GetFitness: TFloat;function GetWeConstrain: integer;procedure SetWeConstrain(const V alue: integer);procedure SetBackConstrain(const V alue: integer);function GetBackConstrain: integer;function GetTimeConstrain: integer;procedure SetTimeConstrain(const V alue: integer);publicproperty Fitness : TFloat read GetFitness write SetFitness;property WeConstrain :integer read GetWeConstrain write SetWeConstrain; property BackConstrain :integer read GetBackConstrain write SetBackConstrain; property TimeConstrain :integer read GetTimeConstrain write SetTimeConstrain; end;TTSPIndividual = class(TIndividual, ITSPIndividual)private// The route we travelfRouteArray : ArrayInt;fWeConstrain: integer;fBackConstrain: integer;fTimeConstrain: integer;function GetRouteArray(I: Integer): Integer;procedure SetRouteArray(I: Integer; const V alue: Integer);procedure SetSteps(const V alue: Integer);function GetSteps: Integer;function GetWeConstrain: integer;procedure SetWeConstrain(const V alue: integer);procedure SetBackConstrain(const V alue: integer);procedure SetTimeConstrain(const V alue: integer);function GetBackConstrain: integer;function GetTimeConstrain: integer;public// Constructor, called with initial route sizeconstructor Create(Size : TInt); reintroduce;destructor Destroy; override;property RouteArray[I : Integer] : Integer read GetRouteArray write SetRouteArray; // The number of steps on the routeproperty Steps : Integer read GetSteps write SetSteps;property Fitness : TFloat read GetFitness write SetFitness;property WeConstrain :integer read GetWeConstrain write SetWeConstrain; property BackConstrain :integer read GetWeConstrain write SetBackConstrain; property TimeConstrain :integer read GetTimeConstrain write SetTimeConstrain; end;TTSPCreator = class(TInterfacedObject, ITSPCreator)private// The Control component we are associated withfController: ITSPController;function GetController: ITSPController;procedure SetController(const V alue: ITSPController);public// Function to create a random individualfunction CreateIndividual : IIndividual;function CreateFeasibleIndividual: IIndividual;property Controller : ITSPController read GetController write SetController;end;TKillerPercentage = class(TInterfacedObject, IkillerPercentage)privatefPer: TFloat;procedure SetPercentage(const V alue: TFloat);function GetPercentage: TFloat;publicfunction Kill(Pop : Ipopulation ): Integer;// Percentage of population to be killedproperty Percentage: TFloat read GetPercentage write SetPercentage;end;TParentSelectorTournament = class(TInterfacedObject, IParentSelector)publicfunction SelectParent(Population: IPopulation): IIndividual;end;TTSPBreederCrossover = class(TInterfacedObject, IBreeder)publicfunction BreedOffspring(PSelector: IParentSelector; Pop: IPopulation): IIndividual; end;TTSPMutator = class(TInterfacedObject, ITSPMutator)privatefTrans: TFloat;fInv: TFloat;procedure SetInv(const V alue: TFloat);procedure SetTrans(const V alue: TFloat);function GetInv: TFloat;function GetTrans: TFloat;publicprocedure Mutate(Individual: IIndividual);published// Probability of doing a transpositionproperty Transposition: TFloat read GetTrans write SetTrans;// Probability of doing an inversionproperty Inversion: TFloat read GetInv write SetInv;end;TTSPExaminer = class(TInterfacedObject, ITSPExaminer)private// The Control component we are associated withfController: ITSPController;function GetController: ITSPController;procedure SetController(const V alue: ITSPController);public// Returns the fitness of an individual as a real number where 0 => best function GetFitness(Individual : IIndividual) : TFloat;property Controller : ITSPController read GetController write SetController; end;TPopulation = class(TInterfacedObject, IPopulation)private// The populationfPop : TInterfaceList;// Worker for breedingfBreeder: IBreeder;// Worker for killingfKiller: IKiller;// Worker for parent selectionfParentSelector: IParentSelector;// Worker for mutationfMutator: IMutator;// Worker for initial creationfCreator: ICreator;// Worker for fitness calculationfExaminer: IExaminer;// On Change eventFOnChange: TNotifyEvent;procedure Change;// Getters and Settersfunction GetIndividual(I: Integer): IIndividual;function GetCount: Integer;function GetBreeder: IBreeder;function GetCreator: ICreator;function GetExaminer: IExaminer;function GetKiller: IKiller;function GetMutator: IMutator;function GetOnChange: TNotifyEvent;function GetParentSelector: IParentSelector;procedure SetBreeder(const V alue: IBreeder);procedure SetCreator(const V alue: ICreator);procedure SetExaminer(const V alue: IExaminer);procedure SetKiller(const V alue: IKiller);procedure SetMutator(const V alue: IMutator);procedure SetOnChange(const V alue: TNotifyEvent);procedure SetParentSelector(const V alue: IParentSelector);// not interfacedprocedure DanQuickSort(SortList: TInterfaceList; L, R: Integer; SCompare: TInterfaceCompare); procedure Sort(Compare: TInterfaceCompare);protected// Comparison function for Sort()function CompareIndividuals(I1, I2: IIndividual): Integer;// Sort the populationprocedure SortPopulation;public// The constructorconstructor Create;// The destructordestructor Destroy; override;// Adds an individual to the populationprocedure Add(New : IIndividual);// Deletes an individual from the populationprocedure Delete(I : Integer);// Runs a single generationprocedure Generation;// Initialise the populationprocedure Initialise(Size : Integer);// Clear ourselves outprocedure Clear;// Get the fitness of an individualfunction FitnessOf(I : Integer) : TFloat;// Access to the population membersproperty Pop[I : Integer] : IIndividual read GetIndividual; default;// The size of the populationproperty Count : Integer read GetCount;property ParentSelector : IParentSelector read GetParentSelector write SetParentSelector; property Breeder : IBreeder read GetBreeder write SetBreeder;property Killer : IKiller read GetKiller write SetKiller;property Mutator : IMutator read GetMutator write SetMutator;property Creator : ICreator read GetCreator write SetCreator;property Examiner : IExaminer read GetExaminer write SetExaminer;// An eventproperty OnChange : TNotifyEvent read GetOnChange write SetOnChange;end;TTSPController = class(TInterfacedObject, ITSPController)privatefXmin, fXmax, fYmin, fYmax: TFloat;{ The array of 'cities' }fCities : array of TPoint2D;{ The array of 'vehicles' }fV ehicles : array of TV ehic le;{ The array of 'vehicle number' }fNoV ehic les : ArrayInt;/////////////////////{ The number of 'new cities' }fCityCount: Integer;{ The number of 'old cities' }foldCityCount: Integer;{ The number of 'travelers' }fTravelCount:Integer; ///////////////////////{ The number of 'depots' }fDepotCount:Integer; ///////////////////////{ Getters... }function GetCity(I: Integer): TPoint2D;function GetNoV ehicle(I: Integer): TInt;function GetCityCount: Integer;function GetOldCityCount: Integer;function GetTravelCount:Integer;function GetDepotCount:Integer;function GetXmax: TFloat;function GetXmin: TFloat;function GetYmax: TFloat;function GetYmin: TFloat;。