遗传算法解决tsp问题.doc

《遗传算法解决tsp问题.doc》由会员上传分享，免费在线阅读，更多相关内容在教育资源-天天文库。

1、//以下是cpp文件完整代码：#include#include#include#include#include#includeusingnamespacestd;constintN=30;//城市个数constintMAXN=50;//最大城市个数constintpopulation=100;//种群个体数constintMAXpopulation=100;//最大种群个数constdoublemutation_rate=0.4;//变异率constdoublec

2、rossover_rate=0.65;//交配率constintiter=200;//迭代次数//城市结构体structcity{//charid;intx,y;};//路径结构体structpath{citycities[MAXN];doublelength;};doubleD[MAXN][MAXN];//存储城市之间的长度citybcity[MAXN];//存储最优路径的各个城市pathbpath[MAXpopulation];//存储种群所有个体doublefitness[MAXpopulation];//存储种群个体的适应度//产生x-y的随机整数intrand

3、Int(intx,inty){returnrand()%(y-x+1)+x;}doublerandDouble(){returnrand()/(RAND_MAX+1.0);}//两城市之间距离函数doubledistance(citycity1,citycity2){returnsqrt(double((city1.x-city2.x)*(city1.x-city2.x)+(city1.y-city2.y)*(city1.y-city2.y)));}//路径总长度函数doubletotaldistance(pathp){inti;doubletotal=0;for(i=

4、0;i

5、r,"%d%d",&a,&b);bcity[ss].x=a;bcity[ss].y=b;ss++;}myfile.close();//输出城市坐标cout<<"cityorders:"<

6、]);}}for(j=0;j

7、ties[0]=randcity();for(i=1;i