Population diversity based inertia weight adaptation in Particle Swarm Optimization

2012 ◽  
Author(s):  
Shi Cheng ◽  
Yuhui Shi ◽  
Quande Qin ◽  
T. O. Ting
Keyword(s):  
Particle Swarm Optimization ◽  
Particle Swarm ◽  
Population Diversity ◽  
Swarm Optimization ◽  
Inertia Weight

A Resilient Particle Swarm Optimization Algorithm with Dynamically Changing Inertia Weight

2013 ◽  
Vol 712-715 ◽  
pp. 2423-2427
Author(s):  
Zhi Dong Wu ◽  
Sui Hua Zhou ◽  
Shi Min Feng ◽  
Zu Jing Xiao
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Particle Swarm ◽  
Global Optimum ◽  
Local Extremum ◽  
Population Diversity ◽  
Swarm Optimization ◽  
Inertia Weight ◽  
The Individual

To overcome the shortage that the particle swarm optimization is prone to trap into local extremum searching for the lost in population diversity, a strategy in which the velocity is not dependent on the size of distance between the individual and the optimal particle but only dependent on its direction is proposed. The average similarity of particles in the population is seem as the measure of population diversity and it is used to balance the global and local searching of the algorithm. Based on establishing the relationship between inertia weight and the measure of population diversity which has been inserted into the algorithm, A resilient particle swarm optimization algorithm with dynamically changing inertia weight (ARPSO) was proposed. ARPSO was applied in simulation experiment. The results show that the algorithm has the ability to avoid being trapped in local extremum and advance the probability of finding global optimum.

scholarly journals Improved Opposition-Based Particle Swarm Optimization Algorithm for Global Optimization

Symmetry ◽  
2021 ◽  
Vol 13 (12) ◽  
pp. 2280
Author(s):  
Nafees Ul Hassan ◽  
Waqas Haider Bangyal ◽  
M. Sadiq Ali Khan ◽  
Kashif Nisar ◽  
Ag. Asri Ag. Ibrahim ◽  
...  
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Problems ◽  
Statistical Tests ◽  
Random Sequence ◽  
Particle Swarm ◽  
Population Diversity ◽  
Bench Mark ◽  
Swarm Optimization ◽  
Inertia Weight ◽  
Simulation Results

Particle Swarm Optimization (PSO) has been widely used to solve various types of optimization problems. An efficient algorithm must have symmetry of information between participating entities. Enhancing algorithm efficiency relative to the symmetric concept is a critical challenge in the field of information security. PSO also becomes trapped into local optima similarly to other nature-inspired algorithms. The literature depicts that in order to solve pre-mature convergence for PSO algorithms, researchers have adopted various parameters such as population initialization and inertia weight that can provide excellent results with respect to real world problems. This study proposed two newly improved variants of PSO termed Threefry with opposition-based PSO ranked inertia weight (ORIW-PSO-TF) and Philox with opposition-based PSO ranked inertia weight (ORIW-PSO-P) (ORIW-PSO-P). In the proposed variants, we incorporated three novel modifications: (1) pseudo-random sequence Threefry and Philox utilization for the initialization of population; (2) increased population diversity opposition-based learning is used; and (3) a novel introduction of opposition-based rank-based inertia weight to amplify the execution of standard PSO for the acceleration of the convergence speed. The proposed variants are examined on sixteen bench mark test functions and compared with conventional approaches. Similarly, statistical tests are also applied on the simulation results in order to obtain an accurate level of significance. Both proposed variants show highest performance on the stated benchmark functions over the standard approaches. In addition to this, the proposed variants ORIW-PSO-P and ORIW-PSO-P have been examined with respect to training of the artificial neural network (ANN). We have performed experiments using fifteen benchmark datasets obtained and applied from the repository of UCI. Simulation results have shown that the training of an ANN with ORIW-PSO-P and ORIW-PSO-P algorithms provides the best results than compared to traditional methodologies. All the observations from our simulations conclude that the proposed ASOA is superior to conventional optimizers. In addition, the results of our study predict how the proposed opposition-based method profoundly impacts diversity and convergence.

Adaptive Inertia Weight Particle Swarm Optimization For Linear and Nonlinear Channel Equalization

