文件名称:Traveling-salesman
介绍说明--下载内容均来自于网络,请自行研究使用
旅行商问题:全国省会二维坐标如图30所示,基于遗传算法设计从黑龙江到西藏,并遍历全国各省会(每个省会只经过一次)的最短路径-Traveling salesman problem: two-dimensional coordinates of the national capital as shown in Figure 30, based on genetic algorithm design from Heilongjiang to Tibet and traverse the provinces (each provincial capital only after a) the shortest path
(系统自动生成,下载前可以参看下载内容)
下载文件列表
旅行商源程序\cross.m
............\distance.m
............\exchange.m
............\fit.m
............\Mutation.m
............\mylength.m
............\plot_route.m
............\tsp.m
旅行商源程序