Two important topics in Particle Swarm Optimization (PSO) research filed are trajectory analysis of particles and parameter selection method. Trajectory analysis is important because it can help to determine where the position of each particle is at each evolutionary step, and consequently it can help to clarify the running mechanism of PSO algorithm, so as to explain why and when PSO algorithm...

A grid computing system consists of a group of programs and resources that are spread across machines in the grid. A grid system has a dynamic environment and decentralized distributed resources, so it is important to provide efficient scheduling for applications. Task scheduling is an NP-hard problem and deterministic algorithms are inadequate and heuristic algorithms such as particle swarm op...

In order to improve the convergence speed and the drawback of easily converging to the local optimum of the standard particle swarm optimization (PSO), two improved PSO algorithms are presented based on the simple particle swarm optimization algorithm without speed attribute. One is introducing differential mutation technology of differential evolution algorithm into the simple PSO algorithm fo...

In order to overcome the shortcomings of traditional clustering algorithms such as local optima and sensitivity to initialization, a new Optimization technique, Particle Swarm Optimization is used in association with Unsupervised Clustering techniques in this paper. This new algorithm uses the capacity of global search in PSO algorithm and solves the problems associated with traditional cluster...

Structure learning is a very important problem in the field of Bayesian networks (BNs). It is also an active research area for more than two decades; therefore, many approaches have been proposed in order to find an optimal structure based on training samples. In this paper, a Particle Swarm Optimization (PSO)-based algorithm is proposed to solve the BN structure learning problem; named BNC-PSO...

The traveling salesman problem (TSP) is one of the most widely studied NP-hard combinatorial optimization problems and traditional genetic algorithm trapped into the local minimum easily for solving this problem. Particle Swarm Optimization (PSO) algorithm was developed under the inspiration of behavior laws of bird flocks, fish schools and human communities. Compared with the genetic algorithm...

Particle Swarm Optimization algorithm (PSO) is a popular stochastic searching optimization algorithm to solve complicated optimization problems. The approach of retrieving duct parameters from the sea-surface reflected radar clutter is also known as Refractivity From Clutter (RFC) technique. RFC technique provides the near-real-time duct parameters to evaluate the radio system performance, with...

Abstract: Constraint handling is one of the most difficult parts encountered in practical engineering design optimizations. Different kinds of methods were proposed for handling constraints namely, genetic algorithm, self-adaptive penalty approach and other evolutionary algorithms. Particle Swarm Optimization (PSO) efficiently solved most nonlinear optimization problems with inequity constraint...

Recently, the use of the particle swarm optimization (PSO) technique for the reconstruction of microwave images has received increasing interest from the optimization community due to its simplicity in implementation and its inexpensive computational overhead. However, the basic PSO algorithm is easily trapping into local minimum and may lead to the premature convergence. When a local optimal s...

This paper presented a hybrid optimal estimation algorithm for solving multi-level thresholding problems in image segmentation. The distribution of image intensity is modeled as a random variable, which is approximated by a mixture Gaussian model. The Gaussian’s parameter estimates are iteratively computed by using the proposed PSO + EM algorithm, which consists of two main components: (i) glob...