搜索资源列表
模拟退火
- 本程序用模拟退火算法实现了旅行商问题（tsp问题）-the procedures used simulated annealing algorithm to achieve the traveling salesman problem (tsp)
一些解决TSP问题的算法及源代码模拟退火算法
- 一些模拟退火算法及元代码,可以用于解决TSP问题的等，我已经验证过了 可以的，速度比较快，大家可以下载试试！ -some simulated annealing yuan and the code can be used to solve problems such as TSP, I can be tested, and faster speed, you can download a try!
SimulatedAnnealing(TSP)CSHARP
- 运用c＃语言实现模拟退火算法，同时利用该算法解决旅行商（TSP）问题，获得遍历所有城市序号的最优路径。-use c # language simulated annealing, while using the algorithm to solve traveling salesman (TSP). access to the serial numbers of all the cities traverse the optimal path.
tsp
- 是一个模拟退火程序,解决的是货郎担问题,所用的语言是matlab -is a simulated annealing procedures to solve the traveling salesman problem is that the language used is Matlab
tsp(c)
- 简单模拟退火算法-货郎担问题.txt（c语言）-simple simulated annealing-traveling salesman problem. Txt (c language)
TSP(travel)
- 该程序是模拟退火算法应用中旅行商问题得MATLAB实现-that the procedure was simulated annealing applications traveling salesman problem in MATLAB
sa-tsp
- 模拟退火在最短路径求解问题上的实际应用！-simulated annealing for the shortest path problem on the practical application!
TSP
- 模拟退火处理tsp问题，matlab 代码-tsp problem matlab code
TSP
- TSP 模拟退火 求最短路径 哈米尔顿回路-tsp
many-methods-to-solve-TSP
- 多种方式求解TSP问题，有遗传算法，A*算法，D算法，模拟退火，神经网络等-A variety of ways to solve TSP problem, a genetic algorithm, A* algorithm, D algorithm, simulated annealing, neural networks
TSP-based-on-improved-pso
- 基于对粒子群优化算法原理的分析，实现了一种基于TSP的改进的粒子群优化算法：求解TSP的混合粒子群算法，结合遗传算法、蚁群算法和模拟退火算法的思想来解决TSP问题。-Particle swarm optimization based on the principle of the analysis, implemented based on TSP, improved particle swarm optimization algorithm: solving the TSP hybrid pa
模拟退火算法解决tsp问题
- 设计一个可以对TSP问题进行组合优化的连续型Hopfield神经网络模型，利用该魔心可以快速的找到最优的一条路线。(A continuous Hopfield neural network model for combinatorial optimization of TSP problems is designed, which can be used to find the optimal route quickly.)
模拟退火算法
- 基于模拟退火算法的求解TSP问题的matlab程序，对于学习算法的初学者，可作为入门的简单程序(To solve the problem of TSP simulated annealing algorithm based on the matlab program, for beginners learning algorithm, can be used as a simple entry procedures)
chapter19基于模拟退火算法的TSP算法
- 模拟退火算法属于现代算法，可以求得复杂函数的最优解(The simulated annealing algorithm belongs to modern algorithm, and the optimal solution of complex function can be obtained)
模拟退火算法tsp
- 用matlab实现模拟退火实现tsp问题。(Using MATLAB to achieve simulated annealing to achieve TSP problem.)
模拟退火算法
- 此问题为传统的TSP问题，从一个城市出发，到达目的地，所用算法为模拟退火算法，算法可以完美运行。(This problem is a traditional TSP problem, starting from a city, reaching the destination, the algorithm is simulated annealing algorithm, the algorithm can run perfectly.)
基于模拟退火算法的TSP算法
- 基于模拟退火算法的TSP算法的matlab代码示例(TSP algorithm based on simulated annealing algorithm)
基于模拟退火算法的TSP算法
- 基于模拟退火算法的TSP算法,MATLAB算例实现(MATLAB code for Travelling salesman problem, TSP ,and it is in simulate annealing algorithm)
模拟退火
- 利用模拟退火算法进行仿真实验，解决TSP问题(Using simulated annealing algorithm to solve TSP)
模拟退火算法及其在求解TSP中的应用
- 模拟退火算法(Simulated Annealing，SA)最早的思想是由N. Metropolis [1] 等人于1953年提出。1983 年,S. Kirkpatrick 等成功地将退火思想引入到组合优化领域。它是基于Monte-Carlo迭代求解策略的一种随机寻优算法，其出发点是基于物理中固体物质的退火过程与一般组合优化问题之间的相似性。(The earliest idea of Simulated Annealing (SA) was put forward by N. Metropo