scholarly journals An Improved Particle Swarm Optimization Algorithm Based on Centroid and Exponential Inertia Weight

2014 ◽  
Vol 2014 ◽  
pp. 1-14 ◽  
Author(s):  
Shouwen Chen ◽  
Zhuoming Xu ◽  
Yan Tang ◽  
Shun Liu
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Swarm Optimization ◽  
Local Optima ◽  
Improved Particle Swarm Optimization ◽  
Inertia Weight ◽  
Ipso Algorithm

Particle swarm optimization algorithm (PSO) is a global stochastic tool, which has ability to search the global optima. However, PSO algorithm is easily trapped into local optima with low accuracy in convergence. In this paper, in order to overcome the shortcoming of PSO algorithm, an improved particle swarm optimization algorithm (IPSO), based on two forms of exponential inertia weight and two types of centroids, is proposed. By means of comparing the optimization ability of IPSO algorithm with BPSO, EPSO, CPSO, and ACL-PSO algorithms, experimental results show that the proposed IPSO algorithm is more efficient; it also outperforms other four baseline PSO algorithms in accuracy.

An Improved Particle Swarm Optimization Algorithm

2011 ◽  
Vol 186 ◽  
pp. 454-458
Author(s):  
Hao Xiang Cheng ◽  
Jian Wang
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Particle Swarm ◽  
Iteration Process ◽  
Concave Function ◽  
Swarm Optimization ◽  
Improved Particle Swarm Optimization ◽  
Inertia Weight ◽  
Dynamic Adaptability

An improved particle swarm optimization (IPSO) was proposed in this paper to solve the problem that the linearly decreasing inertia weight (LDIW) of particle swarm optimization algorithm cannot adapt to the complex and nonlinear optimization process. The strategy of nonlinear decreasing inertia weight based on the concave function was used in this algorithm. The aggregation degree factor of the swarm was introduced in this new algorithm. And in each iteration process, the weight is changed dynamically based on the current aggregation degree factor and the iteration times, which provides the algorithm with dynamic adaptability. The experiments on the three classical functions show that the convergence speed of IPSO is significantly superior to LDIWPSO, and the convergence accuracy is increased.

Heat Transfer Enhancement Across a Pair of Confined Cylinders Using Improved Particle Swarm Optimization Algorithm

2012 ◽  
Author(s):  
Amir Nejat ◽  
Pooya Mirzabeygi ◽  
Masoud Shariat-Panahi ◽  
Ehsan Mirzakhalili
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Optimization Technique ◽  
Particle Swarm ◽  
Weighted Average ◽  
Pso Algorithm ◽  
Transformation Method ◽  
Swarm Optimization ◽  
Improved Particle Swarm Optimization

The dissipation of the heat generated by electronic devices is the key issue in design and development of such products. The trend, especially in the computer industries, has been reducing the size and increasing the computing power of the electronic elements. Studies have indicated that the thermal performance of a micro-channel depends on its geometric parameters and flow conditions. Many techniques have been developed to enhance the performance of confined elliptical cylinders while minimizing the momentum loss. In this paper, a new robust optimization technique is presented. This new technique is an improved Particle Swarm Optimization (PSO) algorithm in which diversity is actively preserved by avoiding overcrowded clusters of particles and encouraging broader exploration. Adaptively varying “territories” are formed around promising individuals to prevent many of the lesser individuals from premature clustering and encouraged them to explore new neighborhoods based on a hybrid self-social metric. Also, a new social interaction scheme is introduced which guided particles towards the weighted average of their “elite” neighbors’ best found positions instead of their own personal bests. The case study in this paper is a two dimensional incompressible flow of non-Newtonian power-law fluid over a pair of elliptical tandem cylinders confined in a channel. A new curve parameterization named Class-Shape-Refinement-Transformation method is used to modify the shape of the confined cylinders, and its control points are adopted as the design variables. Furthermore, final solutions obtained from the Territorial Particle Swarm Optimization algorithm reveal an evident improvement over the test case cylinder across all objective functions presented.

An Improved Particle Swarm Optimization Algorithm

2012 ◽  
Vol 538-541 ◽  
pp. 2658-2661
Author(s):  
Ri Su Na ◽  
Qiang Li ◽  
Li Ji Wu
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Local Optimum ◽  
Swarm Optimization ◽  
Improved Particle Swarm Optimization ◽  
Negative Gradient ◽  
Improved Pso

Based on the standard particle swarm optimization an improved PSO algorithm was introduced in this paper. The particle swarm optimization algorithm with prior low precision, divergent character and slow late convergence is improved by joining the negative gradient. By adding negative term on standard PSO formula, combining with coefficient of negative gradient term and inertia weight , lead to effectively balance between the local and global search ability. It will accelerate convergence and avoid local optimum. Moreover, from the bionic point of view, this improved PSO algorithm is closer to the reality of the actual situation of the bird flocking. From the simulation results of four typical test functions, it can be seen that an improved particle swarm optimization with negative gradient can significantly improve the solving speed and solution quality.

Compressed Sensing Image Reconstruction Based on Improved Particle Swarm Optimization Algorithm

2014 ◽  
Vol 599-601 ◽  
pp. 1453-1456
Author(s):  
Ju Wang ◽  
Yin Liu ◽  
Wei Juan Zhang ◽  
Kun Li
Keyword(s):  
Particle Swarm Optimization ◽  
Image Reconstruction ◽  
Compressed Sensing ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Matching Pursuit ◽  
Particle Swarm ◽  
Premature Convergence ◽  
Swarm Optimization ◽  
Improved Particle Swarm Optimization

The reconstruction algorithm has a hot research in compressed sensing. Matching pursuit algorithm has a huge computational task, when particle swarm optimization has been put forth to find the best atom, but it due to the easy convergence to local minima, so the paper proposed a algorithm ,which based on improved particle swarm optimization. The algorithm referred above combines K-mean and particle swarm optimization algorithm. The algorithm not only effectively prevents the premature convergence, but also improves the K-mean’s local. These findings indicated that the algorithm overcomes premature convergence of particle swarm optimization, and improves the quality of image reconstruction.

Sign in / Sign up

Export Citation Format

Share Document