result.rtf

用C语言实现旅行商问题。该算法简单精悍

有赋初值情况：
 20 的时间比较多。


Microsoft Windows XP [版本 5.1.2600]
(C) 版权所有 1985-2001 Microsoft Corp.

C:\Documents and Settings\王金锭>d:

D:\>cd tsp

D:\TSP>cd tsp

D:\TSP\TSP>tsp
******************* Copyright ************************
Author:wangjd     04120087    finished time:07.07.01

File Function:
Give several cities signed 1,2....n  and the distances of every two cities
You must pass every city one time and only one time,At last back to 1
The routine you searched must be shortest of all

Usage:
        TSP
        TSP TSPxx.txt

D:\TSP\TSP>tsp tsp.txt
Can't open the inputfile : tsp.txt

D:\TSP\TSP>tsp tsp4.txt
The lowest cost of searched rout is 25
The searched Path is :
  1->3->2->4->1
The program take time:0.000000 seconds

D:\TSP\TSP>tsp tsp6.txt
The lowest cost of searched rout is 175
The searched Path is :
  1->2->4->5->6->3->1
The program take time:0.000000 seconds

D:\TSP\TSP>tsp tsp8.txt
The lowest cost of searched rout is 242
The searched Path is :
  1->3->2->8->7->5->4->6->1
The program take time:0.000000 seconds

D:\TSP\TSP>tsp tsp10.txt
The lowest cost of searched rout is 279
The searched Path is :
  1->7->9->4->10->6->5->3->2->8->1
The program take time:0.000000 seconds

D:\TSP\TSP>tsp tsp15.txt
The lowest cost of searched rout is 371
The searched Path is :
  1->9->14->8->6->13->5->15->3->4->7->12->2->10->11->1
The program take time:0.062000 seconds

D:\TSP\TSP>tsp tsp20.txt
The lowest cost of searched rout is 349
The searched Path is :
  1->14->6->18->9->7->13->15->11->17->3->5->12->4->2->8->19->16->10->20->1
The program take time:1.968000 seconds

D:\TSP\TSP>