搜索资源列表
SA
- 针对于多个城市的最短距离问题或旅行商问题，模拟退火算法，C#程序-For the shortest distance problem or traveling salesman problem in many cities, simulated annealing algorithm, C# program
monituihuo
- 利用模拟退火算法解决旅行商问题，显著提高算法的运算效率。-Using simulated annealing algorithm to solve the traveling salesman problem, significantly improving operational efficiency of the algorithm.
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.
City
- 使用著名的模拟退火算法来求解城市旅行商问题-Use well-known ant colony algorithm to solve the traveling salesman problem
TSP
- 利用模拟退火算法求解旅行商问题，从文件读入城市信息，输出结果到文件-TSP problem
Matlab-SA-tool-and-example
- Matlab的模拟退火算法工具箱与实例，包括最经典的旅行商问题等-Matlab toolbox simulated annealing algorithm and examples, including the most classic traveling salesman problem, etc.
my_SAlvxingshang
- 基于模拟退火算法求解旅行商问题，程序收敛性能好，结果满意-Based on simulated annealing algorithm to solve traveling salesman problem, the convergence program performance, satisfactory results
TSP
- 用MATLAB实现的模拟退火算法，去有效的解决旅行商问题（TSP问题）。-MATLAB simulation annealing algorithm, to effectively solve the traveling salesman problem (TSP).
MTSP
- 多旅行商MTSP问题遗传算法应用遗传算法求解多旅行商问题的算法设计,并将其与模拟退火算法比较与结合,有效提高了运算的速度和效率。-Multi traveling salesman MTSP problem genetic algorithm genetic algorithm to solve the problem of multiple traveling salesman problem algorithm design, and it is compared with the simul
monituihuo
- 模拟退火算法的源代码，可有效解决旅行商问题（TSP）。-Simulated annealing algorithm source code, which can effectively solve the traveling salesman problem (TSP).
code
- 2016研究生数学建模第一问程序，利用模拟退火算法和遗传算法解决旅行商问题。- 翻译关闭即时翻译 中文英语德语检测语言英语中文(简体)日语翻译 2016研究生数学建模第一问程序，利用模拟退火算法和遗传算法解决旅行商问题。 38/5000 2016 Graduate Student Mathematical Modeling First Question Procedure, Using Simulated Annealing Algorithm and Genet
SAA
- 模拟退火算法解决简单的旅行商（TSP）问题-Simulated annealing algorithm to solve the traveling salesman problem (TSP)
Simulated_Annealing
- VC++ 6.0环境下利用模拟退火算法求解旅行商（TSP）问题-simulation annealing for TSP
simulate-annealing-MFC
- 利用模拟退火算法求解旅行商（TSP）问题，MFC对话框-MFC dialgo simulation annealing for TSP
TSP
- 使用模拟退火算法解决TSP问题，TSP问题机旅行商问题-Using simulated annealing algorithm to solve the TSP problem, TSP problem machine traveling salesman problem
lvxingshang
- JAVA实现旅行商问题，有简单的可视化界面 有N个城市，要求从其中某个问题出发，唯一遍历所有城市，再回到出发的城市，求最短的路线。使用模拟退火算法可以比较快的求出TSP的一条近似最优路径。-JAVA traveling salesman problem, a simple visual interface There are N cities, which to ask a question, the only way to traverse all cities, and then
SA_TSP
- 使用模拟退火算法解决旅行商问题，在matlab里面实现-use SA algorithm to solve traveling salesman problem
amded
- 旅行商问题的模拟退火matlab源码程序()
tuihuo
- 用模拟退火算法求旅行商问题。自数字数字数字梳子梳(lvxingshang wenti moni tuihuo suanfa)