对于约束优化问题，大多数算法都基于梯度的概念，要求目标函数和约束条件可微，而且一般只

能求得局部最优解’ 粒子群优化算法（@DMLEP&H 6VDMS .RLESDTEL F，简称 @6.）

［ ，)］ ，由于其具有容易理

解、易于实现、不要求目标函数和约束条件可微，并能以较大概率求得全局最优解的特点，目前已在

许多优化问题中得到成功应用-For constrained optimization problems, most algorithms are based on the concept of gradient, requires that the target function and constraints differentiable, and generally can only be obtained locally optimal solution ' PSO (@ DMLEP &　H 6VDMS .RLESDTEL　F, Acronym @ 6 .) [ )], because of its easy to understand, easy to implement, does not require the objective function and constraints differentiable, and are able to obtain greater probability characteristics of the global optimum solution, has been obtained in a number of optimization problems successful application