您要查找的是不是:
- Local optimum is not even an indication for the global optima. 局部利益与整体的利益并不一致。
- In the optimization engine, genetic algorithm is adopted to avoid local optima. 在优化引擎中使用了遗传算法用来避免局部的优化解。
- Moreover, we improve the mutation to avoid the remaining local optima of GAs. 为了避免陷入局部最优,对变异算子进行了改进。
- Ant Colony Optimization algorithm(ACO)has the limitations of poor convergence, and is easy to fall in local optima. 针对蚁群优化算法(Ant Colony Optimization; ACO)收敛速度慢、易陷于局部最优解的缺点;提出了一种基于协同进化思想的蚁群算法;用于求解TSP问题.
- For multimode function optimization, a quantum SPSO (Q-SPSO) is provided to deal with multiple local optima. 实验分析了采样周期对算法优化行为的影响。
- Simulated annealing tends to be trapped in local optima, but it also possess powerful fine adjustment ability. 模拟退火算法容易陷入局部最优解,但是具有很强的微调能力。
- The heuristic approach can be an alternative to solve the model above with simplicity and immune to the local optima. 采用启发式算法求解简单易行,最优解具有全局性,且与初始点选择无关。
- The results of numerical simulation show that the algorithm has advantages, such as avoiding local optima, high precision solution and simple operations. 数值仿真结果表明该算法具不易陷入局部最优、解的精度高和操作简单等优点。
- It can be seen that the object function of the simple model is both non-convex, non-continuous, and has many local optima. 模型曲线形状表明:该优化问题为非凸不连续,具有多个局部最优解;
- ANN combined HGA makes the weight and the deviation converge to the global solutions,which escapes local optima of back-propagation network. 将混合遗传算法用于人工神经网络,训练出全局最优的权值和偏差,解决了反向传播网络收敛于局部极值的问题。
- However GA theory is not prefect,such as there exist the problems of easily creating earliness and bad ability in local optima,etc. 但是遗传算法在理论上还不够完善,例如存在容易产生早熟现象以及局部寻优能力较差等问题,影响了其进一步的应用。
- Traditional gradient-based optimization technique fails to find the global optima due to the non-convexity and non-linearity and many local optima of this kind of problem. 传统的基于梯度的搜索方法在处理这类问题时由于计算规模庞大且极易陷于局部最优解而不再适用,而遗传算法却为解决这类问题提供了很有希望的一个方向。
- For complex functions with high dimensions, general particle swarm optimization methods are slow speed on convergence and easy to be trapped in local optima. 对于高维复杂函数,一般粒子群优化算法收敛速度慢,易早熟收敛。
- It not only adaptively determined the amount and the center's positions of clustering, but also avoided the local optima and the flaw about sensitive to the initialization. 本算法不但可以根据数据自动确定聚类类目及中心位置,而且克服了传统聚类算法容易陷入局部极小值,对初始值敏感的缺点。
- PLS partitions the population into a group of disjoint subpopulations by cluster analysis, then uses simplex method to search local optima in each subpopulation in parallel. PLS算子通过聚类分析将种群分割为互不相交的邻域子种群,对每一个子种群应用单纯形法进行并行局部搜索。
- The approach has also been advanced to speed convergence and avid local optimum. 该方案能够快速正确地实现分割,且不需事先认为的确定分割类数。
- Compared with TGA, the results show that ICSA has better capability in avoiding getting into local optimum and astringency. 3. 仿真结果表明,TGA和ICSA都可以有效的解决一定规模下的TSP问题,并且ICSA具有更高的收敛性,不易陷入局部最优。
- As a new optimization technique, chaos bears randomicity, ergodicity and the superiority of escaping from a local optimum. 摘要混沌是一种新颖的优化技术,具有随机性、遍历性的特点和易跳出局部极值的能力。
- In order to solve the problem of genetic algorithm in local optimum easily,this paper increases a tabu search in a mutation method. 为解决遗传算法易陷入局部最优的问题,提出了一种在变异算子中增加禁忌表的方法。
- But along with the extending of the problem, GA tends to get local optimums. 但是随着问题规模扩大,简单遗传算法容易出现“早熟”或陷入局部极值。