PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
January 1, 2013Procedia Engineering202 citationsOpen Access

An Overview of Particle Swarm Optimization Variants

View Full Paper
MIMuhammad ImranRHRathiah HashimNKNoor Elaiza Abd Khalid

Key Points

Key points are not available for this paper at this time.

Abstract

Particle swarm optimization (PSO) is a stochastic algorithm used for the optimization problems proposed by Kennedy 1 in 1995. It is a very good technique for the optimization problems. But still there is a drawback in the PSO is that it stuck in the local minima. To improve the performance of PSO, the researchers proposed the different variants of PSO. Some researchers try to improve it by improving initialization of the swarm. Some of them introduce the new parameters like constriction coefficient and inertia weight. Some researchers define the different method of inertia weight to improve the performance of PSO. Some researchers work on the global and local best particles by introducing the mutation operators in the PSO. In this paper, we will see the different variants of PSO with respect to initialization, inertia weight and mutation operators.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Imran et al. (2013) studied this question.

synapsesocial.com/papers/6a07ff3cf1d046f829736083https://doi.org/10.1016/j.proeng.2013.02.063
Ask AI
Helpful
Bookmark
Share
View Full Paper

Also Consider

Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1Particle swarm optimization2002 · 48,533 citations
  2. 2Clustering Categorical Data Using Silhouette Coefficient as a Relocating Measure2007 · 249 citations