解TSP问题的遗传算法C语言程序.docVIP

解TSP问题的遗传算法C语言程序 #includestdio.h#includestdlib.h#includemath.h#includealloc.h#includeconio.h#includefloat.h#includetime.h#includegraphics.h#includebios.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;kmaxpop;k++) oldpop[k].chrom[0]=\0;for(k=0;kmaxpop;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;klchrom;k++){if((k%16)==0) fprintf(fp,\n);fprintf(fp,%5d,x[k]);}fprintf(fp,\n Y site:\n);for(k=0;klchrom;k++){if((k%16)==0) fprintf(fp,\n);fprintf(fp,%5d,y[k]);}fprintf(fp,\n);crti