local optimum
[计划][数] 局部最优
2026-04-13 16:02 浏览次数 17
[计划][数] 局部最优
Local system-optimum局部系统最优
trapping in local optimum陷入局部最优的
local flow optimum局部最优
local optimum search局部最优搜索
local optimum model局部最优模型
local optimum detection局部优化检测
local l optimum局部最优
the adoption of remembrance-guided search method emphasizes local optimum value in each remembrance segment, which avoids the blindness of global search.
算法中采用的记忆指导搜索策略重点搜索了各记忆段的局部最优值,避免了全局搜索的盲目性;
by using the multi-parent crossover operator and the new mutation operator, the variety of population and the ability of mpga algorithm breaking away from the local optimum are effectively improved.
该算法通过引入多父体杂交算子和新的变异算子,有效的增强了种群的多样性及算法跳出局部最优解的能力。
most swarm intelligence algorithms fall into local optimum easily, and convergence speed is very slow.
大多数群体智能算法容易陷入局部最优,且收敛速度较慢。
however, drawbacks of slow convergent speed and sometimes just getting local optimum solution are found by tests when common ga technology is applied.
但在试验中发现普通遗传算法存在收敛速度较慢且容易陷入局部最优解等问题。
based on the objective function, local optimum and iterative method were adopted to get a computer solution on the optimum economical thickness.
对保温设计的目标函数,采用局部求优,逐步迭代的方法,实现了多层保温经济厚度计算机求解。
aiming at problem that particle swarm optimization(pso) algorithm falls into local optimum easily, this paper presents a pso algorithm based on sub-region.
针对粒子群优化(pso)算法在寻优时容易陷入局部最优的不足,提出一种基于子区域的pso算法。
using the two groups evolve separately and monitoring each other, when one or two groups fell into local optimum, it could jump out of local optimum through interaction;
利用同一种群两个分组分别进化,同时相互监督,某一个分组或者两个分组都陷入局部最优时,它能够通过相互作用跳出局部最优;
otherwise, the hybrid algorithm can avoid trapping in local optimum and does not need initial feasible solution.
另外,该算法可有效避免陷入局部最优,也不要求提供初始可行解。
the existing independent component analysis(ica) methods are easy to strap into local optimum values, so the extracted fetal electrocardiogram(fecg) is often mixed with some maternal ecg(mecg).
现有独立分量分析(ica)方法易陷入局部极优值,从而使提取出的胎儿心电信号(fecg)中常混有部分母体心电(mecg)。
the results show the optimized bp neural network can effectively avoid converging on local optimum and reduce training time greatly.
实验结果证明,优化后的bp网络可有效地避免收敛于局部最优值,大大地缩短了训练时间。
based on the intensive study of the problems containing local optimum and slow late convergence, a new hybrid tabu search-particle swarm optimization algorithm (hts-pso) is obtained.
通过对粒子群算法的深入研究,探索面向约束多目标优化的改进策略,并应用于锌电解过程的能耗优化。
by introducing mutation operation into ts algorithm, the ability to escape from local optimum is enhanced and the global search ability of the ts algorithm is strengthened.
通过在禁忌算法中引入小概率变异扰动,增强禁忌算法跳出局部最优解的能力,提高了算法的全局寻优能力;
the constriction factor particle swarm optimization(pso) algorithm is easily trapped in the local optimum and appeared premature convergence.
收缩因子粒子群优化算法容易陷入局部最优并出现早熟收敛的现象。
k-medoid algorithm is a popular method for clustering. its main drawback is that it often gets trapped in local optimum and the computing cost is too high.
中心点算法是一个常用的聚类算法,它的主要缺陷是容易陷入局部极值,计算代价太高。