求解非线性约束问题的混合粒子群优化算法

将处理约束问题的乘子法与改进的粒子群算法相结合,提出了一种求解非线性约束问题的混合粒子群算法。此算法兼顾了粒子群优化算法和乘子法的优点,对迭代过程中出现的不可行粒子,利用乘子法处理后产生可行粒子,然后用改进的粒子群算法来搜索其最优解,这样不仅减小了粒子群算法在寻优过程中陷入局部极小的概率,而且提高了搜索精度。数值试验结果表明提出的新算法具有搜索精度更高、稳定性更强、鲁棒性更好等特点。

Hybrid Particle Swarm Algorithm of Solving Nonlinear Constraint Optimization Problems

Combining a multiplier method which deals with constraint problems with improved particle swarm optimization algorithm,a new hybrid particle swarm optimization algorithm was proposed for solving non-linear constraint problems.The new algorithm takes advantage of the particle swarm optimization algorithm and the multiplier method,for the non-available particle appearing in the iterative process,using the multiplier method to produce feasible particle,and then search its optimal value by improved particle swa...