A Comprehensive Survey on Particle Swarm Optimization Algorithm and Its Applications

Particle swarm optimization (PSO) is a heuristic global optimization method, proposed originally by Kennedy and Eberhart in 1995. It is now one of the most commonly used optimization techniques. This survey presented a comprehensive investigation of PSO. On one hand, we provided advances with PSO, including its modifications (including quantum-behaved PSO, bare-bones PSO, chaotic PSO, and fuzzy PSO), population topology (as fully connected, von Neumann, ring, star, random, etc.), hybridization (with genetic algorithm, simulated annealing, Tabu search, artificial immune system, ant colony algorithm, artificial bee colony, differential evolution, harmonic search, and biogeography-based optimization), extensions (to multiobjective, constrained, discrete, and binary optimization), theoretical analysis (parameter selection and tuning, and convergence analysis), and parallel implementation (in multicore, multiprocessor, GPU, and cloud computing forms). On the other hand, we offered a survey on applications of PSO to the following eight fields: electrical and electronic engineering, automation control systems, communication theory, operations research, mechanical engineering, fuel and energy, medicine, chemistry, and biology. It is hoped that this survey would be beneficial for the researchers studying PSO algorithms

Genetic learning particle swarm optimization

Social learning in particle swarm optimization (PSO) helps collective efficiency, whereas individual reproduction in genetic algorithm (GA) facilitates global effectiveness. This observation recently leads to hybridizing PSO with GA for performance enhancement. However, existing work uses a mechanistic parallel superposition and research has shown that construction of superior exemplars in PSO is more effective. Hence, this paper first develops a new framework so as to organically hybridize PSO with another optimization technique for “learning.” This leads to a generalized “learning PSO” paradigm, the *L-PSO. The paradigm is composed of two cascading layers, the first for exemplar generation and the second for particle updates as per a normal PSO algorithm. Using genetic evolution to breed promising exemplars for PSO, a specific novel *L-PSO algorithm is proposed in the paper, termed genetic learning PSO (GL-PSO). In particular, genetic operators are used to generate exemplars from which particles learn and, in turn, historical search information of particles provides guidance to the evolution of the exemplars. By performing crossover, mutation, and selection on the historical information of particles, the constructed exemplars are not only well diversified, but also high qualified. Under such guidance, the global search ability and search efficiency of PSO are both enhanced. The proposed GL-PSO is tested on 42 benchmark functions widely adopted in the literature. Experimental results verify the effectiveness, efficiency, robustness, and scalability of the GL-PSO

PSO algorithm-based robust design of PID controller for variable time-delay systems: AQM application

This paper formulates a robust control for variable time-delay system models. An automatic tuning method for PID-type controller is proposed. The adopted method integrates robust control design using Quantitative Feedback Theory (QFT) with Particle Swan Optimization heuristic algorithms (PSO) to systematize the loop-shaping stage. The objective of the design method is to reach a good compromise among robust stability, robust tracking and disturbance rejection with minimal control effort. The resulting algorithm has attractive features, such as easy implementation, stable convergence characteristic and good computational efficiency. In particular, the results of the control design for active queue management (AQM) systems are presented. Simulations show improved congestion control and quality of service in TCP communication networks.Facultad de Informátic

3D Formation Control in Multi-Robot Teams Using Artificial Potential Fields

Multi-robot teams find applications in emergency response, search and rescue operations, convoy support and many more. Teams of autonomous aerial vehicles can also be used to protect a cargo of airplanes by surrounding them in some geometric shape. This research develops a control algorithm to attract UAVs to one or a set of bounded geometric shapes while avoiding collisions, re-configuring in the event of departure or addition of UAVs and maneuvering in mission space while retaining the configuration. Using potential field theory, weighted vector fields are described to attract UAVs to a desired formation. In order to achieve this, three vector fields are defined: one attracts UAVs located outside the formation towards bounded geometric shape; one pushes them away from the center towards the desired region and the third controls collision avoidance and dispersion of UAVs within the formation. The result is a control algorithm that is theoretically justified and verified using MATLAB which generates velocity vectors to attract UAVs to a loose formation and maneuver in the mission space while remaining in formation. This approach efficiently scales to different team sizes

Deployment of an agent-based SANET architecture for healthcare services

This paper describes the adaptation of a computational technique utilizing Extended Kohonen Maps (EKMs) and Rao-Blackwell-Kolmogorov (R-B) Filtering mechanisms for the administration of Sensor-Actuator networks (SANETs). Inspired by the BDI (Belief-Desire-Intention) Agent model from Rao and Georgeff, EKMs perform the quantitative analysis of an algorithmic artificial neural network process by using an indirect-mapping EKM to self-organize, while the Rao-Blackwell filtering mechanism reduces the external noise and interference in the problem set introduced through the self-organization process. Initial results demonstrate that a combinatorial approach to optimization with EKMs and Rao-Blackwell filtering provides an improvement in event trajectory approximation in comparison to standalone cooperative EKM processes to allow responsive event detection and optimization in patient healthcare

On the Dynamics of Boolean Gene Regulatory Networks with Stochasticity

Genes are responsible for producing proteins that are essential to the construction of complex biological systems. The mechanisms by which this production is regulated have long been the center of wide spread research efforts. Deterministic Boolean gene regulatory models have been a particularly effective avenue of research in this field. However these models fall short of accounting for variations in the gene functionality due to the uncertain internal or external environmental conditions. One of the recent attempts to overcome this weakness is by (Murrugarra, 2012), in which a probabilistic component is introduced as the fixed activation/degradation propensities at the cellular level. This approach still falls short of accounting for cell-to-cell variability as well as the variability at the molecular level. With this study we introduce an additional stochastic element by modeling the activation/degradation propensities using statistical distributions. This in turn allows us to quantify the variability of the different connections within the dynamical system formed by the gene activation/degradation behavior. Finally we present a converse method of determining the most likely propensity set for a given stochastic gene regulatory network

Evolutionary Computation

This book presents several recent advances on Evolutionary Computation, specially evolution-based optimization methods and hybrid algorithms for several applications, from optimization and learning to pattern recognition and bioinformatics. This book also presents new algorithms based on several analogies and metafores, where one of them is based on philosophy, specifically on the philosophy of praxis and dialectics. In this book it is also presented interesting applications on bioinformatics, specially the use of particle swarms to discover gene expression patterns in DNA microarrays. Therefore, this book features representative work on the field of evolutionary computation and applied sciences. The intended audience is graduate, undergraduate, researchers, and anyone who wishes to become familiar with the latest research work on this field