搜索资源列表
saa
- 使用模拟退火算法解0-1背包问题MATLAB源代码-using simulated annealing Xie 0-1 knapsack problem MATLAB source code
sa-ega
- 基于遗传算法的模拟退火-based on genetic algorithm simulated annealing
模拟退火解决tsp的源程序
- 不知可以没?-I do not know can not?
TSP111
- 用模拟退火算法求解TSP问题-simulated annealing algorithm for TSP
cmcm98b
- 98年全国大学生数学建模竞赛B题“水灾巡视问题”,是一个推销员问题,本题有53个点,所有可能性大约为exp(53),目前没有好方法求出精确解,既然求不出精确解,我们使用模拟退火法求出一个较优解,将所有结点编号为1到53,1到53的排列就是系统的结构,结构的变化规则是:从1到53的排列中随机选取一个子排列,将其反转或将其移至另一处,能量E自然是路径总长度。具体算法描述如下:步1: 设定初始温度T,给定一个初始的巡视路线。步2 :步3 --
simulated annealing
- 模拟退火算法求解经典图论中的图着色问题的源程序-simulated annealing algorithm classic graph coloring map of the source
for TSP(Matlab)
- 模拟退火算法用于求解旅行商问题的matlab源程序-simulated annealing algorithm for solving the traveling salesman problem Matlab source
模拟退火算法实现旅行商算法
- 采用的是康力山等人确定的实验参数。 对于n个城市的旅行商问题,其参数如下: 初始温度:t0=280, 每一个温度下采用固定的迭代次数L=100n, 温度的衰减系数alpha=0.92 算法停止的准则是当相邻两个温度得到的解变化很小时算法停止。-used the Stanozolol Hill were determined by the experimental parameters. N cities for the travel
K-均值聚类算法C++编程
- K-均值聚类算法的编程实现。包括逐点聚类和批处理聚类。K-均值聚类的的时间复杂度是n*k*m,其中n为样本数,k为类别数,m为样本维数。这个时间复杂度是相当客观的。因为如果用每秒10亿次的计算机对50个样本采用穷举法分两类,寻找最优,列举一遍约66.7天,分成3类,则要约3500万年。针对算法局部最优的缺点,本人正在编制模拟退火程序进行改进。希望及早奉给大家,倾听高手教诲。-K-means clustering algorithm pr
aiwa
- TSP问题(货郎担问题,旅行商问题)的模拟退火算法通用malab源程序-Traveling Salesman Problem (TSP, the traveling salesman problem), simulated annealing algorithm common source malab
saMatlab
- 用matlab语言编写模拟退火算法,实现0-1被包问题-using Matlab language simulated annealing algorithm to achieve 0-1 by Kit
mul-anneal
- 本代码包包含一个模拟退火算法的c++程序。此外还有其他一些源码,这在该压缩包中,有一个readme文档,对其进行了详细说明。-this code contains a simulated annealing algorithm c procedures. There are also some other source, which in the compressed, a readme files, its a detailed ex
20058222411814490
- 这里还有一个模拟退火算法的程序,我很不容易才找到的,可是我没有用-There is a simulated annealing procedures, I do not easily find, but I did not use
Matlab-Toolbox2
- 自适应模拟退火软件包,我也正在学习中,希望有人指教-Adaptive Simulated Annealing package, I was learning, hoping that someone will enlighten
MnthTsp
- 用模拟退火技术解决旅行商问题.算法中采用了人工智能中比较新的模拟退火算法.-simulated annealing technology to solve the traveling salesman problem. Algorithms used in the artificial intelligence relatively new simulated annealing algorithm.
tuihou
- 用VC++方法实现模拟退火算法,解决TSP问题-VC method of simulated annealing algorithm to solve TSP
Math-Matlab-Engine-0.02.tar
- 是MATLAB的模拟退火码 -MATLAB is the simulated annealing code is simulated annealing MATLAB code is simulated annealing MATLAB code
C-SAA
- 因课程需要,编写了C语言的模拟退火算法,其中随机数的产生方法至关重要。-curriculum needs, the preparation of the C language simulated annealing algorithm, the number of random selection is crucial.
vcfortsp
- 这是一款基于vc编写的模拟退火算法,界面简洁易用,并附有源代码,希望对大家学习有所帮助-This is a vc prepared based on simulated annealing algorithm, the interface simple and easy-to-use, with source code, and they hope to help them to learn
Anneal_Cpp
- 模拟退火(Simulated Annealing)算法c++源程序-simulated annealing (Simulated Annealing) algorithm c source