2012 ◽  
Vol 3 (4) ◽  
pp. 1-4
Author(s):  
Diana D.C Diana D.C ◽  
◽  
Joy Vasantha Rani.S.P Joy Vasantha Rani.S.P ◽  
Nithya.T.R Nithya.T.R ◽  
Srimukhee.B Srimukhee.B
Keyword(s):  
Particle Swarm Optimization ◽  
Particle Swarm ◽  
Channel Equalization ◽  
Swarm Optimization ◽  
Inertia Weight ◽  
Linear And Nonlinear

scholarly journals Knowledge-guided multiobjective particle swarm optimization with fusion learning strategies

2021 ◽  
Author(s):  
Wei Li ◽  
Xiang Meng ◽  
Ying Huang ◽  
Soroosh Mahmoodi
Keyword(s):  
Particle Swarm Optimization ◽  
Learning Strategies ◽  
Learning Strategy ◽  
Particle Swarm ◽  
Population Diversity ◽  
Selection Strategy ◽  
Rapid Loss ◽  
Solution Quality ◽  
Swarm Optimization ◽  
Multiobjective Particle Swarm Optimization

AbstractMultiobjective particle swarm optimization (MOPSO) algorithm faces the difficulty of prematurity and insufficient diversity due to the selection of inappropriate leaders and inefficient evolution strategies. Therefore, to circumvent the rapid loss of population diversity and premature convergence in MOPSO, this paper proposes a knowledge-guided multiobjective particle swarm optimization using fusion learning strategies (KGMOPSO), in which an improved leadership selection strategy based on knowledge utilization is presented to select the appropriate global leader for improving the convergence ability of the algorithm. Furthermore, the similarity between different individuals is dynamically measured to detect the diversity of the current population, and a diversity-enhanced learning strategy is proposed to prevent the rapid loss of population diversity. Additionally, a maximum and minimum crowding distance strategy is employed to obtain excellent nondominated solutions. The proposed KGMOPSO algorithm is evaluated by comparisons with the existing state-of-the-art multiobjective optimization algorithms on the ZDT and DTLZ test instances. Experimental results illustrate that KGMOPSO is superior to other multiobjective algorithms with regard to solution quality and diversity maintenance.

Self-Adaptive Particle Swarm Optimization Algorithm with Mutation Operation Based on K-Means

2013 ◽  
Vol 760-762 ◽  
pp. 2194-2198 ◽  
Author(s):  
Xue Mei Wang ◽  
Yi Zhuo Guo ◽  
Gui Jun Liu
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Particle Swarm ◽  
Local Optimum ◽  
Swarm Optimization ◽  
Adaptive Particle Swarm Optimization ◽  
Inertia Weight ◽  
Clustering Quality ◽  
Mutation Operation

Adaptive Particle Swarm Optimization algorithm with mutation operation based on K-means is proposed in this paper, this algorithm Combined the local searching optimization ability of K-means with the gobal searching optimization ability of Particle Swarm Optimization, the algorithm self-adaptively adjusted inertia weight according to fitness variance of population. Mutation operation was peocessed for the poor performative particle in population. The results showed that the algorithm had solved the poblems of slow convergence speed of traditional Particle Swarm Optimization algorithm and easy falling into the local optimum of K-Means, and more effectively improved clustering quality.

Improved Particle Swarm Optimization Algorithm and its Application Based on the Aggregation Degree

2013 ◽  
Vol 427-429 ◽  
pp. 1934-1938
Author(s):  
Zhong Rong Zhang ◽  
Jin Peng Liu ◽  
Ke De Fei ◽  
Zhao Shan Niu
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Population Diversity ◽  
Function Optimization ◽  
Local Optimum ◽  
Swarm Optimization ◽  
Improved Particle Swarm Optimization

The aim is to improve the convergence of the algorithm, and increase the population diversity. Adaptively particles of groups fallen into local optimum is adjusted in order to realize global optimal. by judging groups spatial location of concentration and fitness variance. At the same time, the global factors are adjusted dynamically with the action of the current particle fitness. Four typical function optimization problems are drawn into simulation experiment. The results show that the improved particle swarm optimization algorithm is convergent, robust and accurate.

Sign in / Sign up

Export Citation Format

Share Document