This method avoids the complicated process of traditional optimization algorithms.
该方法简单易行，避免传统优化算法的繁琐过程。
Group search strategy and inter-group exchange of information between individuals is that it is two major characteristics superior than the traditional optimization algorithms.
群体搜索策略和群体间个体之间的信息交换是它比传统优化算法优越的两大特点。
It is necessary to optimize the designed structures for reducing control energy, however, traditional optimization algorithms are not satisfied for vibration active control system.
为减少控制系统所需能量，有必要对结构进行优化设计，而传统的优化方法对于振动主动控制系统的优化不太适合。
Since they often contain multiple objectives with conflict as well as uncertain objective functions and constraints, it is difficult for traditional optimization algorithms to solve them.
由于该类问题不仅包含了相互冲突的多个目标函数，而且目标函数或者约束又具有不确定性，因而使得传统优化方法难以适用。
Optimization methods, the theory and algorithm of solving optimization problems, can be divided into two parts, the traditional optimization algorithms and intelligent optimization algorithms.
最优化方法是解决最优化问题的理论和算法，主要包括传统优化算法和智能优化算法两大类。
The results of the optimization indicate that this method can overcome the default of the local optimization of traditional optimization algorithms; it is easy to convergent and has high precision.
优化结果表明，此方法能够克服传统优化算法极易陷入局部最优的缺点，而且收敛速度快，计算精度高。
Partition subarray is a complicated nonlinear optimization task and traditional linear optimization algorithms do not work.
对于子阵进行划分，是一个复杂的非线性优化问题，传统的优化算法无法胜任。
However, the traditional algorithms have the problems of early convergence or stagnation in the process of combinatorial optimization problems.
然而，基本蚁群算法在求解组合优化问题过程中容易出现过早收敛或停滞现象。
The modern optimization algorithms have more advantages compared with traditional methods.
相对于传统优化方法，现代优化算法的优势日趋明显。
To solve this kind of complex optimization problem, the traditional algorithms can't satisfy with the request for actual application very good for limitation of performance.
传统的优化算法在解决这类优化问题时存在着等诸多性能局限，不能很好的满足实际应用的需要。
Aiming at the large mount of calculation of the traditional algorithms for polarimetric power optimization of random target in arbitrary channel, a fast algorithm is proposed in this article.
针对现有分布式目标通道最优极化算法存在运算量偏大等问题，以算法的实用性为目的，在理论分析的基础上提出一种求解分布式目标通道最优极化的快速算法。
The analysis of the traditional traffic path optimization algorithms showed that their realtime capability appear insufficient under the largescale road network conditions.
在对经典路径优化算法性能进行分析的基础上，指出了现有路径优化算法在大规模路网条件下实时性差的问题。
Traditional particle swarm optimization(PSO) algorithms often trap into local minima easily when used for the optimization of high-dimensional complex functions with a lot of local minima.
针对粒子群算法用于高维数、多局部极值点的复杂函数寻优时易陷入局部最优解现象，提出一种改进的带扰动项粒子群算法并进行收敛性分析。
Traditional particle swarm optimization(PSO) algorithms often trap into local minima easily when used for the optimization of high-dimensional complex functions with a lot of local minima.
针对粒子群算法用于高维数、多局部极值点的复杂函数寻优时易陷入局部最优解现象，提出一种改进的带扰动项粒子群算法并进行收敛性分析。
应用推荐