Adaptive particle swarm optimization

An adaptive particle swarm optimization (APSO) that features better search efficiency than classical particle swarm optimization (PSO) is presented. More importantly, it can perform a global search over the entire search space with faster convergence speed. The APSO consists of two main steps. First, by evaluating the population distribution and particle fitness, a real-time evolutionary state estimation procedure is performed to identify one of the following four defined evolutionary states, including exploration, exploitation, convergence, and jumping out in each generation. It enables the automatic control of inertia weight, acceleration coefficients, and other algorithmic parameters at run time to improve the search efficiency and convergence speed. Then, an elitist learning strategy is performed when the evolutionary state is classified as convergence state. The strategy will act on the globally best particle to jump out of the likely local optima. The APSO has comprehensively been evaluated on 12 unimodal and multimodal benchmark functions. The effects of parameter adaptation and elitist learning will be studied. Results show that APSO substantially enhances the performance of the PSO paradigm in terms of convergence speed, global optimality, solution accuracy, and algorithm reliability. As APSO introduces two new parameters to the PSO paradigm only, it does not introduce an additional design or implementation complexity

Chaotic Quantum Double Delta Swarm Algorithm using Chebyshev Maps: Theoretical Foundations, Performance Analyses and Convergence Issues

Quantum Double Delta Swarm (QDDS) Algorithm is a new metaheuristic algorithm inspired by the convergence mechanism to the center of potential generated within a single well of a spatially co-located double-delta well setup. It mimics the wave nature of candidate positions in solution spaces and draws upon quantum mechanical interpretations much like other quantum-inspired computational intelligence paradigms. In this work, we introduce a Chebyshev map driven chaotic perturbation in the optimization phase of the algorithm to diversify weights placed on contemporary and historical, socially-optimal agents' solutions. We follow this up with a characterization of solution quality on a suite of 23 single-objective functions and carry out a comparative analysis with eight other related nature-inspired approaches. By comparing solution quality and successful runs over dynamic solution ranges, insights about the nature of convergence are obtained. A two-tailed t-test establishes the statistical significance of the solution data whereas Cohen's d and Hedge's g values provide a measure of effect sizes. We trace the trajectory of the fittest pseudo-agent over all function evaluations to comment on the dynamics of the system and prove that the proposed algorithm is theoretically globally convergent under the assumptions adopted for proofs of other closely-related random search algorithms.Comment: 27 pages, 4 figures, 19 table

Feature selection using enhanced particle swarm optimisation for classification models.

In this research, we propose two Particle Swarm Optimisation (PSO) variants to undertake feature selection tasks. The aim is to overcome two major shortcomings of the original PSO model, i.e., premature convergence and weak exploitation around the near optimal solutions. The first proposed PSO variant incorporates four key operations, including a modified PSO operation with rectified personal and global best signals, spiral search based local exploitation, Gaussian distribution-based swarm leader enhancement, and mirroring and mutation operations for worst solution improvement. The second proposed PSO model enhances the first one through four new strategies, i.e., an adaptive exemplar breeding mechanism incorporating multiple optimal signals, nonlinear function oriented search coefficients, exponential and scattering schemes for swarm leader, and worst solution enhancement, respectively. In comparison with a set of 15 classical and advanced search methods, the proposed models illustrate statistical superiority for discriminative feature selection for a total of 13 data sets

A Co-evolutionary Algorithm-based Enhanced Grey Wolf Optimizer for the Routing of Wireless Sensor Networks

Wireless networks are frequently installed in arduous environments, heightening the importance of their consistent operation. To achieve this, effective strategies must be implemented to extend the lifespan of nodes. Energy-conserving routing protocols have emerged as the most prevalent methodology, as they strive to elongate the network\u27s lifetime while guaranteeing reliable data routing with minimal latency. In this paper, a plethora of studies have been done with the purpose of improving network routing, such as the integration of clustering techniques, heterogeneity, and swarm intelligence-inspired approaches. A comparative investigation was conducted on a variety of swarm-based protocols, including a new coevolutionary binary grey wolf optimizer (Co-BGWO), a BGWO, a binary whale optimization, and a binary Salp swarm algorithm. The objective was to optimize cluster heads (CHs) positions and their number during the initial stage of both two-level and three-level heterogeneous networks. The study concluded that these newly developed protocols are more reliable, stable, and energy-efficient than the standard SEP and EDEEC heterogeneous protocols. Specifically, in 150 m2 area of interest, the Co-BGWO and BGWO protocols of two levels were found the most efficient, with over than 33% increase in remaining energy percentage compared to SEP, and over 24% more than EDEEC in three-level networks

