Unsupervised fuzzy clustering algorithms are one of many approaches used in image segmentation. The Fuzzy C-means algorithm (FCM) and the Possibilistic C-means algorithm (PCA) have been widely used. There is also the generalized possibilistic algorithm (GPCA). GPCA was proposed recently and is a general form of the previous algorithms. These clustering algorithms can be trapped to the local opt...

The reactive power planning and dispatch problems have been solved using Genetic algorithm (GA), Differential evolution (DE) and Particle Swarm Optimization (PSO) technique in order to have a comparative study on the performance of these algorithms. It has been found that Differential evolution performs best followed by the Particle swarm optimization. Both DE and PSO can perform well even with...

Quantum-behaved particle swarm optimization (QPSO) algorithm is a variant of the traditional particle swarm optimization (PSO). The QPSO that was originally developed for continuous search spaces outperforms the traditional PSO in search ability. This paper analyzes the main factors that impact the search ability of QPSO and converts the particle movement formula to the mutation condition by in...

This paper reviews recent studies on the Particle Swarm Optimization (PSO) algorithm. The review has been focused on high impact recent articles that have analyzed and/or modified PSO algorithms. This paper also presents some potential areas for future study.

Particle swarm optimization (PSO) method is relatively a new population-based intelligence algorithm and exhibits good performance in optimization problems. However, during the optimization process, the particles become more and more similar, and gather into the neighborhood of the best particle in the swarm, which makes the swarm prematurely converged possibly around the local solution. PSO te...

Genetic Algorithm (GA), Ant Colony Optimization (ACO) algorithm and Particle Swarm Optimization (PSO) are proposed for feature selection, and their performance is compared. The Spatial Gray Level Dependence Method (SGLDM) is used for feature extraction. The selected features are fed to a three-layer Backpropagation Network hybrid with Ant Colony Optimization and Particle Swarm Optimization (BPN...

Multilevel thresholding is one of the most popular image segmentation techniques. This paper presents a new multilevel maximum entropy thresholding method based on modified seeker optimization (MSO) algorithm. In the proposed method the thresholding problem is treated as an optimization problem and solved by using the MSO metaheuristics. Particle swarm optimization (PSO) algorithm is also imple...

Particle swarm optimization (PSO) has shown to be a robust and efficient optimization algorithm therefore PSO has received increased attention in many research fields. This paper demonstrates the feasibility of applying the Dynamic Inertia Weight Particle Swarm Optimization to solve a Non-Polynomial (NP) Complete puzzle. This paper presents a new approach to solve the Nonograms Puzzle using Dyn...

This study deals with performance-based design optimization (PBDO) of steel moment frames employing four different metaheuristics consisting of genetic algorithm (GA), ant colony optimization (ACO), harmony search (HS), and particle swarm optimization (PSO). In order to evaluate the seismic capacity of the structures, nonlinear pushover analysis is conducted (PBDO). This method is an iterative ...

Graph coloring problem (GCP) is one of the most studied combinatorial optimization problems. It is important in theory and practice. There have been many algorithms for graph coloring problem, including exact algorithms and (meta-)heuristic algorithms. In this paper, we attempt another meta-heuristic method⎯particle swarm optimization to graph coloring problem. Particle swarm optimization (PSO)...