搜索资源列表
TSP
- 人工智能中的经典算法，TSP模拟退火算法。本程序简单实现了的用模拟退火算法实现了旅行商问题。只需在文本cities中输入各个城市之间的距离，运行程序后就可以求出旅行各个城市的最短距离。适合学习人工智能和对该算法有兴趣的同学使用。-Classic artificial intelligence algorithm, TSP simulated annealing algorithm. The program is simple to achieve with simulated annealing
TSP
- TSP问题是一个典型的、容易描述但是难以处理的NP完全问题，同时TSP问题也是诸多领域内出现的多种复杂问题的集中概括和简化形式。目前求解TSP问题的主要方法有启发式搜索法、模拟退火算法、遗传算法、Hopfield神经网络算法、二叉树描述算法。所以，有效解决TSP问题在计算理论上和实际应用上都有很高的价值，而且TSP问题由于其典型性已经成为各种启发式的搜索、优化算法的间接比较标准(如遗传算法、神经网络优化、列表寻优(TABU)法、模拟退火法等)。遗传算法就其本质来说，主要是解决复杂问题的一种鲁棒性
TSP-SA-CHANGXIN
- 解决了应用模拟退火算法的旅行商问题研究 应用平台MATLAB-To solve application of simulated annealing algorithm traveling salesman problem application platform MATLAB
TSP
- 用模拟退火算法解决旅行商问题，城市坐标是数据集直接调用。-Simulated annealing algorithm to solve the traveling salesman problem, the city coordinates data sets directly call.
TSP(SA)
- 旅行商问题 用模拟退火算法求解游历中国各省会最短路-tsp china province sa
TSP-Simulated-Annealing
- 本程序提供了多种TSP模拟退火算法解决图论问题的代码。-This program offers a variety of simulated annealing algorithm to solve TSP graph theory problem code.
SA-TSP
- 基于经典的优化算法--模拟退火算法的旅行商问题寻优实现，该算法比较经典，可用于后续一些性能对比分析-The traveling salesman problem-- the classical optimization algorithms and simulated annealing algorithm is implemented based on the algorithm, compare the classic, can be used for the analysis of sub
TSP
- 一个运用模拟退火算法求解TSP问题的小例子程序-A simulated annealing algorithm for TSP small example program
SA-TSP
- 使用模拟退火算法来解决TSP旅行商优化问题-Using simulated annealing algorithm to solve TSP traveling salesman optimization problem
GA-and-SA-TO-SOLVE-TSP
- 用遗传算法和模拟退火算法解决TSP问题，希望能够帮到你-Solve TSP using genetic algorithms and simulated annealing algorithm
TSP-SA
- 模拟退火算法解决经典的TSP问题，自己做的，测试不错，可以用-Simulated annealing algorithm to solve TSP classic problem, do it yourself, test good, you can use
SA-for-TSP
- 改进的模拟退火算法，求解TSP问题，增加了升温过程，算法效果好。-Improved simulated annealing algorithm for TSP, increasing the heating process, a good algorithm results.
Tsp
- 模拟退火算法求解TSP问题,这个算法比其他的算法找到的最优解相对最优-Simulated annealing algorithm for TSP, the optimal solution of this algorithm is better than other algorithms to find the optimal relative
SAA-TSP
- 模拟退火算法解决旅行商问题，城市数量27，初始温度3000，温度衰减率0.95。 -Simulated annealing algorithm to solve the traveling salesman problem, 27 the number of cities, the initial temperature of 3000, the rate of temperature decay 0.95.
tsp
- 使用模拟退火算法实现著名的旅行商问题，该压缩包中有完整的matlab源码和实验的截图。-Simulated annealing algorithm famous traveling salesman problem, the complete package includes shots of matlab source and the compression experiments.
simulated-annealing-algorithm-TSP
- 用模拟退火算法求解TSP问题，matlab程序，包含了程序所实现的论文 - TSP is studied by simulated annealing algorithm and an approximate algorithm which method for solving TSP is better than others ,and using Matlab,we complete the program for solving TSP. The simulation of alg
TSP
- 利用模拟退火算法求解旅行商问题，从文件读入城市信息，输出结果到文件-TSP problem
TSP
- 用MATLAB实现的模拟退火算法，去有效的解决旅行商问题（TSP问题）。-MATLAB simulation annealing algorithm, to effectively solve the traveling salesman problem (TSP).
TSP
- 通过MATLAB编程，实现模拟退火算法的功能，一次实现TSP问题。-Through MATLAB programming, to achieve the function of simulated annealing algorithm, a TSP problem.
TSP
- 使用模拟退火算法解决TSP问题，TSP问题机旅行商问题-Using simulated annealing algorithm to solve the TSP problem, TSP problem machine traveling salesman problem