37 research outputs found
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
An analysis of the inertia weight parameter for binary particle swarm optimization
In particle swarm optimization, the inertia weight is an important parameter for controlling its search capability. There have been intensive studies of the inertia weight in continuous optimization, but little attention has been paid to the binary case. This study comprehensively investigates the effect of the inertia weight on the performance of binary particle swarm optimization, from both theoretical and empirical perspectives. A mathematical model is proposed to analyze the behavior of binary particle swarm optimization, based on which several lemmas and theorems on the effect of the inertia weight are derived. Our research findings suggest that in the binary case, a smaller inertia weight enhances the exploration capability while a larger inertia weight encourages exploitation. Consequently, this paper proposes a new adaptive inertia weight scheme for binary particle swarm optimization. This scheme allows the search process to start first with exploration and gradually move towards exploitation by linearly increasing the inertia weight. The experimental results on 0/1 knapsack problems show that the binary particle swarm optimization with the new increasing inertia weight scheme performs significantly better than that with the conventional decreasing and constant inertia weight schemes. This study verifies the efficacy of increasing inertia weight in binary particle swarm optimization
Verification Method for Area Optimization of Mixed - Polarity Reed - Muller Logic Circuits
Area minimization of mixed-polarity Reed-Muller (MPRM) logic circuits is an important step in logic synthesis. While previous studies are mainly based on various artificial intelligence algorithms and not comparable with the results from the mainstream electronics design automation (EDA) tool. Furthermore, it is hard to verify the superiority of intelligence algorithms to the EDA tool on area optimization. To address these problems, a multi-step novel verification method was proposed. First, a hybrid simulated annealing (SA) and discrete particle swarm optimization (DPSO) approach (SADPSO) was applied to optimize the area of the MPRM logic circuit. Second, a Design Compiler (DC) algorithm was used to optimize the area of the same MPRM logic circuit under certain settings and constraints. Finally, the area optimization results of the two algorithms were compared based on MCNC benchmark circuits. Results demonstrate that the SADPSO algorithm outperforms the DC algorithm in the area optimization for MPRM logic circuits. The SADPSO algorithm saves approximately 9.1% equivalent logic gates compared with the DC algorithm. Our proposed verification method illustrates the efficacy of the intelligence algorithm in area optimization compared with DC algorithm. Conclusions in this study provide guidance for the improvement of EDA tools in relation to the area optimization of combinational logic circuits
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
Design Simulation and Performance Analysis of Soft Computing Based Islanding Detection System
In recent years, worldwide energy demand has been exaggerated. In addition the lack of adequate transmission capacity, exaggerated transmission and distribution misfortunes and the release of power advertising have been turned into an inspirational power driving the concept, Distributed Generators (DGs). Dispersed age unit (DG) slash hack expansion and mainly regional units linked to distribution to power the system yet to be hundreds of locals[1]. Distributed generation (DG) provides numerous endowments; energy loss decrease throughout force transmission and reduction in the size and scope of electrical cables. Use of the DGs with the present force distribution arrangements may improve the intensity standard by reducing power quality and other issues. The electricity standard is a partner degree that increases concerns for electrical services and their customers during the recent deca. Quality of helpless force is recognised for the variety of aggravations such as diminution of voltage, swelling, imprudent and intermittent homelessness, numerous results, short interference, sounds and voltage shimmers, etc. Methods for locating the system include either moving the boundaries of the system to accept changes in voltage, recurrence that significantly spread throughout the grid removal, or detecting system boundary changes within the islanded DGs through the presentation of small aggravations within the grid activities (dynamic procedures). Current study involves the detection of soft computing classification based on fumbling logic design. In addition, a detection system is presented based on the method of recognition of neural network patterns. The proposed algorithm is superior to contemporary active and passive islanding conditions The proposed algorithm is also created with the help of the proposed algorithm
Initialization of a Multi-objective Evolutionary Algorithms Knowledge Acquisition System for Renewable Energy Power Plants
pp. 185-204The design of Renewable Energy Power Plants (REPPs) is crucial not only for the
investments' performance and attractiveness measures, but also for the maximization of
resource (source) usage (e.g. sun, water, and wind) and the minimization of raw
materials (e.g. aluminum: Al, cadmium: Cd, iron: Fe, silicon: Si, and tellurium: Te)
consumption. Hence, several appropriate and satisfactory Multi-objective Problems
(MOPs) are mandatory during the REPPs' design phases. MOPs related tasks can only
be managed by very well organized knowledge acquisition on all REPPs' design
equations and models. The proposed MOPs need to be solved with one or more multiobjective algorithm, such as Multi-objective Evolutionary Algorithms (MOEAs). In this
respect, the first aim of this research study is to start gathering knowledge on the REPPs'
MOPs. The second aim of this study is to gather detailed information about all MOEAs
and available free software tools for their development. The main contribution of this
research is the initialization of a proposed multi-objective evolutionary algorithm
knowledge acquisition system for renewable energy power plants (MOEAs-KAS-FREPPs) (research and development loopwise process: develop, train, validate, improve,
test, improve, operate, and improve). As a simple representative example of this
knowledge acquisition system research with two selective and elective proposed
standard objectives (as test objectives) and eight selective and elective proposed
standard constraints (as test constraints) are generated and applied as a standardized
MOP for a virtual small hydropower plant design and investment. The maximization of
energy generation (MWh) and the minimization of initial investment cost (million €)
are achieved by the Multi-objective Genetic Algorithm (MOGA), the Niched Sharing
Genetic Algorithm/Non-dominated Sorting Genetic Algorithm (NSGA-I), and the
NSGA-II algorithms in the Scilab 6.0.0 as only three standardized MOEAs amongst all
proposed standardized MOEAs on two desktop computer configurations (Windows 10
Home 1709 64 bits, Intel i5-7200 CPU @ 2.7 GHz, 8.00 GB RAM with internet
connection and Windows 10 Pro, Intel(R) Core(TM) i5 CPU 650 @ 3.20 GHz, 6,00 GB
RAM with internet connection). The algorithm run-times (computation time) of the
current applications vary between 20.64 and 59.98 seconds.S
Computational Optimizations for Machine Learning
The present book contains the 10 articles finally accepted for publication in the Special Issue “Computational Optimizations for Machine Learning” of the MDPI journal Mathematics, which cover a wide range of topics connected to the theory and applications of machine learning, neural networks and artificial intelligence. These topics include, among others, various types of machine learning classes, such as supervised, unsupervised and reinforcement learning, deep neural networks, convolutional neural networks, GANs, decision trees, linear regression, SVM, K-means clustering, Q-learning, temporal difference, deep adversarial networks and more. It is hoped that the book will be interesting and useful to those developing mathematical algorithms and applications in the domain of artificial intelligence and machine learning as well as for those having the appropriate mathematical background and willing to become familiar with recent advances of machine learning computational optimization mathematics, which has nowadays permeated into almost all sectors of human life and activity
Data-Intensive Computing in Smart Microgrids
Microgrids have recently emerged as the building block of a smart grid, combining distributed renewable energy sources, energy storage devices, and load management in order to improve power system reliability, enhance sustainable development, and reduce carbon emissions. At the same time, rapid advancements in sensor and metering technologies, wireless and network communication, as well as cloud and fog computing are leading to the collection and accumulation of large amounts of data (e.g., device status data, energy generation data, consumption data). The application of big data analysis techniques (e.g., forecasting, classification, clustering) on such data can optimize the power generation and operation in real time by accurately predicting electricity demands, discovering electricity consumption patterns, and developing dynamic pricing mechanisms. An efficient and intelligent analysis of the data will enable smart microgrids to detect and recover from failures quickly, respond to electricity demand swiftly, supply more reliable and economical energy, and enable customers to have more control over their energy use. Overall, data-intensive analytics can provide effective and efficient decision support for all of the producers, operators, customers, and regulators in smart microgrids, in order to achieve holistic smart energy management, including energy generation, transmission, distribution, and demand-side management. This book contains an assortment of relevant novel research contributions that provide real-world applications of data-intensive analytics in smart grids and contribute to the dissemination of new ideas in this area
An Approach Based on Particle Swarm Optimization for Inspection of Spacecraft Hulls by a Swarm of Miniaturized Robots
The remoteness and hazards that are inherent to the operating environments of space infrastructures promote their need for automated robotic inspection. In particular, micrometeoroid and orbital debris impact and structural fatigue are common sources of damage to spacecraft hulls. Vibration sensing has been used to detect structural damage in spacecraft hulls as well as in structural health monitoring practices in industry by deploying static sensors. In this paper, we propose using a swarm of miniaturized vibration-sensing mobile robots realizing a network of mobile sensors. We present a distributed inspection algorithm based on the bio-inspired particle swarm optimization and evolutionary algorithm niching techniques to deliver the task of enumeration and localization of an a priori unknown number of vibration sources on a simplified 2.5D spacecraft surface. Our algorithm is deployed on a swarm of simulated cm-scale wheeled robots. These are guided in their inspection task by sensing vibrations arising from failure points on the surface which are detected by on-board accelerometers. We study three performance metrics: (1) proximity of the localized sources to the ground truth locations, (2) time to localize each source, and (3) time to finish the inspection task given a 75% inspection coverage threshold. We find that our swarm is able to successfully localize the present so
Applied Metaheuristic Computing
For decades, Applied Metaheuristic Computing (AMC) has been a prevailing optimization technique for tackling perplexing engineering and business problems, such as scheduling, routing, ordering, bin packing, assignment, facility layout planning, among others. This is partly because the classic exact methods are constrained with prior assumptions, and partly due to the heuristics being problem-dependent and lacking generalization. AMC, on the contrary, guides the course of low-level heuristics to search beyond the local optimality, which impairs the capability of traditional computation methods. This topic series has collected quality papers proposing cutting-edge methodology and innovative applications which drive the advances of AMC