Theoretical analysis and simulation results show that AGA can not only get the global optimum value in arbitrary precision, but also raise efficiency remarkably.
理论分析和仿真实验表明改进算法不仅具有以任意精度达到全局最优值的能力，而且具有更高的优化效率。
It is proved that the algorithm converges to the global optimum in probability.
分析结果表明人口迁移算法依概率收敛到全局最优解。
Usually, the algorithm can quickly converge to the global optimum weight coefficients.
该方法对目标函数无连续、可微等要求，能较快地收敛到全局最优权系数。
The fact that it is impossible to find the global optimum in polynomial complexity has been proved.
理论上已经证明要在多项式时间复杂度内对这一类问题找到全局最优解是不可能的。
SVM has good characteristics of simple structure, global optimum and strong generalization ability.
支持向量机分类器结构简单、可获得全局最优、泛化能力强。
Mining is a complex process. The global optimum decision for mines can be regarded as a complex large system.
矿山开采是一复杂的过程，其全局优化决策可视为一个复杂的大系统。
The paper deeply studied processing flow and implemented techniques of hybrid global optimum automatic residual static corrections.
文中对混合全局优化自动剩余静校正的处理流程和实现技术作了深入研究。
The main objective of modern optimization algorithm is to deal with the problem of global optimum, which is essentially probabilistic.
现代优化算法主要解决全局最优问题，其本质是概率性的。
Three-dimensional component packing is a combinatorial optimization and NP-complete problem. It is difficult to find its exact global optimum.
三维布局问题属于组合最优化问题和NP完全问题，在一定时间内求其精确全局最优解是相当困难的。
Image matching belongs to constrained optimization problems. Whether the system would converge to the global optimum is still an open problem.
图像匹配是一种约束最优化问题，系统是否收敛于全局最优值一直尚未解决。
Genetic algorithms (GAs) with self-adapting step size can search the best solution directly and more likely to acquire the global optimum result.
具有自适应步长的遗传算法可以直接搜索全局最优解。
Comparing with other searching methods using GA directly for obtaining global optimum, MMS combines ds with GA to achieve rapid convergence speed.
与其它直接利用GA进行全局优化的方法相比，MMS利用DS配合GA实现加速收敛。
The immune memory units guarantee this algorithm rapid convergence to global optimum and the uniform crossover operator embody the idea of evolution.
算法中的免疫记忆单元确保了快速收敛于全局最优解，算法中的均匀交叉操作则体现了进化的思想。
The calculation results of computational examples with the algorithm proposed are given. The algorithm is shown to be steadily convergent at global optimum.
最后，给出了该算法的计算实例，结果表明，用该算法能较稳定地找出全局最优点。
The GA uses a population of points at a time in contrast to the single point approach by the traditional ones, and will guarantee to find the global optimum.
与经典优化算法不同的特点在于，遗传算法是从多个初始点开始寻优，沿多路径搜索实现全局或准全局最优。
No-wait flow shop problem is one of flow shop problems, and is a typically NP-complete problem, which means that it is impossible to find the global optimum in polynomial complexity.
无等待问题是流水车间调度中的一种，是一类典型的NP完全问题，已被证明在多项式时间内得不到最优值。
Meanwhile, we use a fast simulation annealing algorithm in the inversion, which can overcome the limitation of the local extremum of objective function, and acquire a global optimum result.
同时，在具体反演中使用快速模拟退火算法，可以克服目标函数局部极值的限制，从而获得全局最优解。
So firstly to get a better estimation of parameter using iterate inversion on wide scale, then using this estimation as initial value on mini scale till to get global optimum of original problem.
因此可先在粗尺度上迭代反演，得到一个较好的参数估计，再将这个估计作为较精细尺度的初值进行反演，直至原问题的全局最优解。
Genetic Algorithms is used in solving the mathematical model, it can obtain the global optimum even if there exists local optimums, and enlarge the application range of Fuzzy Physical Programming.
利用遗传算法求解数学模型，解决了最终优化目标可能存在多个局部最优解的问题，拓宽了模糊物理规划的应用范围。
The application shows that this method is capable of searching the entire solution space in order to find the global optimum, and it is effective and feasible to highway plane optimization design.
实践表明：该方法具有全局解空间搜索能力，从而实现了全局寻优的目的，对公路平面优化设计是有效、可行的。
Global optimum solution may be obtained by making interactive iteration and statistical analysis of a great deal of data.
通过对大量数据进行统计，用交互迭代的方法求出全局最优解。
Global optimum solution may be obtained by making interactive iteration and statistical analysis of a great deal of data.
通过对大量数据进行统计，用交互迭代的方法求出全局最优解。
应用推荐