scispace - formally typeset
Open AccessJournal Article

A Parallel Particle Swarm Optimization Algorithm with Communication Strategies

TLDR
A parallel version of the particle swarm optimization (PPSO) algorithm together with three communication strategies which can be used according to the independence of the data, which demonstrates the usefulness of the proposed PPSO algorithm.
Abstract
Particle swarm optimization (PSO) is an alternative population-based evolutionary computation technique. It has been shown to be capable of optimizing hard mathematical problems in continuous or binary space. We present here a parallel version of the particle swarm optimization (PPSO) algorithm together with three communication strategies which can be used according to the independence of the data. The first strategy is designed for solution parameters that are independent or are only loosely correlated, such as the Rosenbrock and Rastrigrin functions. The second communication strategy can be applied to parameters that are more strongly correlated such as the Griewank function. In cases where the properties of the parameters are unknown, a third hybrid communication strategy can be used. Experimental results demonstrate the usefulness of the proposed PPSO algorithm.

read more

Citations
More filters
Proceedings ArticleDOI

Studies on migration strategies of multiple population parallel particle swarm optimization

TL;DR: 8 migration strategies for multipopulation PPSO are proposed and it is found that both strategies BW and BWM are more efficient for high dimensionality problem, while on low dimensionality functions One-To-Migrate strategies are more effective.
Book ChapterDOI

Distributed Particle Swarm Optimization for Limited Time Adaptation in Autonomous Robots

TL;DR: This paper analyzes the role of the four algorithmic parameters that determine the total evaluation time in a distributed implementation of a Particle Swarm Optimization algorithm and proposes some guidelines for choosing these parameters for real robot implementations.
Journal ArticleDOI

Improved Binary Symbiotic Organism Search Algorithm With Transfer Functions for Feature Selection

TL;DR: In this article, the authors proposed an improved BSOS (IBSOS) algorithm to improve the limitations of the original BSOS algorithm, which can only take values of 0 and 1, that still need to be solved.
Proceedings ArticleDOI

T-S Fuzzy Control of Magnetic Levitation Systems Using QEA

TL;DR: The design of T-S fuzzy control for magnetic levitation systems is proposed and the stability of the system is guaranteed by linear matrix inequalities (LMI) from Lyapunov approach.
References
More filters
Book

Genetic algorithms in search, optimization, and machine learning

TL;DR: In this article, the authors present the computer techniques, mathematical tools, and research results that will enable both students and practitioners to apply genetic algorithms to problems in many fields, including computer programming and mathematics.
Proceedings ArticleDOI

Particle swarm optimization

TL;DR: A concept for the optimization of nonlinear functions using particle swarm methodology is introduced, and the evolution of several paradigms is outlined, and an implementation of one of the paradigm is discussed.
Proceedings ArticleDOI

A new optimizer using particle swarm theory

TL;DR: The optimization of nonlinear functions using particle swarm methodology is described and implementations of two paradigms are discussed and compared, including a recently developed locally oriented paradigm.
Proceedings ArticleDOI

A modified particle swarm optimizer

TL;DR: A new parameter, called inertia weight, is introduced into the original particle swarm optimizer, which resembles a school of flying birds since it adjusts its flying according to its own flying experience and its companions' flying experience.
Journal ArticleDOI

The particle swarm - explosion, stability, and convergence in a multidimensional complex space

TL;DR: This paper analyzes a particle's trajectory as it moves in discrete time, then progresses to the view of it in continuous time, leading to a generalized model of the algorithm, containing a set of coefficients to control the system's convergence tendencies.