搜索资源列表
matlab--TSP-SA
- 基于MATLAB 使用模拟退火算法求解旅行商问题的源码实现。解压后就可以用。-MATLAB based simulated annealing algorithm using the source code for the traveling salesman problem implementation. After decompression can be used.
CSharp-TSP-SA
- 基于C# 使用模拟退火算法求解旅行商问题的源码实现，解压后就可使用，方便 好用。-Based on C# using the simulated annealing algorithm for traveling salesman problem source implementation, after decompression can be used, easy to use.
CPP-SA-TSP
- 基于C++的模拟退火算法求解旅行商问题的源码实现过程。解压后即可使用。一起分享。-C++ based on simulated annealing algorithm for solving the traveling salesman problem source implementation process. After decompression can be used. Share.
SA-for-TSP
- 模拟退火算法求解旅行商问题，所用数据时CHN1-Simulated Annealing for Traveling Salesman problem, the use of data CHN144
TSP_SA
- 模拟退火算法，用于解决旅行商问题，也可以修改后用于其它优化问题。-simulated annealing algorithm used to solve traveling salesman problem
TSP
- 模拟退火算法求解旅行商问题 程序使用的参数说明：初始温度的选取方法：取一个确定值：280度 状态被接受的条件：如果delta f < 0, 则At = 1，否则At = exp(-delta f / t) 降温算法：采用等比例下降的方法，比例系数为0.95 同一温度内计算结束的条件： 在每个温度下采用固定的迭代次数，Lk=100n，n为城市数； 算法结束条件： 当相邻三个温度得到的解无任何变化时算法停止。 -Simulated annealing algo
tspfire
- 按照人工智能得要求，实现了模拟退火算法，解决了旅行商问题-this code have solved the tsp problem with c plus plus
CTSP_SA
- 用模拟退火算法解决经典的旅行商问题，有数据，有程序，有解决问题前后的图形对照。有已经过调试。-Simulated annealing algorithm to solve the classical traveling salesman problem, data, procedures, and solve problems before and after the graphics control. Has been debugged.
cheapTSP1
- 旅行商问题的近似解答。使用mpich2实现。计算100个节点使用7台机器大概需要10min。使用的模拟退火算法。-basic tsp problem solution using mpich2
VFSA
- 求模拟退火算法解旅行商问题,求解最优路径，为用户计算得到最经济的路线，一遍做决策。-Solving Traveling Salesman Problem seeking the simulated annealing algorithm for solving the optimal path, calculate the most economic route for the user, again to make decisions.
TSP
- 模拟退火算法解决旅行商问题的的C++代码-Simulated annealing algorithm to solve the traveling salesman problem C++ code
matlab-simulated-annealing-algorithm
- matlab模拟退火算法。代码包含旅行商问题（TSP）等三个问题-matlab simulated annealing algorithm
monituihuo
- 针对旅行商问题的随机模拟退火算法，可以使用-Random simulated annealing algorithm for the traveling salesman problem, you can use
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
SA
- 用matlab实现的基于模拟退火算法的旅行商问题即TSP问题-Achieved using matlab simulated annealing algorithm for the traveling salesman problem TSP problem
heuristic-algorithm
- 旅行商问题，使用模拟退火算法和遗传算法解决的代码。-The traveling salesman problem using the simulated annealing algorithm and genetic algorithm to solve the code.
TSPSAA
- 模拟退火算法在MATLAB环境下解决旅行商问题，实例代码-Simulated annealing algorithm in MATLAB environment to solve the traveling salesman problem, example code
TSP
- 人工智能中的经典算法，TSP模拟退火算法。本程序简单实现了的用模拟退火算法实现了旅行商问题。只需在文本cities中输入各个城市之间的距离，运行程序后就可以求出旅行各个城市的最短距离。适合学习人工智能和对该算法有兴趣的同学使用。-Classic artificial intelligence algorithm, TSP simulated annealing algorithm. The program is simple to achieve with simulated annealing
monituihuoTSP
- 模拟退火算法解决旅行商问题，10、20点找到最优解的概率约为0.8-Simulated annealing algorithm to solve the traveling salesman problem, the probability of 10,20 points to find the optimal solution is approximately 0.8
matlab_simulated-annealing-algorithm
- 模拟退火算法 简单清晰 他是一种求解旅行商问题的高效算法，适合大家研究，欢迎改进，指正。-It is a simulated annealing algorithm.He is an efficient algorithm is used for solving the traveling salesman problem