(1).问题描述：旅行商问题

某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要



选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（



或旅费）最小。

(2).程序设计要求：

　　a. 设计一个动态规划算法

　　b. 任给一个输入实例，能输出最短路程及其路线

　　c. 能用图形演示旅行商的推销路线





输入要测试的文件名，如TSP6.txt,程序将利用动态规划求解该问题，给出最佳线



路，并用图形演示。-(1). Problem Descr iption: A salesman traveling salesman problem to a number of cities to sell commodities, known distance between cities (or travel). He has to select a departure from the resident, through every city once again, and finally returned to the resident s line, bringing the total distance (or travel) the smallest. (2). Program design requirements: a. the design of a dynamic programming algorithm to an input b. any examples, can output the shortest distance and the line c. use graphical presentation of the traveling salesman selling line of input to test the file name, such as TSP6 . txt, the procedure will use dynamic programming to solve the problem, given the best lines, and graphics presentation.