登录
首页 » AI-NN-PR » Common ant colony algorithm, this algorithm can efficiently solve the problem ts...

Common ant colony algorithm, this algorithm can efficiently solve the problem ts...

于 2023-08-08 发布 文件大小:2.20 kB
0 66
下载积分: 2 下载次数: 1

代码说明:

通用的蚁群算法,这个算法可以高效地解决tsp问题-Common ant colony algorithm, this algorithm can efficiently solve the problem tsp

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

发表评论

0 个回复

  • libview的libsvm程序,它的应用比较方便。
    libview的libsvm程序,它的应用比较方便。-libview the libsvm procedure, its application more convenient.
    2023-07-03 09:00:03下载
    积分:1
  • Hopfield 网――擅长于联想记忆与解迷路 实现H网联想记忆的关键,是使被记忆的模式样本对应网络能量函数的极小值。 设有M个N维记忆模式,通过对网络N个神经
    Hopfield 网――擅长于联想记忆与解迷路 实现H网联想记忆的关键,是使被记忆的模式样本对应网络能量函数的极小值。 设有M个N维记忆模式,通过对网络N个神经元之间连接权 wij 和N个输出阈值θj的设计,使得: 这M个记忆模式所对应的网络状态正好是网络能量函数的M个极小值。 比较困难,目前还没有一个适应任意形式的记忆模式的有效、通用的设计方法。 H网的算法 1)学习模式――决定权重 想要记忆的模式,用-1和1的2值表示 模式:-1,-1,1,-1,1,1,... 一般表示: 则任意两个神经元j、i间的权重: wij=∑ap(i)ap(j),p=1…p; P:模式的总数 ap(s):第p个模式的第s个要素(-1或1) wij:第j个神经元与第i个神经元间的权重 i = j时,wij=0,即各神经元的输出不直接返回自身。 2)想起模式: 神经元输出值的初始化 想起时,一般是未知的输入。设xi(0)为未知模式的第i个要素(-1或1) 将xi(0)作为相对应的神经元的初始值,其中,0意味t=0。 反复部分:对各神经元,计算: xi (t+1) = f (∑wijxj(t)-θi), j=1…n, j≠i n―神经元总数 f()--Sgn() θi―神经元i发火阈值 反复进行,直到各个神经元的输出不再变化。-Hopfield network-- good at associative memory solution with the realization of lost H associative memory networks, are key to bringing the memory model samples corresponding network energy function of the minimum. With M-N-dimensional memory model, the network N neurons connect between right wij and N output threshold j design makes : M-mode memory corresponding to the network is a state network energy function is the M-000 minimum. Mor
    2023-03-24 10:55:03下载
    积分:1
  • Genetic algorithm in the new multi
    遗传算法中的新的多点交叉算法用来优化选择最优值-Genetic algorithm in the new multi-point crossover algorithm
    2022-05-29 23:44:27下载
    积分:1
  • 基于自动学习的逻辑推理机。程序…
    基于机器学习的自动逻辑推理机。本程序用归结反演策略实现了命题逻辑系统的自动推理。把要解决的问题作为一个要证明的命题,其目标公式被否定并化成子句形,然后添加到命题公式集中去,把消解反演系统应用于联合集,并推导出一个空子句(NIL),产生一个矛盾。-based on the automatic machine learning logical reasoning machine. The procedures used attributed inversion strategy to achieve the propositional logic of automatic reasoning. Put the problem to be solved as a proposition to prove, with the goal being negated formula and shape into a phrase and then added to the Proposition formula to concentrate, digestion system for joint inversion sets and derived an empty phrase (NIL), resulting in a contradiction.
    2022-12-19 10:50:03下载
    积分:1
  • 一种神经网络开发程序集
    一个c语言开发的神经网络程序集-a Neural Network Development Program Set
    2022-07-27 20:05:34下载
    积分:1
  • 应用径向基神经网络作预测的matlab程序
    应用径向基神经网络作预测的matlab程序-application RBFNN forecast for the Matlab procedures
    2022-04-15 02:28:41下载
    积分:1
  • 遗传算法的示例
    遗传算法的示例- Heredity algorithm demonstration
    2022-07-09 13:52:12下载
    积分:1
  • on the ant colony algorithm for solving specific problems Optimization Practice...
    介绍了蚁群算法解决具体问题的优化算法,实践证明效果很好-on the ant colony algorithm for solving specific problems Optimization Practice has proved very effective
    2022-11-08 20:55:03下载
    积分:1
  • 基因算法(GA) GA 是一种启发式的优化法 (heuristic optimization method), 它是通过既定的随机搜索进行操作.优化问题的可...
    基因算法(GA) GA 是一种启发式的优化法 (heuristic optimization method), 它是通过既定的随机搜索进行操作.优化问题的可能的解的集合被认为是 个体(individuals)组成的 人群(population). 一个个体对它的环境的适应程度由它的 健康度(fitness)表示. -genetic algorithm (GA) GA is a heuristic optimization method (heuristic optimi method. 5), which is established through a random search for the operation. Optimization of the solution may be considered a collection of individuals (individuals) of the crowd (pop ulation). It"s an individual adaptation to the environment by its Health (fitness).
    2022-08-14 21:53:12下载
    积分:1
  • Foreign researchers with the relevant frequent pattern discovery (including freq...
    是国外相关研究人员提供的发现频繁模式(包括频繁集、频繁子图等)的最新版本算法。-Foreign researchers with the relevant frequent pattern discovery (including frequent itemsets, frequent subgraph, etc.) the latest version of algorithm.
    2022-05-05 13:28:44下载
    积分:1
  • 696518资源总数
  • 106161会员总数
  • 5今日下载