登录
首页 » C# » 模拟退火算法解决TSP问题,用固体退火模拟组合优化问题,将内能E模拟为目标函数值f,温度T演化成控制参数t,即得到解组合优化问题的模拟退火算法:由初始解i和控制...

模拟退火算法解决TSP问题,用固体退火模拟组合优化问题,将内能E模拟为目标函数值f,温度T演化成控制参数t,即得到解组合优化问题的模拟退火算法:由初始解i和控制...

于 2022-02-20 发布 文件大小:1.29 kB
0 116
下载积分: 2 下载次数: 1

代码说明:

模拟退火算法解决TSP问题,用固体退火模拟组合优化问题,将内能E模拟为目标函数值f,温度T演化成控制参数t,即得到解组合优化问题的模拟退火算法:由初始解i和控制参数初值t开始,对当前解重复“产生新解→计算目标函数差→接受或舍弃”的迭代,并逐步衰减t值,算法终止时的当前解即为所得近似最优解-Simulated annealing algorithm to solve the TSP problem, combined with solid-annealing simulation optimization problems, the internal energy E is modeled as the objective function value f, temperature T evolved into control parameter t, that is to be solutions of combinatorial optimization problems simulated annealing algorithm: from the initial solution i and control the parameters of the initial value t begin to repeat the current solution, " to generate new solutions of differential → → calculation of the objective function to accept or give up," iteration, and gradually decay t values, the algorithm is terminated shall be derived from the current approximate solution of the optimal solution

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • TAnalysis
    说明:  傅立叶功率谱法求纹理特征 可解压缩后直接执行(Fourier power spectrum method for texture features can be extracted directly after implementation)
    2006-04-09 09:28:27下载
    积分:1
  • Timers
    TIMER sample code and test program
    2013-12-08 22:40:35下载
    积分:1
  • ROUTE
    train management system
    2010-04-24 19:37:17下载
    积分:1
  • TMS320LF24XX-3
    tms320lf2407 eva evb c program 数字输入输出模块程序 希望对大家有帮助
    2014-05-28 14:22:17下载
    积分:1
  • policy_pcckft
    LDPC的经典论文,1963年Gallager写的(Classic paper by LDPC, by Gallager in 1963)
    2019-01-04 03:29:00下载
    积分:1
  • TQt1
    excel的C++实现方式,后面是凑字数的,哈哈哈哈哈哈哈哈哈哈或或或(C++ implementation of excel, followed by the number of words, ha ha ha ha ha ha ha ha ha ha ha ha or o)
    2020-06-16 12:28:32下载
    积分:1
  • 计算黄金分连数
    计算黄金分连数小数点后100位
    2014-04-20下载
    积分:1
  • C#控制雷赛驱动器单轴点位运动
    C#控制雷赛驱动器单轴点位运动
    2020-11-29下载
    积分:1
  • Figure-topological-sort
    说明:  拓扑排序   对一个 有向无环图 G进行拓扑排序,是将G中所有顶点排成一个线性序列,使得图中任 意一对顶点u和v,若u,v ∈E,则u在线性序列中出现在v之前。   通常,这样的线性序列称为满足拓扑次序的序列,简称 拓扑序列 。 注意:   ①若将图中顶点按拓扑次序排成一行,则图中所有的有向边均是从左指向右的。   ②若图中存在有向环,则不可能使顶点满足拓扑次序。   ③一个DAG的拓扑序列通常表示某种方案切实可行。 (Topological sort In a directed acyclic graph G topological sort, is all vertices will G formed a linear sequence, make diagram post Meaning a pair of vertex u and v, if u, v ∈ E, then u in linear sequence in which they appear in v before. Usually, such linear sequence sequence of topological order called meet, abbreviation topology sequence. Note: (1) if the diagram according to the topology order line vertices, then figure all from left to right edge are pointing. (2) if the figure to exist in the ring, is impossible to have the vertex meet topological sequence. (3) a DAG topological sequence usually expressed some scheme is feasible. )
    2011-03-22 17:19:14下载
    积分:1
  • road
    利用分治的思想,并使用C语言,解决树上路径问题,求权值最小的边(Use the idea of ​ ​ partition, and use the C language, problem solving tree path, find the smallest edge weights)
    2013-09-29 11:04:23下载
    积分:1
  • 696516资源总数
  • 106658会员总数
  • 16今日下载