An Improved Particle Swarm Algorithm for Constrained Optimization Problem

Author(s):  
Kang Hu ◽  
Guo-Li Zhang ◽  
Bo Xiong
2013 ◽  
Vol 380-384 ◽  
pp. 1294-1297
Author(s):  
Hong Xia Liu

There is a shortcoming that particle swarm algorithm is ease fall into local minima. To avoid this drawback, this paper insert into a perception range that from Glowworm swarm optimization. according to domain to determine a perception range, within the scope of perception of all the particles find an extreme value point sequence. All the particles that in the perception scope find a extreme value point sequence, which apply roulette method, in order to choose a particle instead of global extreme value. So as to scattered particle, and avoid the local minima.


2015 ◽  
Vol 740 ◽  
pp. 401-404
Author(s):  
Yun Zhi Li ◽  
Quan Yuan ◽  
Yang Zhao ◽  
Qian Hui Gang

The particle swarm optimization (PSO) algorithm as a stochastic search algorithm for solving reactive power optimization problem. The PSO algorithm converges too fast, easy access to local convergence, leading to convergence accuracy is not high, to study the particle swarm algorithm improvements. The establishment of a comprehensive consideration of the practical constraints and reactive power regulation means no power optimization mathematical model, a method using improved particle swarm algorithm for reactive power optimization problem, the algorithm weighting coefficients and inactive particles are two aspects to improve. Meanwhile segmented approach to particle swarm algorithm improved effectively address the shortcomings evolution into local optimum and search accuracy is poor, in order to determine the optimal reactive power optimization program.


2011 ◽  
Vol 383-390 ◽  
pp. 1071-1076
Author(s):  
Bin Yang ◽  
Qi Lin Zhang

As a new paradigm of Swarm Intelligence which is inspired by concepts from ’Social Psychology’ and ’Artificial Life’, the Particle Swarm Optimization (PSO), it is widely applied to various kinds of optimization problems especially of nonlinear, non-differentiable or non-convex types. In this paper, a modified guaranteed converged particle swarm algorithm (MGCPSO) is proposed in this paper, which is inspired by guaranteed converged particle swarm algorithm (GCPSO) proposed by von den Bergh. The section sizing optimization problem of steel framed structure subjected to various constraints based on Chinese Design Code are selected to illustrate the performance of the presented optimization algorithm.


2014 ◽  
Vol 670-671 ◽  
pp. 1517-1521
Author(s):  
Tie Bin Wu ◽  
Tao Yun Zhou ◽  
Wen Li ◽  
Gao Feng Zhu ◽  
Yun Lian Liu

A particle swarm algorithm (PSO) based on boundary buffering-natural evolution was proposed for solving constrained optimization problems. By buffering the particles that cross boundaries, the diversity of populations was intensified; to accelerate the convergence speed and avoid local optimum of PSO, natural evolution was introduced. In other words, particle hybridization and mutation strategies were applied; and by combining the modified feasible rules, the constrained optimization problems were solved. The simulation results proved that the method was effective in solving this kind of problems.


Sign in / Sign up

Export Citation Format

Share Document