搜索资源列表
tsp
- 用模拟退火算法解决旅行商问题，算法较简单
tsp
- 用经典算法--模拟退火算法求解经典问题旅行商（Travel Sales Problem）问题。
five_file
- hws01:野人和传教士问题 hws02:用Romberg外推法求积分近似值 hws03:八数码问题 hws04:模拟退火算法 hws05:遗传算法解决旅行商问题
TSP-SA
- 用模拟退火算法解决旅行商问题，工具为：vs2005
SATSP
- 用模拟退火算法求解旅行商问题 T(t+1)＝k×T(t) 式中k为正的略小于1.00的常数，t为降温的次数
TSP
- tsp（旅行商问题） 利用matlab遗传算法、模拟退火算法以及lingo动态规划求解
theuseageofSA
- 模拟退火算法应用，有图像着色问题，独立集，最大截，旅行商等问题。
TSPannealarithmetic
- 本文以著名的旅行商问题(TSP)为例说明如何利用MATLAB语言实现模拟退火算法。
for TSP(Matlab)
- 模拟退火算法用于求解旅行商问题的matlab源程序-simulated annealing algorithm for solving the traveling salesman problem Matlab source
SA_TSP.rar
- 使用模拟退火算法求解TSP（旅行商）问题的JAVA源程序,The use of simulated annealing algorithm for solving TSP (traveling salesman) problem with JAVA source
SimulatedAnnealing
- 模拟退火算法解旅行商问题，读入的文件描述城市的位置，采用康立山等人的方法，能以较大的概率接触最优解-Simulated annealing algorithm traveling salesman problem, read the document describes the city s location, KANG Li-shan, who adopted the method, to a greater probability of exposure to the optimal sol
sa
- 运用模拟退火算法解决旅行商问题，简单易懂，代码清晰，行数比较少-Simulated Annealing to solve TSP
tuihuo
- 用模拟退火算法来解旅行商问题，c++源码及算法-Using simulated annealing algorithm to solve traveling salesman problem, c++ source code
fire
- 使用模拟退火算法求解10城市和20城市的旅行商问题，城市数目和城市之间的距离保存在txt文件中，程序读入数据后求解最优路径-The use of simulated annealing algorithm 10 cities and 20 cities in the traveling salesman problem, the number of cities and the distance between the cities stored in the txt file, the pro
TspSA
- 首先介绍模拟退火算法，然后编写伪程序，结合Visual C++开发工具求解著名的旅行商问题TSP-Simulated annealing algorithm first introduced, and then the preparation of pseudo-process, combined with Visual C++ development tools for solving the famous Traveling Salesman Problem TSP
SAA-MATLAB
- 模拟退火算法的MATLAB实例，包含图作色，旅行商等多个问题的例子。-Simulated annealing algorithm of MATLAB examples, including Fig作色, traveling salesman problem, and many other examples.
simulated_annealing
- 模拟退火算法解决旅行商问题-希望对大家有用-Simulated annealing algorithm to solve traveling salesman problem- I hope useful for all of us
SimulatedAnnealing
- 旅行商问题的模拟退火算法实现 采用VHDL仿真，软件java来varificatio。本例中采用16个城市-Traveling Salesman Problem Algorithm of Simulated Annealing using VHDL simulation, software, java to varificatio. In this case the use of 16 cities
TSP
- 利用模拟退火算法解决旅行商问题,算法较高效.-The use of simulated annealing algorithm to solve the traveling salesman problem, the algorithm more efficient.
fire
- 采用模拟退火算法解决旅行商问题，对于20城市以下的数据规模较好-Simulated annealing algorithm to solve the traveling salesman problem, the following data for 20 cities the size of a good