|
计算机应用研究 2011
Dynamic neighborhood particle swarm optimization for constrained optimization problems
|
Abstract:
Particle swarm optimization(PSO) for solving constrained optimization problems existed serious premature convergence,in order to inhibit this phenomenon,this paper proposed an improved constraint adaptive and dynamic neighborhood particle swarm optimization(IPSO).Algorithm used dynamic neighborhood strategy to improve the global search capability,and designed an improved adaptive constraint handling method.According to iteration number linear increase searched biases coefficient,in the early bias tended to ...