蚁群算法 C语言程序(已运行).doc

/basic ant colony algorithm for tsp #include #include #include #include #include #include #include #define n 31 /city size #define m 31 /ant number double inittao=1; double taonn; double detataonn; double distancenn; double yitann; int tabumn; int routemn; double solutionm; int bestrouten; double bestsolution=10000000000; double alfa,beta,rou,q; int ncmax; void initparameter(void); / initialize the parameters of basic aca double evaluesolution(int *a); / evaluate the solution of tsp, and calculate the length of path void incityxy( double x, double y, char *infile ); / input the nodes coordinates of tsp void initparameter(void) alfa=1; beta=5; rou=0.9; q=100; ncmax=200; void main(void) int nc=0; initparameter(); double xn; double yn; incityxy( x, y, city31.tsp ); for(int i=0;in;i+) for(int j=i+1;jn;j+) distanceji=sqrt(xi-xj)*(xi-xj)+(yi-yj)*(yi-yj); distanceij=distanceji; / calculate the heuristic parameters for(i=0;in;i+) for(int j=0;jn;j+) taoij=inittao; if(j!=i) yitaij=100/distanceij; for(int k=0;km;k+) for(i=0;in;i+) routeki=-1; srand(time(null); for(k=0;km;k+) routek0=k%n; tabukroutek0=1; /each ant try to find the optiamal path do int s=1; double partsum; double pper; double drand; /ant choose one whole path while(sn) for(k=0;km;k+) int jrand=rand()%3000; drand=jrand/3001.; partsum=0; pper=0; for(int j=0;jn;j+) if(tabukj=0) partsum+=pow(taorouteks-1j,alfa)*pow(yitarouteks-1j,beta); for(j=0;jdrand) break; tabukj=1; routeks=j; s+; / the pheromone is updated for(i=0;in;i+) for(int j=0;jn;j+) detataoij=0; for(k=0;km;k+) solutionk=evaluesolution(routek); if(solutionkbestsolution) bestsolution=solutionk; for(s=0;sn;s+) bestroutes=routeks; for(k=0;km;k+) for(s=0;sn-1;s+) detataorouteksrouteks+1+=q/solutionk; detataoroutekn-1routek0+=q/solutionk; for(i=0;in;i+) for(int j=0;jn;j+) taoij=rou*taoij+detataoij; if(taoij20) taoij=20; for(k=0;km;k+) for(int j=1;jn;j+) tabukroutekj=0; routekj=-1; nc+; while(ncncmax); /output the calculating results fstream result; result.open(optimal_results.log, ios:app); if(!result) coutcant open the file!n; exit(0); result*-*endl; resultthe initialized parameters of aca are as follows:endl; resultalfa=alfa, beta=beta, rou=rou, q=qendl; resultthe maximum iteration number of aca is:ncmaxendl; resultthe shortest length of the path is:bestsolutionendl; resultthe best route is:endl; for(i=0;in;i+) resultbestroutei ; resultendl; result*-*endlendl; result.close(); coutthe shortest length of the path is:bestsolutionendl; double evaluesolution(int *a) double dist=0; for(int i=0;in-1;i+) dist+=distanceaiai+1; dist+=distanceaia0; return dist; void incityxy( double x, double y, char *infile ) fstream inxyfile( infile, ios:in | ios:nocreate ); if( !inxyfile ) coutcant open the infile file!n; exit(0); int