搜索资源列表
模拟退火法解决TSP问题
- 使用模拟退火算法计算旅行商问题，内含10城市和20城市的样例代码。
TSPSA.模拟退火算法SA求解TSP旅行商问题
- 模拟退火算法SA求解TSP旅行商问题。可以自己设定初始温度和冷却温度,SA simulated annealing algorithm for solving traveling salesman problem TSP. Can be set for the initial temperature and cooling temperature
TSP.rar
- 模拟退火算法解决旅行商问题，从文件读入城市信息,Simulated annealing algorithm to solve traveling salesman problem, reading from the file information into the city
SA-TSP-Matlab
- 一篇关于模拟退火算法解决TSP问题的MATLAB代码，拿来分享，欢迎讨论-On a simulated annealing algorithm to solve TSP problem of MATLAB code, used to share, please discuss
tsp
- 模拟退火算法通用类,改编自TSP问题求解，采用Java5范式来表示解，需要实现：评估算法，获取当前解的领域，detalT【温度变化值】，loopCount【循环次数】可调，更原始类型参看SACompute-Simulated annealing algorithm generic categories, adapted from the TSP problem solving, using Java5 solution paradigm to express the need to realiz
SA_TSP_Rev1
- 用matlab实现的利用模拟退火算法(SA)解决旅行商问题(TSP).-Matlab achieved with the use of simulated annealing algorithm (SA) to solve traveling salesman problem (TSP).
sa-for-tsp
- 利用模拟退火算法解决50个城市的tsp问题，简单易懂，适合初学者-The use of simulated annealing algorithm to solve 50 problems tsp city, easy-to-read, suitable for beginners
TSP
- 这是一个人工智能方面的算法程序，里面包含模拟退火算法、神经网络算法以及遗传算法三个。-This is an area of artificial intelligence algorithm procedure, which includes simulated annealing algorithm, neural network algorithms and genetic algorithms in three.
TSP
- 人工智能中，用模拟退火方法解决旅行商问题,采用C++实现-Artificial intelligence, the use of simulated annealing to solve traveling salesman problem, using C++ implementation
TSPSAwithmatlab
- TSP 问题模拟退火算法的matlab示例-TSP simulated annealing algorithm matlab example
tsp
- 利用模拟退火算法解决旅行商问题，共二十个城市，选择最优路径-The use of simulated annealing algorithm to solve traveling salesman problem
TSP
- 免疫算法和模拟退火算法求解TSP问题的研究。本文提出了一种新的免疫模拟退火法，并将其应用于求解典型的NP问题—TSP问题-Immune algorithm and simulated annealing algorithm for solving TSP problems. In this paper, a new immune simulated annealing algorithm, and applies it to solve the issue of a typical NP pro
tsp
- 模拟退火算法的解决 具体在mATlab实现算法 -matlab
TSP
- 模拟退火算法来源于固体退火原理，将固体加温至充分高，再让其徐徐冷却，加温时，固体内部粒子随温升变为无序状，内能增大，而徐徐冷却时粒子渐趋有序，在每个温度都达到平衡态，最后在常温时达到基态，内能减为最小。根据Metropolis准则，粒子在温度T时趋于平衡的概率为e-ΔE/(kT)，其中E为温度T时的内能，ΔE为其改变量，k为Boltzmann常数。用固体退火模拟组合优化问题，将内能E模拟为目标函数值f，温度T演化成控制参数t，即得到解组合优化问题的模拟退火算法：由初始解i和控制参数初值t开始，
TSP_GSA
- tsp问题，是一个很典型的NP完全问题，该程序用了遗传—退火结合算法，能优化计算-tsp problem is a typical NP-complete problem, the program is to use genetic- combined annealing algorithms that optimize computing
sA-TS-for-TSP
- 模拟退火算法及禁忌搜索算法解tsp的比较，文章及matalb源码-Simulated annealing algorithm and tabu search algorithm for solving tsp comparison, articles and matalb source
tsp
- 利用模拟退火算法解决TSP问题（C++实现）-TSP PROBLEM
TSP
- 用模拟退火算法和遗传算法实现TSP旅行商问题，并可以用Matlab对结果进行图形显示分析，非常实用于初学者-Using simulated annealing algorithm and genetic algorithm traveling salesman problem TSP, and the results can be used Matlab graphics analysis, very useful for beginners
tsp-ac
- 用模拟退火算法编写的解决旅行商问题的一个简单程序，所用语言为c语言。-Prepared by simulated annealing algorithm to solve traveling salesman problem with a simple procedure, the use of language c language.
模拟退火算法
- 使用模拟退火算法求解tsp问题，简单易学(Using simulated annealing algorithm to solve TSP problem, easy to learn)