Novel bio-inspired memetic salp swarm algorithm and application to MPPT for PV systems considering partial shading condition

© 2019 Elsevier Ltd This paper proposes a novel bio-inspired optimization method named memetic salp swarm algorithm (MSSA). It is developed by extending the original salp swarm algorithm (SSA) with multiple independent salp chains, thus it can implement a wider exploration and a deeper exploitation under the memetic computing framework. In order to enhance the convergence stability, a virtual population based regroup operation is used for the global coordination between different salp chains. Due to partial shading condition (PSC) and fast time-varying weather conditions, photovoltaic (PV) systems may not be able to generate the global maximum power. Hence, MSSA is applied for an effective and efficient maximum power point tracking (MPPT) of PV systems under PSC. To evaluate the MPPT performance of the proposed algorithm, four case studies are undertaken using Matlab/Simulink, e.g., start-up test, step change of solar irradiation, ramp change of solar irradiation and temperature, and field atmospheric data of Hong Kong. The obtained PV system responses are compared to that of eight existing MPPT algorithms, such as incremental conductance (INC), genetic algorithm (GA), particle swarm optimization (PSO), artificial bees colony (ABC), cuckoo search algorithm (CSA), grey wolf optimizer (GWO), SSA, and teaching-learning-based optimization (TLBO), respectively. Simulation results demonstrate that the output energy generated by MSSA in Spring in HongKong is 118.57%, 100.73%, 100.96%, 100.87%, 101.35%, 100.36%, 100.81%, and 100.22% to that of INC, GA, PSO, ABC, CSA, GWO, SSA, and TLBO, respectively. Lastly, a hardware-in-the-loop (HIL) experiment using dSpace platform is undertaken to further validate the implementation feasibility of MSSA

Conceptual Design of Wind Farms Through Novel Multi-Objective Swarm Optimization

Wind is one of the major sources of clean and renewable energy, and global wind energy has been experiencing a steady annual growth rate of more than 20% over the past decade. In the U.S. energy market, although wind energy is one of the fastest increasing sources of electricity generation (by annual installed capacity addition), and is expected to play an important role in the future energy demographics of this country, it has also been plagued by project underperformance and concept-to-installation delays. There are various factors affecting the quality of a wind energy project, and most of these factors are strongly coupled in their influence on the socio-economic, production, and environmental objectives of a wind energy project. To develop wind farms that are profitable, reliable, and meet community acceptance, it is critical to accomplish balance between these objectives, and therefore a clean understanding of how different design and natural factors jointly impact these objectives is much needed. In this research, a Multi-objective Wind Farm Design (MOWFD) methodology is developed, which analyzes and integrates the impact of various factors on the conceptual design of wind farms. This methodology contributes three major advancements to the wind farm design paradigm: (I) provides a new understanding of the impact of key factors on the wind farm performance under the use of different wake models; (II) explores the crucial tradeoffs between energy production, cost of energy, and the quantitative role of land usage in wind farm layout optimization (WFLO); and (III) makes novel advancements on mixed-discrete particle swarm optimization algorithm through a multi-domain diversity preservation concept, to solve complex multi-objective optimization (MOO) problems. A comprehensive sensitivity analysis of the wind farm power generation is performed to understand and compare the impact of land configuration, installed capacity decisions, incoming wind speed, and ambient turbulence on the performance of conventional array layouts and optimized wind farm layouts. For array-like wind farms, the relative importance of each factor was found to vary significantly with the choice of wake models, i.e., appreciable differences in the sensitivity indices (of up to 70%) were observed across the different wake models. In contrast, for optimized wind farm layouts, the choice of wake models was observed to have no significant impact on the sensitivity indices. The MOWFD methodology is designed to explore the tradeoffs between the concerned performance objectives and simultaneously optimize the location of turbines, the type of turbines, and the land usage. More importantly, it facilitates WFLO without prescribed conditions (e.g., fixed wind farm boundaries and number of turbines), thereby allowing a more flexible exploration of the feasible layout solutions than is possible with other existing WFLO methodologies. In addition, a novel parameterization of the Pareto is performed to quantitatively explore how the best tradeoffs between energy production and land usage vary with the installed capacity decisions. The key to the various complex MO-WFLOs performed here is the unique set of capabilities offered by the new Multi-Objective Mixed-Discrete Particle Swarm Optimization (MO-MDPSO) algorithm, developed, tested and extensively used in this dissertation. The MO-MDPSO algorithm is capable of dealing with a plethora of problem complexities, namely: multiple highly nonlinear objectives, constraints, high design space dimensionality, and a mixture of continuous and discrete design variables. Prior to applying MO-MDPSO to effectively solve complex WFLO problems, this new algorithm was tested on a large and diverse suite of popular benchmark problems; the convergence and Pareto coverage offered by this algorithm was found to be competitive with some of the most popular MOO algorithms (e.g., GAs). The unique potential of the MO-MDPSO algorithm is further established through application to the following complex practical engineering problems: (I) a disc brake design problem, (II) a multi-objective wind farm layout optimization problem, simultaneously optimizing the location of turbines, the selection of turbine types, and the site orientation, and (III) simultaneously minimizing land usage and maximizing capacity factors under varying land plot availability

