Solving the global optimal solution for nonlinear constrained programming is difficult.
求解非线性约束规划的全局最优解是一个难点。
The global optimal solution is obtained based on chaotic particle swarm optimization algorithm.
基于混沌粒子群优化算法对优化数学模型进行了求解。
When the scale of the problem is enlarged, it is still a difficult task to find its global optimal solution.
当问题规模增大时，寻求其全局优化解至今仍是一难题。
Therefore, optimizing weight retaining wall design to meet the global optimal solution becomes more important.
因此，对衡重式挡土墙的设计进行优化，得到满足各种条件的全局最优解，就显得比较重要。
This algorithm can adjust parameters automatically in the optimization process to find the global optimal solution.
该算法能在优化过程中自动调整各参数，从而取得问题的全局优化解。
On the basis of improved heuristic cluster local search, branch and cut method is used to get the global optimal solution.
在改进的启发式群局部搜索的基础上 ，利用分枝剪枝法得到全局最优解 。
Currently, there is no general algorithm to find the global optimal solution for the constrained non-linear programming problems.
目前对有约束非线性规划问题还没有通用的求全局最优解的算法。
Many experiments based on the data of TSPLIB show the improved algorithm has better ability to find global optimal solution in large TSP.
利用TSPLIB的数据进行的实验结果表明，改进后的算法对于中大型TSP问题，具有更好的发现最优解的能力。
The computing results show that it not only can find rapidly the approximate global optimal solution, but also has high computing accuracy.
计算结果表明，该算法能快速地求出问题的全局最优解，且具有较好的计算精度。
Experiments demonstrate that this proposed method is effective, moreover, it can converge to the global optimal solution within small epochs.
实验表明本文算法有效，能够在较短的迭代次数内收敛到问题的最优解。
And, the searching speed is improved by holding the optimum in iteration, which can guarantee the global optimal solution being found as well.
遗传过程中，通过保持迭代过程中的最优解，加快了搜索速度，并保证了收敛于全局最优解。
By giving suitable fitness function, global optimal solution was found and result of registration was given. A method was provided for clinical diagnosis.
通过给出适当的适应度函数，寻找出全局的最优解，并得到配准结果，这为医学临床诊断多模态信息融合提供了一种方法。
Computing time is greatly decreased and the global optimal solution is gained by using hybrid heuristic progressive optimality approach to unit commitment.
将该启发式方法与逐步动态优化法相结合进行机组最优组合，使计算时间大为减少，同时可保证得到最优解。
Experiment results show that the global optimal solution can be quickly obtained by the proposed method and the precision requirement for target location is satisfied.
实验结果表明，基于遗传算法的求解方案能快速地求出传感器节点位置优化问题的全局最优解，并满足目标定位的精度要求。
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.
针对算法的缺陷，对信息素更新策略进行了优化改进，使其能更快的收敛到全局最优解。
A stochastic global optimization method based on direct search is introduced to solve the global optimal solution of the problem, and the process is also discussed in detail.
将基于直接搜索法的随机全局优化方法用于求解该问题的全局最优解，给出了具体的算法步骤。
SVM has better generalization and guarantee the local optimal solution is exactly the global optimal solution. SVM can solve the learning problem of a smaller number of samples.
支持向量机具有小样本、较好的泛化能力、全局最优解等特点，在状态识别领域中表现出优良的特性。
Under the cases that the objective function is positive definite or positive semidefinite, the necessary and sufficient conditions to characterize global optimal solution are obtained.
假定约束是可行、规范的，对于目标函数为正定或半正定的情形，得到了全局最优解的充要条件。
The result of computation examples shows clearly that the global optimal solution can reliably be sought out in GEP GA, and at the same time some suboptimal solutions also can be provided.
算例结果表明：该模型既能可靠地获得全局最优解，也能输出一组次优解。
The simulation results of optimization configuration by utilizing 16 nodes demonstrate that the algorithm can converge the global optimal solution quickly, shows its correctness and validity.
该算法可以获得全局最优解，避免早熟，表明了算法的正确性和有效性。
By using differential evolution, the proposed algorithm finds the global optimal solution of objective function and obtains the separating matrix so that the signals are separated successfully.
该算法采用差分进化算法对目标函数自动寻优，求得分离矩阵，从而分离出信号。
The standard particle swarm optimization algorithm as a random global search algorithm, because of its rapid propagation in populations, easily into the local optimal solution.
标准的粒子群优化算法作为一种随机全局搜索算法，因其在种群中传播速度过快，易陷入局部最优解。
While one outstanding character of evolutionary computation is global search, it can converge to a globally optimal solution or at least a sub optimal solution.
由于进化计算一个最重要的特点便是全局搜索，这样可得全局最优解或次优解。
It offers optimal solution based on current circumstance and achieves a global suboptimal solution by several local optimal solutions.
它以当前的情况作最优选择，通过多个局部最优解最终获得一个全局次最优解。
The result shows that this method of calculation is simple, no computer, is needed and the optimal global solution can be obtained.
结果表明：该法运算简便(不用计算机)，而且可取得问题的全域最优解。
The result shows that this method of calculation is simple, no computer, is needed and the optimal global solution can be obtained.
结果表明：该法运算简便(不用计算机)，而且可取得问题的全域最优解。
应用推荐