文件名称:TSP
介绍说明－－下载内容均来自于网络，请自行研究使用
求解旅行商问题
已知n个城市之间的相互距离，现有一个推销员必须遍访这n个城市，并且每个城市只能访问一次，最后又必须返回出发城市。如何安排他对这些城市的访问次序，可使其旅行路线的总长度最短？-Solving Traveling Salesman Problem is known cities n the distance between the existing of a salesman to be visited this n cities, and visit each city only once, finally to return to the starting city. How to arrange his visit to the order of these cities can make it travel the total length of the shortest route?
已知n个城市之间的相互距离，现有一个推销员必须遍访这n个城市，并且每个城市只能访问一次，最后又必须返回出发城市。如何安排他对这些城市的访问次序，可使其旅行路线的总长度最短？-Solving Traveling Salesman Problem is known cities n the distance between the existing of a salesman to be visited this n cities, and visit each city only once, finally to return to the starting city. How to arrange his visit to the order of these cities can make it travel the total length of the shortest route?
(系统自动生成,下载前可以参看下载内容)
下载文件列表
TSP.txt