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

Cúmulo de partículas coevolutivo cooperativo usando lógica borrosa para la optimización a gran escala

A cooperative coevolutionary framework can improve the performance of optimization algorithms on large-scale problems. In this paper, we propose a new Cooperative Coevolutionary algorithm to improve our preliminary work, FuzzyPSO2. This new proposal, called CCFPSO, uses the random grouping technique that changes the size of the subcomponents in each generation. Unlike FuzzyPSO2, CCFPSO’s re-initialization of the variables, suggested by the fuzzy system, were performed on the particles with the worst fitness values. In addition, instead of updating the particles based on the global best particle, CCFPSO was updated considering the personal best particle and the neighborhood best particle. This proposal was tested on large-scale problems that resemble real-world problems (CEC2008, CEC2010), where the performance of CCFPSO was favorable in comparison with other state-of-the-art PSO versions, namely CCPSO2, SLPSO, and CSO. The experimental results indicate that using a Cooperative Coevolutionary PSO approach with a fuzzy logic system can improve results on high dimensionality problems (100 to 1000 variables).Un marco coevolutivo cooperativo puede mejorar el rendimiento de los algoritmos de optimización en problemas a gran escala. En este trabajo, proponemos un nuevo algoritmo coevolutivo cooperativo para mejorar nuestro trabajo preliminar, FuzzyPSO2. Esta nueva propuesta, denominada CCFPSO, utiliza la técnica de agrupación aleatoria que cambia el tamaño de los subcomponentes en cada generación. A diferencia de FuzzyPSO2, la reinicialización de las variables de CCFPSO, sugerida por el sistema difuso, se realizaron sobre las partículas con los peores valores de fitness. Además, en lugar de actualizar las partículas basándose en la mejor partícula global, CCFPSO se actualizó considerando la mejor partícula personal y la mejor partícula del vecindario. Esta propuesta se probó en problemas a gran escala que se asemejan a los del mundo real (CEC2008, CEC2010), donde el rendimiento de CCFPSO fue favorable en comparación con otras versiones de PSO del estado del arte, a saber, CCPSO2, SLPSO y CSO. Los resultados experimentales indican que el uso de un enfoque PSO coevolutivo cooperativo con un sistema de lógica difusa puede mejorar los resultados en problemas de alta dimensionalidad (de 100 a 1000 variables).Facultad de Informátic

Hybrid Intelligent Optimization Methods for Engineering Problems

The purpose of optimization is to obtain the best solution under certain conditions. There are numerous optimization methods because different problems need different solution methodologies; therefore, it is difficult to construct patterns. Also mathematical modeling of a natural phenomenon is almost based on differentials. Differential equations are constructed with relative increments among the factors related to yield. Therefore, the gradients of these increments are essential to search the yield space. However, the landscape of yield is not a simple one and mostly multi-modal. Another issue is differentiability. Engineering design problems are usually nonlinear and they sometimes exhibit discontinuous derivatives for the objective and constraint functions. Due to these difficulties, non-gradient-based algorithms have become more popular in recent decades. Genetic algorithms (GA) and particle swarm optimization (PSO) algorithms are popular, non-gradient based algorithms. Both are population-based search algorithms and have multiple points for initiation. A significant difference from a gradient-based method is the nature of the search methodologies. For example, randomness is essential for the search in GA or PSO. Hence, they are also called stochastic optimization methods. These algorithms are simple, robust, and have high fidelity. However, they suffer from similar defects, such as, premature convergence, less accuracy, or large computational time. The premature convergence is sometimes inevitable due to the lack of diversity. As the generations of particles or individuals in the population evolve, they may lose their diversity and become similar to each other. To overcome this issue, we studied the diversity concept in GA and PSO algorithms. Diversity is essential for a healthy search, and mutations are the basic operators to provide the necessary variety within a population. After having a close scrutiny of the diversity concept based on qualification and quantification studies, we improved new mutation strategies and operators to provide beneficial diversity within the population. We called this new approach as multi-frequency vibrational GA or PSO. They were applied to different aeronautical engineering problems in order to study the efficiency of these new approaches. These implementations were: applications to selected benchmark test functions, inverse design of two-dimensional (2D) airfoil in subsonic flow, optimization of 2D airfoil in transonic flow, path planning problems of autonomous unmanned aerial vehicle (UAV) over a 3D terrain environment, 3D radar cross section minimization problem for a 3D air vehicle, and active flow control over a 2D airfoil. As demonstrated by these test cases, we observed that new algorithms outperform the current popular algorithms. The principal role of this multi-frequency approach was to determine which individuals or particles should be mutated, when they should be mutated, and which ones should be merged into the population. The new mutation operators, when combined with a mutation strategy and an artificial intelligent method, such as, neural networks or fuzzy logic process, they provided local and global diversities during the reproduction phases of the generations. Additionally, the new approach also introduced random and controlled diversity. Due to still being population-based techniques, these methods were as robust as the plain GA or PSO algorithms. Based on the results obtained, it was concluded that the variants of the present multi-frequency vibrational GA and PSO were efficient algorithms, since they successfully avoided all local optima within relatively short optimization cycles

Multi particle swarm optimisation algorithm applied to supervisory power control systems

