旅行商问题，即TSP问题（Travelling Salesman Problem）是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的...

旅行商问题，即TSP问题（Travelling Salesman Problem）是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路经的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。 -Traveling Salesman Problem, or TSP problem (Travelling Salesman Problem) is a well-known field of mathematics problems. Assuming there is a travel business to visit n cities, he must choose which path to go, via the restriction is to visit each city only once and the last to go back to the original departure city. Path selection objective is to get the path distance for all paths are the minimum.

tspsa
TspSA
城市坐标文件
TspSA
城市坐标文件
res
bin
MainFrm.cpp
MainFrm.h
ReadMe.txt
Resource.h
sacode.cpp
sacode.h
StdAfx.cpp
StdAfx.h
TspSA.cpp
TspSA.dsp
TspSA.dsw
TspSA.h
TspSA.rc
TspSADoc.cpp
TspSADoc.h
TspSAView.cpp
TspSAView.h