搜索资源列表
sa_tsp
- 旅行商（TSP）问题一直以来都是一个NP难问题，旅行商问题（TSP问题）就是一销售商从n个城市中的某一城市出发，不重复地走完其余n-1个城市并回到原出发点，在所有可能的路径中求出路径长度最短的一条。本次软件设计是利用模拟退火算法解决TSP问题，通过该软件设计，对模拟退火算法和旅行商问题有个初步的认识。-Traveling Salesman (TSP) problem has always been a NP hard problem, traveling salesman problem (TS
SA_TSP
- 用模拟退货算法解决商旅问题，模拟退火算法是三大非经典算法之一，与优化问题相结合。-Using simulated returns algorithm to solve the traffic problem, simulated annealing algorithm is one of the three non-classical algorithm, combined with the optimization problem.
SA_Tsp
- 模拟退火旅行商问题用C#语言编写的，有界面计算城市之间旅行最短行程问题-Simulated annealing traveling salesman problem written in C# language, the interface to calculate the shortest path problem traveling between cities
SA_TSP
- 模拟退火算法做的来处理的旅行商问题，可以参考下，但希望不要直接用。-Simulated annealing algorithm to deal with the traveling salesman problem, you can refer to, but I hope not to use directly.
SA_tsp
- 使用模拟退火算法解决tsp问题，运行得到最优解的概率在80 以上-solve tsp problem with Simulated Annealing algorithm
SA_TSP
- 用模拟退火算法求解TSP问题，matlab源码，绝对可运行。-Solving traveling salesman problem with simulated annealing algorithm，matlab code.
SA_TSP
- 介绍模拟退火算法，并应用到TSP问题上。并附有小程序(Introduce simulated annealing algorithm and apply it to TSP problem. With a small program)