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

Metaheuristic design of feedforward neural networks: a review of two decades of research

Over the past two decades, the feedforward neural network (FNN) optimization has been a key interest among the researchers and practitioners of multiple disciplines. The FNN optimization is often viewed from the various perspectives: the optimization of weights, network architecture, activation nodes, learning parameters, learning environment, etc. Researchers adopted such different viewpoints mainly to improve the FNN's generalization ability. The gradient-descent algorithm such as backpropagation has been widely applied to optimize the FNNs. Its success is evident from the FNN's application to numerous real-world problems. However, due to the limitations of the gradient-based optimization methods, the metaheuristic algorithms including the evolutionary algorithms, swarm intelligence, etc., are still being widely explored by the researchers aiming to obtain generalized FNN for a given problem. This article attempts to summarize a broad spectrum of FNN optimization methodologies including conventional and metaheuristic approaches. This article also tries to connect various research directions emerged out of the FNN optimization practices, such as evolving neural network (NN), cooperative coevolution NN, complex-valued NN, deep learning, extreme learning machine, quantum NN, etc. Additionally, it provides interesting research challenges for future research to cope-up with the present information processing era

Data Mining Technology for Structural Control Systems: Concept, Development, and Comparison

Structural control systems are classified into four categories, that is, passive, active, semi-active, and hybrid systems. These systems must be designed in the best way to control harmonic motions imposed to structures. Therefore, a precise powerful computer-based technology is required to increase the damping characteristics of structures. In this direction, data mining has provided numerous solutions to structural damped system problems as an all-inclusive technology due to its computational ability. This chapter provides a broad, yet in-depth, overview in data mining including knowledge view (i.e., concept, functions, and techniques) as well as application view in damped systems, shock absorbers, and harmonic oscillators. To aid the aim, various data mining techniques are classified in three groups, that is, classification-, prediction-, and optimization-based data mining methods, in order to present the development of this technology. According to this categorization, the applications of statistical, machine learning, and artificial intelligence techniques with respect to vibration control system research area are compared. Then, some related examples are detailed in order to indicate the efficiency of data mining algorithms. Last but not least, capabilities and limitations of the most applicable data mining-based methods in structural control systems are presented. To the best of our knowledge, the current research is the first attempt to illustrate the data mining applications in this domain

Enhancement of Metaheuristic Algorithm for Scheduling Workflows in Multi-fog Environments

Whether in computer science, engineering, or economics, optimization lies at the heart of any challenge involving decision-making. Choosing between several options is part of the decision- making process. Our desire to make the "better" decision drives our decision. An objective function or performance index describes the assessment of the alternative's goodness. The theory and methods of optimization are concerned with picking the best option. There are two types of optimization methods: deterministic and stochastic. The first is a traditional approach, which works well for small and linear problems. However, they struggle to address most of the real-world problems, which have a highly dimensional, nonlinear, and complex nature. As an alternative, stochastic optimization algorithms are specifically designed to tackle these types of challenges and are more common nowadays. This study proposed two stochastic, robust swarm-based metaheuristic optimization methods. They are both hybrid algorithms, which are formulated by combining Particle Swarm Optimization and Salp Swarm Optimization algorithms. Further, these algorithms are then applied to an important and thought-provoking problem. The problem is scientific workflow scheduling in multiple fog environments. Many computer environments, such as fog computing, are plagued by security attacks that must be handled. DDoS attacks are effectively harmful to fog computing environments as they occupy the fog's resources and make them busy. Thus, the fog environments would generally have fewer resources available during these types of attacks, and then the scheduling of submitted Internet of Things (IoT) workflows would be affected. Nevertheless, the current systems disregard the impact of DDoS attacks occurring in their scheduling process, causing the amount of workflows that miss deadlines as well as increasing the amount of tasks that are offloaded to the cloud. Hence, this study proposed a hybrid optimization algorithm as a solution for dealing with the workflow scheduling issue in various fog computing locations. The proposed algorithm comprises Salp Swarm Algorithm (SSA) and Particle Swarm Optimization (PSO). In dealing with the effects of DDoS attacks on fog computing locations, two Markov-chain schemes of discrete time types were used, whereby one calculates the average network bandwidth existing in each fog while the other determines the number of virtual machines existing in every fog on average. DDoS attacks are addressed at various levels. The approach predicts the DDoS attack’s influences on fog environments. Based on the simulation results, the proposed method can significantly lessen the amount of offloaded tasks that are transferred to the cloud data centers. It could also decrease the amount of workflows with missed deadlines. Moreover, the significance of green fog computing is growing in fog computing environments, in which the consumption of energy plays an essential role in determining maintenance expenses and carbon dioxide emissions. The implementation of efficient scheduling methods has the potential to mitigate the usage of energy by allocating tasks to the most appropriate resources, considering the energy efficiency of each individual resource. In order to mitigate these challenges, the proposed algorithm integrates the Dynamic Voltage and Frequency Scaling (DVFS) technique, which is commonly employed to enhance the energy efficiency of processors. The experimental findings demonstrate that the utilization of the proposed method, combined with the Dynamic Voltage and Frequency Scaling (DVFS) technique, yields improved outcomes. These benefits encompass a minimization in energy consumption. Consequently, this approach emerges as a more environmentally friendly and sustainable solution for fog computing environments

