搜索资源列表
sa
- VB中最短路径算法的设计思路，并附带源码。-VB in the shortest path algorithm design ideas, and comes with source code.
sa-tap
- 模拟退火算法在处理全局优化、离散变量优化等困难问题中,具有传统优化算法无可比拟的优势。描 述了模拟退火算法的原理及其基本框架结构,给出了用模拟退火算法求解TSP问题的具体实现方法 -Simulated annealing algorithm in dealing with global optimization, discrete variable optimization of difficult problems, traditional optimization algorithm
MATLAB
- it is a matlab program for ga sa tabu sworm opt heuristics we can also use matlab here. or there can
SA
- 一种用MATLAB实现的改进的模式退火算法的编程，模拟退火是智能计算中很重要的算法之一。-Using MATLAB to achieve a kind of model annealing algorithm to improve the programming, simulated annealing is a very important intelligent algorithm calculation one.
SA
- C++语言实现模拟退火算法，四次迭代，更为精确的搜索的最优解-realize the simulate anneal algorithm with four iterative and lead to more accurate solution
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
sa
- c++编写的模拟退火算法旅行家问题，可以执行，包含源代码 -c++ written in the problem simulated annealing algorithm traveler, you can perform, including the source code
SA
- 经典的模拟退火算法，非常实用，程序中城市坐标已给出，需要的话可以修改-Classical simulated annealing, very practical, the program coordinates the city has been given, if required, can be modified
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.
optimsition
- 主要介绍智能优化算法的程序，有GA、SA算法-Intelligent optimization algorithms introduced the program, there are GA, SA algorithm
learn-of-SA
- 在matlab中学习模拟退火算法的一些材料。-In matlab simulated annealing algorithm to learn some of the material.
sa
- 用模拟退火算法解决TSP问题。可以计算算法的运行时间。-SAA solve TSP。Can count running time.
SA
- 模拟退火算法 模拟 退火算法 -Simulated annealing algorithm simulated annealing algorithm simulated annealing algorithm simulated annealing algorithm
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-for-TSP
- 模拟退火算法求解旅行商问题，所用数据时CHN1-Simulated Annealing for Traveling Salesman problem, the use of data CHN144
sa
- 基于M5（2-opt领域）选择策略的模拟退火算法，手动编写，实现的效果也相当不错！-Based on M5 (2-opt the field) selection strategy simulated annealing algorithm, written by hand, to achieve the effect is quite good!
TSP110707-1
- 旅行商问题是一个典型的NP完全性问题。本文基于改进的自适应遗传 算法设计并开发了一个求解旅行商问题的软件程序，并将此程序进行了48 个城市的TSP问题计算，与模拟退火算法的计算过程及计算结果进行了比 较。文中给出了遗传算法在解决TSP问题中的参数选择和编码方式、适应 度函数的设计、种群的初始化和遗传算子的详细设计。通过对此程序的改 装，即可用于其他NP完全性问题的求解。-The traveling salesman problem is a typical NP proble