Evolving Deep DenseBlock Architecture Ensembles for Image Classification

Automatic deep architecture generation is a challenging task, owing to the large number of controlling parameters inherent in the construction of deep networks. The combination of these parameters leads to the creation of large, complex search spaces that are feasibly impossible to properly navigate without a huge amount of resources for parallelisation. To deal with such challenges, in this research we propose a Swarm Optimised DenseBlock Architecture Ensemble (SODBAE) method, a joint optimisation and training process that explores a constrained search space over a skeleton DenseBlock Convolutional Neural Network (CNN) architecture. Specifically, we employ novel weight inheritance learning mechanisms, a DenseBlock skeleton architecture, as well as adaptive Particle Swarm Optimisation (PSO) with cosine search coefficients to devise networks whilst maintaining practical computational costs. Moreover, the architecture design takes advantage of recent advancements of the concepts of residual connections and dense connectivity, in order to yield CNN models with a much wider variety of structural variations. The proposed weight inheritance learning schemes perform joint optimisation and training of the architectures to reduce the computational costs. Being evaluated using the CIFAR-10 dataset, the proposed model shows great superiority in classification performance over other state-of-the-art methods while illustrating a greater versatility in architecture generation

A spring search algorithm applied to engineering optimization problems

At present, optimization algorithms are used extensively. One particular type of such algorithms includes random-based heuristic population optimization algorithms, which may be created by modeling scientific phenomena, like, for example, physical processes. The present article proposes a novel optimization algorithm based on Hooke’s law, called the spring search algorithm (SSA), which aims to solve single-objective constrained optimization problems. In the SSA, search agents are weights joined through springs, which, as Hooke’s law states, possess a force that corresponds to its length. The mathematics behind the algorithm are presented in the text. In order to test its functionality, it is executed on 38 established benchmark test functions and weighed against eight other optimization algorithms: a genetic algorithm (GA), a gravitational search algorithm (GSA), a grasshopper optimization algorithm (GOA), particle swarm optimization (PSO), teaching–learning-based optimization (TLBO), a grey wolf optimizer (GWO), a spotted hyena optimizer (SHO), as well as an emperor penguin optimizer (EPO). To test the SSA’s usability, it is employed on five engineering optimization problems. The SSA delivered better fitting results than the other algorithms in unimodal objective function, multimodal objective functions, CEC 2015, in addition to the optimization problems in engineering

Simultaneous image color correction and enhancement using particle swarm optimization

Color images captured under various environments are often not ready to deliver the desired quality due to adverse effects caused by uncontrollable illumination settings. In particular, when the illuminate color is not known a priori, the colors of the objects may not be faithfully reproduced and thus impose difficulties in subsequent image processing operations. Color correction thus becomes a very important pre-processing procedure where the goal is to produce an image as if it is captured under uniform chromatic illumination. On the other hand, conventional color correction algorithms using linear gain adjustments focus only on color manipulations and may not convey the maximum information contained in the image. This challenge can be posed as a multi-objective optimization problem that simultaneously corrects the undesirable effect of illumination color cast while recovering the information conveyed from the scene. A variation of the particle swarm optimization algorithm is further developed in the multi-objective optimization perspective that results in a solution achieving a desirable color balance and an adequate delivery of information. Experiments are conducted using a collection of color images of natural objects that were captured under different lighting conditions. Results have shown that the proposed method is capable of delivering images with higher quality. © 2013 Elsevier Ltd. All rights reserved