Revisión de la optimización de Bess en sistemas de potencia

The increasing penetration of Distributed Energy Resources has imposed several challenges in the analysis and operation of power systems, mainly due to the uncertainties in primary resource. In the last decade, implementation of Battery Energy Storage Systems in electric networks has caught the interest in research since the results have shown multiple positive effects when deployed optimally. In this paper, a review in the optimization of battery storage systems in power systems is presented. Firstly, an overview of the context in which battery storage systems are implemented, their operation framework, chemistries and a first glance of optimization is shown. Then, formulations and optimization frameworks are detailed for optimization problems found in recent literature. Next, A review of the optimization techniques implemented or proposed, and a basic explanation of the more recurrent ones is presented. Finally, the results of the review are discussed. It is concluded that optimization problems involving battery storage systems are a trending topic for research, in which a vast quantity of more complex formulations have been proposed for Steady State and Transient Analysis, due to the inclusion of stochasticity, multi-periodicity and multi-objective frameworks. It was found that the use of Metaheuristics is dominant in the analysis of complex, multivariate and multi-objective problems while relaxations, simplifications, linearization, and single objective adaptations have enabled the use of traditional, more efficient, and exact techniques. Hybridization in metaheuristics has been important topic of research that has shown better results in terms of efficiency and solution quality.La creciente penetración de recursos distribuidos ha impuesto desafíos en el análisis y operación de sistemas de potencia, principalmente debido a incertidumbres en los recursos primarios. En la última década, la implementación de sistemas de almacenamiento por baterías en redes eléctricas ha captado el interés en la investigación, ya que los resultados han demostrado efectos positivos cuando se despliegan óptimamente. En este trabajo se presenta una revisión de la optimización de sistemas de almacenamiento por baterías en sistemas de potencia. Pare ello se procedió, primero, a mostrar el contexto en el cual se implementan los sistemas de baterías, su marco de operación, las tecnologías y las bases de optimización. Luego, fueron detallados la formulación y el marco de optimización de algunos de los problemas de optimización encontrados en literatura reciente. Posteriormente se presentó una revisión de las técnicas de optimización implementadas o propuestas recientemente y una explicación básica de las técnicas más recurrentes. Finalmente, se discutieron los resultados de la revisión. Se obtuvo como resultados que los problemas de optimización con sistemas de almacenamiento por baterías son un tema de tendencia para la investigación, en el que se han propuesto diversas formulaciones para el análisis en estado estacionario y transitorio, en problemas multiperiodo que incluyen la estocasticidad y formulaciones multiobjetivo. Adicionalmente, se encontró que el uso de técnicas metaheurísticas es dominante en el análisis de problemas complejos, multivariados y multiobjetivo, mientras que la implementación de relajaciones, simplificaciones, linealizaciones y la adaptación mono-objetivo ha permitido el uso de técnicas más eficientes y exactas. La hibridación de técnicas metaheurísticas ha sido un tema relevante para la investigación que ha mostrado mejorías en los resultados en términos de eficiencia y calidad de las soluciones

