搜索资源列表
trp
- SA-TSP 模拟退火算法求解旅行商问题-SA - TSP simulated annealing algorithm for the traveling salesman problem
sa-tsp
- 模拟退火在最短路径求解问题上的实际应用！-simulated annealing for the shortest path problem on the practical application!
SA-TSP
- 利用模拟退火法求解TSP问题 可以求得50个城市的精确解
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
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
sa
- matlab 编写的模拟退火算法用于求解TSP问题，里面有中国31个城市的坐标，作为例子。-matlab sa for tsp
TSP
- 各种算法的TSP源码，包含GA、SA、TS、ANN。-TSP source of various algorithms, including GA, SA, TS, ANN.
maugis.tar
- Simulated annealing (SA) for the Symmetric Euclidean TSP
sa
- 运用模拟退火算法解决旅行商问题，简单易懂，代码清晰，行数比较少-Simulated Annealing to solve TSP
sA-TS-for-TSP
- 模拟退火算法及禁忌搜索算法解tsp的比较，文章及matalb源码-Simulated annealing algorithm and tabu search algorithm for solving tsp comparison, articles and matalb source
sa-tap
- 模拟退火算法在处理全局优化、离散变量优化等困难问题中,具有传统优化算法无可比拟的优势。描 述了模拟退火算法的原理及其基本框架结构,给出了用模拟退火算法求解TSP问题的具体实现方法 -Simulated annealing algorithm in dealing with global optimization, discrete variable optimization of difficult problems, traditional optimization algorithm
sa
- 用vc编写的基于模拟退火算法解决tsp问题的代码。-Written by vc-based simulated annealing algorithm to solve the problem of the code tsp.
TSP-SA
- 模拟退火算法求解TSP问题,城市数量分别为10个和40个，包括参数的调试-TSP problem simulated annealing algorithm
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
- 用模拟退火算法解决TSP问题。可以计算算法的运行时间。-SAA solve TSP。Can count running time.
SA_GA_PSO
- 模拟退火（SA）、遗传算法（GA）、粒子群优化（PSO）解决旅行商问题（TSP）实验 本文件包括源码，实验说明文档，实验总结PPT Have a happy experiment！-Simulated annealing (SA), genetic algorithms (GA), particle swarm optimization (PSO) to solve the traveling salesman problem (TSP) experiment of this docum
SA
- 用简单的模拟退火算法解决TSP问题的示例代码-Solving TSP problem with Simulated Annealing Algorithm.
SA(TSP)
- 模拟退火法解决最优化问题，此程序为解决TSP问题matlab程序。-Simulated annealing method
TS-SA
- 禁忌搜索和模拟退火相结合的算法，解决TSP问题。注：31城市。-Tabu search and simulated annealing to a combination of algorithms to solve TSP. Note: The 31 cities.