This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University LondonPower quality problems come in numerous forms (commonly spikes, surges, sags, outages and harmonics) and their resolution can cost from a few hundred to millions of pounds, depending on the size and type of problem experienced by the power network. They are commonly experienced as burnt-out motors, corrupt data on hard drives, unnecessary downtime and increased maintenance costs. In order to minimise such events, the network can be monitored and controlled with a specific control regime to deal with particular faults. This study developed a control and Optimisation system and applied it to the stability of electrical power networks using artificial intelligence techniques. An intelligent controller was designed to control and optimise simulated models for electrical system power stability. Fuzzy logic controller controlled the power generation, while particle swarm Optimisation (PSO) techniques optimised the system’s power quality in normal operation conditions and after faults. Different types of PSO were tested, then a multi-swarm (M-PSO) system was developed to give better Optimisation results in terms of accuracy and convergence speed.. The developed Optimisation algorithm was tested on seven benchmarks and compared to the other types of single PSOs. The developed controller and Optimisation algorithm was applied to power system stability control. Two power electrical network models were used (with two and four generators), controlled by fuzzy logic controllers tuned using the Optimisation algorithm. The system selected the optimal controller parameters automatically for normal and fault conditions during the operation of the power network. Multi objective cost function was used based on minimising the recovery time, overshoot, and steady state error. A supervisory control layer was introduced to detect and diagnose faults then apply the correct controller parameters. Different fault scenarios were used to test the system performance. The results indicate the great potential of the proposed power system stabiliser as a superior tool compared to conventional control systems

The SOS Platform: Designing, Tuning and Statistically Benchmarking Optimisation Algorithms

open access articleWe present Stochastic Optimisation Software (SOS), a Java platform facilitating the algorithmic design process and the evaluation of metaheuristic optimisation algorithms. SOS reduces the burden of coding miscellaneous methods for dealing with several bothersome and time-demanding tasks such as parameter tuning, implementation of comparison algorithms and testbed problems, collecting and processing data to display results, measuring algorithmic overhead, etc. SOS provides numerous off-the-shelf methods including: (1) customised implementations of statistical tests, such as the Wilcoxon rank-sum test and the Holm–Bonferroni procedure, for comparing the performances of optimisation algorithms and automatically generating result tables in PDF and formats; (2) the implementation of an original advanced statistical routine for accurately comparing couples of stochastic optimisation algorithms; (3) the implementation of a novel testbed suite for continuous optimisation, derived from the IEEE CEC 2014 benchmark, allowing for controlled activation of the rotation on each testbed function. Moreover, we briefly comment on the current state of the literature in stochastic optimisation and highlight similarities shared by modern metaheuristics inspired by nature. We argue that the vast majority of these algorithms are simply a reformulation of the same methods and that metaheuristics for optimisation should be simply treated as stochastic processes with less emphasis on the inspiring metaphor behind them

Research on UBI auto insurance pricing model based on parameter adaptive SAPSO optimal fuzzy controller

Aiming at the problem of “dynamic” accurate determination of rates in UBI auto insurance pricing, this paper proposes a UBI auto insurance pricing model based on fuzzy controller and optimizes it with a parameter adaptive SASPO. On the basis of the SASPO algorithm, the movement direction of the particles can be mutated and the direction can be dynamically controlled, the inertia weight value is given by the distance between the particle and the global optimal particle, and the learning factor is calculated according to the change of the fitness value, which realizes the parameter in the running process. Effective self-adjustment. A five-dimensional fuzzy controller is constructed by selecting the monthly driving mileage, the number of violations, and the driving time at night in the UBI auto insurance data. The weights are used to form fuzzy rules, and a variety of algorithms are used to optimize the membership function and fuzzy rules and compare them. The research results show that, compared with other algorithms, the parameter adaptive SAPAO algorithm can calculate more reasonable, accurate and high-quality fuzzy rules and membership functions when processing UBI auto insurance data. The accuracy and robustness of UBI auto insurance rate determination can realize dynamic and accurate determination of UBI auto insurance rates

Global solar irradiation prediction using a multi-gene genetic programming approach

This is the author accepted manuscript. The final version is available from AIP Publishing via the DOI in this record.In this paper, a nonlinear symbolic regression technique using an evolutionary algorithm known as multi-gene genetic programming (MGGP) is applied for a data-driven modelling between the dependent and the independent variables. The technique is applied for modelling the measured global solar irradiation and validated through numerical simulations. The proposed modelling technique shows improved results over the fuzzy logic and artificial neural network (ANN) based approaches as attempted by contemporary researchers. The method proposed here results in nonlinear analytical expressions, unlike those with neural networks which is essentially a black box modelling approach. This additional flexibility is an advantage from the modelling perspective and helps to discern the important variables which affect the prediction. Due to the evolutionary nature of the algorithm, it is able to get out of local minima and converge to a global optimum unlike the back-propagation (BP) algorithm used for training neural networks. This results in a better percentage fit than the ones obtained using neural networks by contemporary researchers. Also a hold-out cross validation is done on the obtained genetic programming (GP) results which show that the results generalize well to new data and do not over-fit the training samples. The multi-gene GP results are compared with those, obtained using its single-gene version and also the same with four classical regression models in order to show the effectiveness of the adopted approach