算法中采用了带极值扰动策略，加速粒子跳出局部最优的能力。
The disturbed extremum scheme accelerates the particles to overstep the local extremum.
数值模拟发现，在脉冲传输距离与扰动周期长度的关系中存在着一种多极值结构。
We numerically show that there are many extremums in dependence of the propagation distance on the period lengths of perturbation.
方法运用极值原理、上下解方法、分歧理论、线性算子的扰动理论和分歧解的稳定性理论进行研究。
Methods the maximum principle, monotone method, bifurcation theory, the perturbation theorem for linear operators and the stability theorem for bifurcation solutions were used.
该算法的思想是采用混沌初始化进行改善个体质量和利用混沌扰动避免搜索过程陷入局部极值。
The basic principle of CPSO algorithm is that chaos initialization is adopted to improve individual quality and chaos perturbation is utilized to avoid the search being trapped in local optimum.
针对粒子群算法用于高维数、多局部极值点的复杂函数寻优时易陷入局部最优解现象，提出一种改进的带扰动项粒子群算法并进行收敛性分析。
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.
应用推荐