Reinforcement learning for power scheduling in a grid-tied pv-battery electric vehicles charging station

Grid-tied renewable energy sources (RES) based electric vehicle (EV) charging stations are an example of a distributed generator behind the meter system (DGBMS) which characterizes most modern power infrastructure. To perform power scheduling in such a DGBMS, stochastic variables such as load profile of the charging station, output profile of the RES and tariff profile of the utility must be considered at every decision step. The stochasticity in this kind of optimization environment makes power scheduling a challenging task that deserves substantial research attention. This dissertation investigates the application of reinforcement learning (RL) techniques in solving the power scheduling problem in a grid-tied PV-powered EV charging station with the incorporation of a battery energy storage system. RL is a reward-motivated optimization technique that was derived from the way animals learn to optimize their behavior in a new environment. Unlike other optimization methods such as numerical and soft computing techniques, RL does not require an accurate model of the optimization environment in order to arrive at an optimal solution. This study developed and evaluated the feasibility of two RL algorithms, namely, an asynchronous Q-learning algorithm and an advantage actor-critic (A2C) algorithm, in performing power scheduling in the EV charging station under static conditions. To assess the performances of the proposed algorithms, the conventional Q-learning and actor-critic algorithm were implemented to compare their global cost convergence and their learning characteristics. First, the power scheduling problem was expressed as a sequential decision-making process. Then an asynchronous Q-learning algorithm was developed to solve it. Further, an advantage actor-critic (A2C) algorithm was developed and was used to solve the power scheduling problem. The two algorithms were tested using a 24-hour load, generation and utility grid tariff profiles under static optimization conditions. The performance of the asynchronous Q-learning algorithm was compared with that of the conventional Q-learning method in terms of the global cost, stability and scalability. Likewise, the A2C was compared with the conventional actor-critic method in terms of stability, scalability and convergence. Simulation results showed that both the developed algorithms (asynchronous Q-learning algorithm and A2C) converged to lower global costs and displayed more stable learning characteristics than their conventional counterparts. This research established that proper restriction of the action-space of a Q-learning algorithm improves its stability and convergence. It was also observed that such a restriction may come with compromise of computational speed and scalability. Of the four algorithms analyzed, the A2C was found to produce a power schedule with the lowest global cost and the best usage of the battery energy storage system

Chemical reaction optimization for task scheduling in grid computing

Grid computing solves high performance and high-throughput computing problems through sharing resources ranging from personal computers to supercomputers distributed around the world. One of the major problems is task scheduling, i.e., allocating tasks to resources. In addition to Makespan and Flowtime, we also take reliability of resources into account, and task scheduling is formulated as an optimization problem with three objectives. This is an NP-hard problem, and thus, metaheuristic approaches are employed to find the optimal solutions. In this paper, several versions of the Chemical Reaction Optimization (CRO) algorithm are proposed for the grid scheduling problem. CRO is a population-based metaheuristic inspired by the interactions between molecules in a chemical reaction. We compare these CRO methods with four other acknowledged metaheuristics on a wide range of instances. Simulation results show that the CRO methods generally perform better than existing methods and performance improvement is especially significant in large-scale applications. © 2011 IEEE.published_or_final_versio

Particle Swarm Optimization

Particle swarm optimization (PSO) is a population based stochastic optimization technique influenced by the social behavior of bird flocking or fish schooling.PSO shares many similarities with evolutionary computation techniques such as Genetic Algorithms (GA). The system is initialized with a population of random solutions and searches for optima by updating generations. However, unlike GA, PSO has no evolution operators such as crossover and mutation. In PSO, the potential solutions, called particles, fly through the problem space by following the current optimum particles. This book represents the contributions of the top researchers in this field and will serve as a valuable tool for professionals in this interdisciplinary field