Absfmct-This paper presents a new approach to economic load dispatch (ELD) problems with non-smwth objective functions using a particle swarm optimization (PSO). In practice, ELD problems have non-smooth objective functions with equality and inequality constraints that make it difficult to find the global optimum using any mathematical approaches. In this paper, a new PSO framework is suggested...

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...

In this appendix we show that 1 2 ∆ F (θ)∆ is a second order Taylor approximation of D KL (p(θ)p(θ + ∆)). First, let g q (θ) :=D KL (qp(θ)) = ω∈Ω q(ω) ln q(ω) p(ω|θ). We begin by deriving equations for the Jacobian and Hessian of g q at θ: ∂g q (θ) ∂θ = ω∈Ω q(ω) p(ω|θ) q(ω) ∂ ∂θ q(ω) p(ω|θ) = ω∈Ω q(ω) p(ω|θ) q(ω) −q(ω) ∂p(ω|θ) ∂θ p(ω|θ) 2 = ω∈Ω − q(ω) p(ω|θ) ∂p(ω|θ) ∂θ , (4) and so: ∂ 2 g q (θ)...

This paper presents a modification of the particle swarm optimization algorithm (PSO) intended to combat the problem of premature convergence observed in many applications of PSO. The proposed new algorithm moves particles towards nearby particles of higher fitness, instead of attracting each particle towards just the best position discovered so far by any particle. This is accomplished by usin...

In this study, an improved gbest-PSO is proposed to overcome the shortcoming of earlier convergence of classical gbest-PSO. Then the improved gbest-PSO is used to identify the unknown inlet temperature profile in a plate channel flow. The effects of measurement position and measurement error on the accuracy of prediction are studied thoroughly. Analysis of computational results of two test prob...

Particle Swarm Optimizer (PSO) is such a complex stochastic process so that analysis on the stochastic behavior of the PSO is not easy. The choosing of parameters plays an important role since it is critical in the performance of PSO. As far as our investigation is concerned, most of the relevant researches are based on computer simulations and few of them are based on theoretical approach. In ...

The Particle Swarm Optimization (PSO) Algorithm is one of swarm intelligence optimization algorithms. Usually the population’s values of PSO algorithm are random which leads to random distribution of search quality and search velocity. This paper presents PSO based on uniform design (UD). UD is widely used in various applications and introduced to generate an initial population, in which the po...

In this paper an extensive theoretical and empirical analysis of recently introduced Particle Swarm Optimization algorithm with Convergence Related parameters (CR-PSO) is presented. The convergence of the classical PSO algorithm is addressed in detail. The conditions that should be imposed on parameters of the algorithm in order for it to converge in mean-square have been derived. The practical...

The popular fuzzy c-means algorithm (FCM) converges to a local minimum of the objective function. Hence, different initializations may lead to different results. The important issue is how to avoid getting a bad local minimum value to improve the cluster accuracy. The particle swarm optimization (PSO) is a popular and robust strategy for optimization problems. But the main difficulty in applyin...

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...