Modified Particle Swarm Optimization with Unique Self-cognitive Learning for Global Optimization Problems

Author(s):  
Koon Meng Ang ◽  
Wei Hong Lim ◽  
Nor Ashidi Mat Isa ◽  
Sew Sun Tiang ◽  
Chun Kit Ang ◽  
...  
2013 ◽  
Vol 373-375 ◽  
pp. 1131-1134
Author(s):  
Wei Yi Qian ◽  
Guang Lei Liu

We propose a modified particle swarm optimization (PSO) algorithm named SPSO for the global optimization problems. In SPSO, we introduce the crossover operator in order to increase the diversity of the swarm. The crossover operator is contracted by forming a simplex. The crossover operator is used if the diversity of the swarm is below a threshold (denoted hlow) and continues until the diversity reaches the required value (hhigh). The six test problems are used for numerical study. Numerical results indicate that the proposed algorithm is better than some existing PSO.


Mekatronika ◽  
2021 ◽  
Vol 3 (1) ◽  
pp. 35-43
Author(s):  
K. M. Ang ◽  
Z. S. Yeap ◽  
C. E. Chow ◽  
W. Cheng ◽  
W. H. Lim

Different variants of particle swarm optimization (PSO) algorithms were introduced in recent years with various improvements to tackle different types of optimization problems more robustly. However, the conventional initialization scheme tends to generate an initial population with relatively inferior solution due to the random guess mechanism. In this paper, a PSO variant known as modified PSO with chaotic initialization scheme is introduced to solve unconstrained global optimization problems more effectively, by generating a more promising initial population. Experimental studies are conducted to assess and compare the optimization performance of the proposed algorithm with four existing well-establised PSO variants using seven test functions. The proposed algorithm is observed to outperform its competitors in solving the selected test problems.


2013 ◽  
Vol 2013 ◽  
pp. 1-12 ◽  
Author(s):  
Martins Akugbe Arasomwan ◽  
Aderemi Oluyinka Adewumi

Linear decreasing inertia weight (LDIW) strategy was introduced to improve on the performance of the original particle swarm optimization (PSO). However, linear decreasing inertia weight PSO (LDIW-PSO) algorithm is known to have the shortcoming of premature convergence in solving complex (multipeak) optimization problems due to lack of enough momentum for particles to do exploitation as the algorithm approaches its terminal point. Researchers have tried to address this shortcoming by modifying LDIW-PSO or proposing new PSO variants. Some of these variants have been claimed to outperform LDIW-PSO. The major goal of this paper is to experimentally establish the fact that LDIW-PSO is very much efficient if its parameters are properly set. First, an experiment was conducted to acquire a percentage value of the search space limits to compute the particle velocity limits in LDIW-PSO based on commonly used benchmark global optimization problems. Second, using the experimentally obtained values, five well-known benchmark optimization problems were used to show the outstanding performance of LDIW-PSO over some of its competitors which have in the past claimed superiority over it. Two other recent PSO variants with different inertia weight strategies were also compared with LDIW-PSO with the latter outperforming both in the simulation experiments conducted.


2011 ◽  
Vol 181-182 ◽  
pp. 937-942
Author(s):  
Bo Liu ◽  
Hong Xia Pan

Particle swarm optimization (PSO) is widely used to solve complex optimization problems. However, classical PSO may be trapped in local optima and fails to converge to global optimum. In this paper, the concept of the self particles and the random particles is introduced into classical PSO to keep the particle diversity. All particles are divided into the standard particles, the self particles and the random particles according to special proportion. The feature of the proposed algorithm is analyzed and several testing functions are performed in simulation study. Experimental results show that, the proposed PDPSO algorithm can escape from local minima and significantly enhance the convergence precision.


Sign in / Sign up

Export Citation Format

Share Document