多峰值函数优化结果表明，该算法可以有效地解决早熟收敛问题，更易达到全局最优解。
The optimization result of multi-peak value function shows that the algorithm presented can solve premature convergence problem effectively and converge to the globally optimal solution.
该方法对目标函数无连续、可微等要求，能较快地收敛到全局最优权系数。
Usually, the algorithm can quickly converge to the global optimum weight coefficients.
该模型具有快速收敛、鲁棒性和全局最优搜索能力。
This model has quick convergence, robustness and capability of searching the optimal solution within defined space.
针对算法的缺陷，对信息素更新策略进行了优化改进，使其能更快的收敛到全局最优解。
In allusion to the bugs of the model, the update strategies of information track were improved, so that the algorithm could converge to global optimal solution quickly.
算例表明，当混沌搜索的次数达到一定数量时，混合优化方法可以保证算法收敛到全局最优解，且计算效率比混沌优化方法有很大提高。
Numerical examples illustrate that the present method possesses both good capability to search global optima and far higher convergence speed than that of chaos optimization method.
算例结果表明，用该方法能以较快的速度收敛于全局最优解。
The example result shows that in the genetic algorithm the optimum global solution can be gained and the convergence speed is fast.
不同类型的种群分别担负着广度与深度的搜索任务，以便算法能够收敛到高精度的全局最优解。
Such a setting balances the breadth and depth of the algorithm, which made the algorithm to be converged to global optimal solutions.
遗传过程中，通过保持迭代过程中的最优解，加快了搜索速度，并保证了收敛于全局最优解。
And, the searching speed is improved by holding the optimum in iteration, which can guarantee the global optimal solution being found as well.
在不要求最优逼近误差平方可积和上界已知的条件下，证明闭环系统全局渐近稳定，所有信号有界且跟踪误差收敛到零。
We proved the closed systems global asymptotical stable, not needing the error upper bound and the error square integral, all the signals are bounded and the tracing error convergence.
导出了选择和变异条件下平均适应度单调递增并收敛到全局最优解的条件。
Sufficient condition for monotonous increase of the average fitness converging to the global maximum value is derived.
通过对信息素更新策略、局部搜索算法、随机选择概率三个方面的改进，提高算法的全局最优搜索能力和收敛性。
Based on the pheromone updating strategy, local search algorithm, the probability of randomly selected three areas to improve, improve the algorithm's global search ability and convergence of optimal.
并证明了它依概率收敛于全局最优解。
The CSPSO is guaranteed to converge to the global optimization solution with probability one.
算法中的免疫记忆单元确保了快速收敛于全局最优解，算法中的均匀交叉操作则体现了进化的思想。
The immune memory units guarantee this algorithm rapid convergence to global optimum and the uniform crossover operator embody the idea of evolution.
业已证明，提出的算法可以保证收敛到全局最优解。
It has been proved that the algorithm can converge to globally optimal solution.
该算法本质上是一种随机搜索算法，并能以较大概率收敛到全局最优，特别适用于连续函数的优化。
The algorithm is a random searching algorithm in nature. It can converge to the global minima more probability and be adept in continuous functions optimization.
与单点最优算法相比，该方法为多点寻优，单调收敛，可获得全局最优解和用于长、短期或实时优化调度。
The algorithm USES a population of points at a time in contrast to the single point approach by traditional optimization methods. The convergence is monotonic and a global solution is obtained.
该篇论文针对约束最优化的一般性问题，提出一种具有全局收敛性的内点算法。
In this paper we describe an interior algorithm with global convergence of the general optimization problem.
图像匹配是一种约束最优化问题，系统是否收敛于全局最优值一直尚未解决。
Image matching belongs to constrained optimization problems. Whether the system would converge to the global optimum is still an open problem.
但ICP配准算法的收敛速度较慢，且不能保证收敛到全局最优点。
But the convergence speed is still slow and the ICP algorithm may not converge to a global minimum.
第3章给出了广义模式搜索算法对线性等式约束最优化问题的一个新解法，并证明了这种算法的全局收敛性。
Chapter 3 constructs a new generalized pattern search method for linear equality constrained optimization problems and gives the proofs of the global convergence.
算法采用最优保存策略来保证全局收敛性。
但由于其本质特性，传统遗传算法很容易产生早熟收敛的现象，而不能收敛到全局最优。
But, because of its characteristic, standard GA prematures easily and can't convergence to global optimal.
实验结果表明，使用该算法的聚类比改进的核聚算法、K均值算法等单一方法具有良好的收敛性、稳定性和更高的全局最优。
The experimental results show that the proposed algorithm is superior to the improved kernel clustering algorithm and K-means in good astringency, stability and overall optimal solutions.
具体表现在：由于模拟进化算法的随机性，不能保证每次计算都能收敛到全局最优解，同时还存在“早熟”现象；
The drawbacks of simulated evolutionary algorithms are that the global optimality can not be always guaranteed because of randomicity and premature con vergence.
这种算法被证明为能收敛至全局最优。
It is proven that the algorithm can guarantee the convergence towards the global optimum.
本文提出一种模糊遗传算法的优化设计方法，能够迅速找到全局最优解，并加快收敛速度和减少计算工作量。
A new optimal design based on fuzzy genetic algorithms is proposed in this paper, which can help to find the optimal value overall situation and reduce the calculating work.
该算法能够收敛到全局最佳结果，是网络效用达到最优。
By solving the problem, we get a distributed algorithm, which can get a global convergence for network.
该方法能实现规划问题的全局优化，有效地收敛到最优解或近似最优解。
This method can achieve overall optimization of the programming and effectively converge to the optimal solution or approximate optimal solution.
该方法能实现规划问题的全局优化，有效地收敛到最优解或近似最优解。
This method can achieve overall optimization of the programming and effectively converge to the optimal solution or approximate optimal solution.
应用推荐