Description: TSP (Travelling Salesman Problem, Jane Hutchison TSP, also known as the traveling salesman problem): with n cities and the distance matrix D = [dij], which said dij city i to city j the distance, i, j = 1, 2 ... n, the problem is to identify each city exactly once visited a loop and make it to the shortest path length.
File list (Check if you may need any files):
SA
..\Debug
..\.....\SA.exe
..\.....\SA.ilk
..\.....\SA.pdb
..\SA
..\..\10.TXT
..\..\20.TXT
..\..\Debug
..\..\.....\BuildLog.htm
..\..\.....\mt.dep
..\..\.....\SA.exe.intermediate.manifest
..\..\.....\SA.obj
..\..\.....\vc90.idb
..\..\.....\vc90.pdb
..\..\SA.cpp
..\..\SA.exe
..\..\SA.vcproj
..\..\SA.vcproj.PC-200904161021.!@#$dao0oad$#@!.user
..\SA.ncb
..\SA.sln
模拟退火求解TSP问题实验报告.doc
Download