搜索资源列表
sa_tsp
- 旅行商（TSP）问题一直以来都是一个NP难问题，旅行商问题（TSP问题）就是一销售商从n个城市中的某一城市出发，不重复地走完其余n-1个城市并回到原出发点，在所有可能的路径中求出路径长度最短的一条。本次软件设计是利用模拟退火算法解决TSP问题，通过该软件设计，对模拟退火算法和旅行商问题有个初步的认识。-Traveling Salesman (TSP) problem has always been a NP hard problem, traveling salesman problem (TS
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
monituihuo
- 用模拟退火的算法解决中国旅行商的问题，结果画出图形直观明了！-Using simulated annealing algorithm to solve traveling salesman problem of China, resulting in intuitive and clear graphics to draw!
tabu_matlab
- 采用禁忌搜索算法和模拟退火法来求解旅行商问题，PDF文件，说明很详细-Using tabu search algorithm and simulated annealing method to solve the traveling salesman problem, PDF document describing in great detail
tspDEMO
- tsp问题求解，旅行商问题求解使用模拟退火算法-TSP SOLVED IN VC++
Simulated
- 用模拟退火算法求30个城市的旅行商问题的C程序-Simulated Annealing Algorithm with 30 cities of the TSP C program
TSP
- 模拟退火算法解决旅行商问题的的C++代码-Simulated annealing algorithm to solve the traveling salesman problem C++ code
SA-TSP
- 一个模拟退火算法，计算旅行商问题：注意：一共三个文件，第一个是主程序，下面两个是子函数-A simulated annealing algorithm to calculate the traveling salesman problem: Note: A total of three files, the first one is the main program, the following two sub-functions
fireTSP
- 模拟退火解决旅行商（TSP问题）采用康立山等人的算法 能得到最优解，速度可以-Kang Tateyama simulated annealing to solve the traveling salesman (TSP problems) algorithm can get the optimal solution can speed
matlab_simulated-annealing-algorithm
- 模拟退火算法 简单清晰 他是一种求解旅行商问题的高效算法，适合大家研究，欢迎改进，指正。-It is a simulated annealing algorithm.He is an efficient algorithm is used for solving the traveling salesman problem
2009011308_homework3
- 清华大学人工智能小作业，旅行商问题，模拟退火/遗传算法-Tsinghua University artificial intelligence job, traveling salesman problem
TSPS
- TSP问题（货郎担问题，旅行商问题）的模拟退火算法通用malab源程序-TSP (traveling salesman problem, traveling salesman problems) general malab source program of simulated annealing algorithm
SA-TSP
- 使用模拟退火算法来解决TSP旅行商优化问题-Using simulated annealing algorithm to solve TSP traveling salesman optimization problem
SA_TSP
- 模拟退火算法做的来处理的旅行商问题，可以参考下，但希望不要直接用。-Simulated annealing algorithm to deal with the traveling salesman problem, you can refer to, but I hope not to use directly.
TSP_main_Program
- 此算法为模拟退火算法，典型例题为旅行商选路问题，也可用于计算机网络中的路由选择问题-Simulated annealing algorithm
SA
- 针对于多个城市的最短距离问题或旅行商问题，模拟退火算法，C#程序-For the shortest distance problem or traveling salesman problem in many cities, simulated annealing algorithm, C# program
monituihuo
- 利用模拟退火算法解决旅行商问题，显著提高算法的运算效率。-Using simulated annealing algorithm to solve the traveling salesman problem, significantly improving operational efficiency of the algorithm.
tsp
- 使用模拟退火算法实现著名的旅行商问题，该压缩包中有完整的matlab源码和实验的截图。-Simulated annealing algorithm famous traveling salesman problem, the complete package includes shots of matlab source and the compression experiments.
City
- 使用著名的模拟退火算法来求解城市旅行商问题-Use well-known ant colony algorithm to solve the traveling salesman problem
TSP
- 使用模拟退火算法解决TSP问题，TSP问题机旅行商问题-Using simulated annealing algorithm to solve the TSP problem, TSP problem machine traveling salesman problem