Nature-inspired Optimization Algorithm Research Articles

An approach for managing the Internet of things’ resources to optimize the energy consumption using a nature-inspired optimization algorithm and Markov model

The Internet of Things (IoT) is a developed communication idea in which connectivity and intelligence are added to nearly every device in a real-world context. From a technological standpoint, IoT provides a computational and communications capability to an item to connect to the Internet. Resource management policies are integral to IoT systems to ensure service quality and prevent energy loss and resource fragmentation. The resource management architecture includes some parts that coherently control resources in a way that minimizes resource loss in addition to offsetting the application service quality limitations. To this aim, planning and scheduling components are critical in determining the condition of available resources and the best candidates for hosting a program module. We proposed a method to handle IoT's resources utilizing a nature-inspired optimization algorithm and a Markov model to solve these restrictions. The performance of the proposed method was evaluated to current IoT access management systems in this article. In comparison to earlier approaches, the results demonstrated the efficacy of the new approach in terms of execution time and energy consumption.

Investigation of optimal power flow solution techniques considering stochastic renewable energy sources: Review and analysis

Increased penetration of renewable energy sources (RESs) in power system networks poses several challenges in system planning and management due to their uncertain and non-dispatchable nature. Consequently, this paper presents a thorough and precise review of recent solution methodologies for solving the optimal power flow (OPF) problems incorporated with stochastic RESs based on multiple peer-reviewed research publications in reputed journals. The Teaching Learning Based Optimization algorithm has been discussed and implemented to solve the OPF problem considering solar photovoltaic, wind turbine, and tidal energy systems. Weibull, Lognormal, and Gumbel probability density functions representing the uncertainty associated with the availability of wind speed, solar irradiance, and tidal energy systems, respectively. The results obtained from the proposed technique validate its novelty regarding OPF problems like minimization of operating cost, power loss in transmission lines, enhancement of voltage profile, and voltage stability. The proposed solution technique for OPF problems is tested on a modified IEEE 30-bus test system. Thus, this study assists in understanding the OPF problem for new researchers concerned with this domain and also gives the idea of implementing nature-inspired optimization algorithms on a defined test system to solve the OPF problem.

Optimized hyperbolic tangent function-based contrast-enhanced mammograms for breast mass detection

Breast cancer is a grave concern among women due to its high mortality rate in women as compared to that in men. Mass, an early symptom of breast cancer, is difficult to detect due to its subtle nature. Mammography, an effective and most preferred screening technique, generally uses low-contrast images where identification of some of the mass lesions from surrounding normal tissues is a difficult task even for skilled radiologists. Therefore, to alleviate the issue, this paper introduces an effective computer-aided detection scheme based on a novel contrast enhancement scheme for mammograms to automate the localization procedure of mass cases. Hyperbolic tangent function, a simple yet effective method, is introduced as an enhancement transfer function whose adjustable parameter is optimized by the Tunicate swarm algorithm, a nature-inspired optimization algorithm, via fitness function. To minimize the false positives generated after the detection, the median robust extended local binary pattern, a texture-based descriptor, is introduced, which possesses the ability to capture both micro- and macro-structure information from an image patch. The analysis includes four classifiers: Fisher linear discriminant analysis, K-nearest neighbor, support vector machine, and an ensemble classifier in the feature-based classification for false positive reduction (FPR). The proposed approach of automatic detection of masses when verified using two standard databases, mini-MIAS and Digital Database for Screening Mammography, comprised 68 and 550 mammograms, respectively, achieved sensitivities of 95.3% and 94.1% with 0.36 and 0.40 false positives per image after false positive reduction.

Automatic Data Clustering by Hybrid Enhanced Firefly and Particle Swarm Optimization Algorithms

Data clustering is a process of arranging similar data in different groups based on certain characteristics and properties, and each group is considered as a cluster. In the last decades, several nature-inspired optimization algorithms proved to be efficient for several computing problems. Firefly algorithm is one of the nature-inspired metaheuristic optimization algorithms regarded as an optimization tool for many optimization issues in many different areas such as clustering. To overcome the issues of velocity, the firefly algorithm can be integrated with the popular particle swarm optimization algorithm. In this paper, two modified firefly algorithms, namely the crazy firefly algorithm and variable step size firefly algorithm, are hybridized individually with a standard particle swarm optimization algorithm and applied in the domain of clustering. The results obtained by the two planned hybrid algorithms have been compared with the existing hybridized firefly particle swarm optimization algorithm utilizing ten UCI Machine Learning Repository datasets and eight Shape sets for performance evaluation. In addition to this, two clustering validity measures, Compact-separated and David–Bouldin, have been used for analyzing the efficiency of these algorithms. The experimental results show that the two proposed hybrid algorithms outperform the existing hybrid firefly particle swarm optimization algorithm.

Learning Optimized Patterns of Software Vulnerabilities with the Clock-Work Memory Mechanism

It is possible to better provide the security of the codebase and keep testing efforts at a minimum level by detecting vulnerable codes early in the course of software development. We assume that nature-inspired metaheuristic optimization algorithms can obtain “optimized patterns” from vulnerabilities created in an artificial manner. This study aims to use nature-inspired optimization algorithms combining heterogeneous data sources with the objective of learning optimized representations of vulnerable source codes. The chosen vulnerability-relevant data sources are cross-domain, involving historical vulnerability data from variable software projects and data from the Software Assurance Reference Database (SARD) comprising vulnerability examples. The main purpose of this paper is to outline the state-of-the-art and to analyze and discuss open challenges with regard to the most relevant areas in the field of bio-inspired optimization based on the representation of software vulnerability. Empirical research has demonstrated that the optimized representations produced by the suggested nature-inspired optimization algorithms are feasible and efficient and can be transferred for real-world vulnerability detection.

A Simplex Method-Based Bacterial Colony Optimization Algorithm for Data Clustering Analysis

Data clustering is the task of separating data samples into a set of clusters. [Formula: see text]-means is a popular partitional clustering algorithm. However, it has a lot of weaknesses, including sensitivity to initialization and the ability to become stuck in local optima. Hence, nature-inspired optimization algorithms were applied to the clustering problem to overcome the limitations of the [Formula: see text]-means algorithm. However, due to the high-dimensionality of a search space, the nature-inspired optimization algorithm suffers from local optima and poor convergence rates. To address the mentioned issues, this paper presents a simplex method-based bacterial colony optimization (SMBCO) algorithm. The simplex method is a stochastic variant approach that improves population diversity while increasing the algorithm’s local searching ability. The potential and effectiveness of the proposed SMBCO clustering algorithm are assessed using a variety of benchmark machine learning datasets and the generated groups were evaluated using different performance measures. When compared to several well-known nature-inspired algorithms, the experimental results reveal that the SMBCO model produces superior clustering efficiency and a faster convergence rate.

HNIO: A Hybrid Nature-Inspired Optimization Algorithm for Energy Minimization in UAV-Assisted Mobile Edge Computing

Mobile edge computing (MEC) is an emerging computing paradigm that decreases the computing time and extends the lifespan of user equipments (UEs). In MEC, the computational tasks are offloaded from UEs to the base station (BS) at the edge of the network for processing. However, MEC cannot cope with environments where there are no BS or where communication facilities have been destroyed. In this paper, we study the problem of minimizing the energy consumption of UAV equipped with MEC servers as a mobile base station to serve users. The problem involves user offloading decision, UAV location and allocation with computational resources, and is a hybrid optimization problem with continuous and discrete variables. To address this problem, we propose a hybrid nature-inspired optimization algorithm (HNIO) and its version for discrete optimization, where HNIO incorporates mutation and population diversity detection mechanisms to boost its global optimization capability, and we design a probabilistic selection-based coding strategy for the discrete optimization version. The experimental study is conducted based on ten cases with different numbers of UEs. Comparing HNIO with several other state-of-the-art optimization algorithms, it is concluded from the Friedman and Wilcoxon’s test of the experimental results that HNIO shows better precision and stability in nine out of the ten cases with higher number of UEs.

Cuckoo Search Constrained Gamma Masking for MRI Image Detail Enhancement

Nature-inspired algorithms are widely applied in the arena of image enhancement for various optimization purposes. To address the optimization complexities in various image enhancement approaches, nature-inspired optimization algorithms play a vital role. Cuckoo search is one of the prominent nature-inspired performance algorithms that we employed in this work for the enhancement of magnetic resonance imaging (MRI). We proposed a wavelet-based masking technique employing a cuckoo search algorithm whose masking value is corrected by gamma function for the contrast enhancement of MRI images. The cuckoo search algorithm can inevitably fine-tune the relation of nest building using genetic operatives like adaptive cusp and alteration. The proposed contrast enhancement scheme is examined quantitatively for different types of MRI images. Extensive simulation results compared with quantitative values have revealed that the traditional nest building of cuckoo search optimization is improved by adaptive gamma correction. Comparative analysis with the existing works establishes the usefulness of the proposed methodology over the other standard approaches.

Nature-Inspired Optimization Algorithms in Solving Partial Shading Problems: A Systematic Review

Nature-Inspired Optimization Algorithms in Solving Partial Shading Problems: A Systematic Review

Multi-strategy boosted marine predators algorithm for optimizing approximate developable surface

Marine predators algorithm (MPA) is a newly developed swarm-based meta-heuristic algorithm that is inspired by the foraging strategies of marine predators: Lévy, Brownian motions and optimal encounter rate strategies, and has shown competitive performance with other state-of-the-art algorithms. Despite the effectiveness of original MPA and existing improved MPA in many real applications, the diversity of the population and the solution accuracy of MPA still deserve to be improved. To this end, an enhanced marine predators algorithm with the neighborhood-based learning strategy and the adaptive population size strategy is proposed in this paper, which is termed NMPA. Also, the superiority of the proposed NMPA is verified by being compared with the original MPA, other improved MPA and popular nature-inspired optimization algorithms on the well-known CEC 2017 and CEC 2020 test suites as well as three engineering design problems, respectively. Furthermore, the practicability of NMPA is illustrated by solving a real-world application of approximate developable surface modeling. By taking the maximization of developability degree of the developable surface as the evaluation criterion, the model for interpolating two given spatial curves to design an approximate developable surface is established. Then, the proposed NMPA is used to solve the optimization model, and the approximate developable surfaces with the maximum developability degree can be obtained. The experimental results show the superior performance of NMPA over other algorithms in terms of precision, convergence rate and solution quality. To sum up, NMPA is potentially a competitive and excellent meta-heuristic algorithm for constructing approximate developable surface and solving engineering optimization problems.

Elite Chaotic Manta Ray Algorithm Integrated with Chaotic Initialization and Opposition-Based Learning

The manta ray foraging optimizer (MRFO) is a novel nature-inspired optimization algorithm that simulates the foraging strategy and behavior of manta ray groups, i.e., chain, spiral, and somersault foraging. Although the native MRFO has revealed good competitive capability with popular meta-heuristic algorithms, it still falls into local optima and slows the convergence rate in dealing with some complex problems. In order to ameliorate these deficiencies of the MRFO, a new elite chaotic MRFO, termed the CMRFO algorithm, integrated with chaotic initialization of population and an opposition-based learning strategy, is developed in this paper. Fourteen kinds of chaotic maps with different properties are used to initialize the population. Thereby, the chaotic map with the best effect is selected; meanwhile, the sensitivity analysis of an elite selection ratio in an elite chaotic searching strategy to the CMRFO is discussed. These strategies collaborate to enhance the MRFO in accelerating overall performance. In addition, the superiority of the presented CMRFO is comprehensively demonstrated by comparing it with a native MRFO, a modified MRFO, and several state-of-the-art algorithms using (1) 23 benchmark test functions, (2) the well-known IEEE CEC 2020 test suite, and (3) three optimization problems in the engineering field, respectively. Furthermore, the practicability of the CMRFO is illustrated by solving a real-world application of shape optimization of cubic generalized Ball (CG-Ball) curves. By minimizing the curvature variation in these curves, the shape optimization model of CG-Ball ones is established. Then, the CMRFO algorithm is applied to handle the established model compared with some advanced meta-heuristic algorithms. The experimental results demonstrate that the CMRFO is a powerful and attractive alternative for solving engineering optimization problems.

A Novel Fuzzy Logic-Based Improved Cuckoo Search Algorithm

Cuckoo Search (CS) algorithm is a nature-inspired optimization algorithm (NIOA) with less control parameters that is stable, versatile, and easy to implement. CS has good global search capabilities, but it is prone to local optima problems. As a result, it may be possible to improve the classic CS algorithm's optimization capability. Centered on fuzzy set theory, this paper introduces an improved CS version. The population of solutions has been divided into two fuzzy sets, and each solution is assigned to one of the sets based on its fitness. The fuzzy collection centroids, global best solution advice, and Lévy distribution dependent mutation are all used to boost the population's solutions. With well-accepted objective functions such as Otsu inter class variance and Kapur's entropy, the experimental analysis has been conducted on the CEC-2014 test suite and image multi-level thresholding domain. The proposed fuzzy cuckoo search (FCS) algorithm is compared to the classical CS, PSO, FA, SMA, and BA algorithm and provides satisfactory results.

Random forest-based algorithms for accurate evaluation of ultimate bending capacity of steel tubes

Despite the existence of methods for estimating the behavior of steel circular tubes subjected to pure bending, analytical models are still restricted due to the problem’s complexity and significant nonlinearity. Using the random forest (RF) as the basic model, novel intelligent models are constructed to estimate the ultimate pure bending capacity of circular steel tubes in this study. The RF model’s parameters are optimized using three nature inspired optimization algorithms, namely, the particle swarm optimization (PSO), ant colony optimization (ACO) and whale optimization algorithm (WOA). In the experimental part, a database of 104 tests that comprise 49 and 55 pure bending tests conducted on fabricated and cold-formed steel circular tubes, respectively, are evaluated and utilized to investigate the applicability of the hybrid RF-models. A single RF model is also built for comparative reasons in order to estimate the ultimate pending capacity. Various statistical and graphical measures are used to evaluate the performance of the developed models. The results show that the proposed RF-based nature-inspired algorithms can outperform the original RF predictive model. When the hybrid-RF models were assessed, it was discovered that the RF-WOA performed best. In addition, the influence of each parameter on the prediction findings based on the best RF-model is investigated via sensitivity analysis. Taking into account the overall findings, the hybrid RF-models may be used as powerful tools to predict the ultimate bending capacity of circular steel tubes and may be viable to aid technicians in making proper judgments.

Comparative analysis of optimization strategies by software complex “Metaheuristic nature-inspired methods of global optimization”

This article discusses the comparative efficiency analysis results of algorithms for finding a global extrema for multivariable functions with parallelepiped constraints. Three metaheuristic nature-inspired optimization algorithms such as Grey Wolf Optimizer (GWO), Whale Optimization Algorithm (WOA) and Perch School Search (PSS) are presented. For algorithms comparative analysis the software complex was created, which allows visualizing a process of obtaining the approximate solution of standard generally accepted benchmark problems. The different examples of optimization algorithms results are given. Benchmark functions structure provides fairly estimating of compared optimization methods. The purpose of the paper is collecting and subsequent analysis of statistical results of algorithms accuracy and convergence pattern. Statistical data analysis makes it possible to choose the most suitable optimization method and to formulate valid recommendations to pick parameters for the most efficient solution of arbitrary objective function optimization problem.

Intrusion Detection Using an Improved Cuckoo Search Optimization Algorithm

These days, intelligent cybersecurity models based on machine learning and data mining techniques are prevalent. Several factors might affect the quality of these models, including the accuracy, the ability to train new models quickly, the quick decision-making process, the simplicity of the created models, and the model’s interpretability. Feature selection algorithms can help achieve all these characteristics by isolating the crucial features from the unimportant ones during the model creation phase. The current article proposes an intelligent intrusion detection model based on an improved cuckoo search algorithm which is a nature-inspired optimization algorithm. The improved cuckoo search algorithm proposed in this article may tolerate several bad steps toward determining the set of effective features that would preserve or maximize the capabilities of the produced classification models. The generalization ability of such an algorithm is examined by applying it to 10 benchmark datasets, and it showed superior outcomes compared with several nature-inspired attribute selection approaches. Later, the improved cuckoo search algorithm is used to develop intelligent intrusion detection systems using the well-known “NSL-KDD” dataset. The obtained outcomes are appealing regarding the general performance, the time required to develop the intelligent intrusion detection models, and the number of rules generated.

Whale Optimizer-Based Clustering for Breast Histopathology Image Segmentation

Breast histopathology image segmentation is a complex task due to indiscernibly correlated and noisy regions of interest. Breast histopathological images are composed of different types of cells. Some of these cells can be harmful for humans due to the presence of cancer. Under such circumstances, many segmentation techniques for automatic detection of cancer cells have been proposed considering clustering schemes. However, such clustering methodologies are sensitive to initial cluster centers, which promote false-positive solutions. This paper presents the use of the Whale Optimization Algorithm (WOA) for proper clustering segmentation of breast histopathological images to overcome clustering issues. Also, a rigorous comparative study is conducted among the proposed approach and several state-of-art Nature-Inspired Optimization Algorithms (NIOAs) and traditional clustering techniques. The numerical results indicate that the proposed approach outperforms the other utilized clustering methods in terms of precision, robustness, and quality of the segmented outputs.

Comparative Performance Analysis of Differential Evolution Variants on Engineering Design Problems

Because of their superior problem-solving ability, nature-inspired optimization algorithms are being regularly used in solving complex real-world optimization problems. Engineering academics have recently focused on meta-heuristic algorithms to solve various optimization challenges. Among the state-of-the-art algorithms, Differential Evolution (DE) is one of the most successful algorithms and is frequently used to solve various industrial problems. Over the previous 2 decades, DE has been heavily modified to improve its capabilities. Several DE variations secured positions in IEEE CEC competitions, establishing their efficacy. However, to our knowledge, there has never been a comparison of performance across various CEC-winning DE versions, which could aid in determining which is the most successful. In this study, the performance of DE and its eight other IEEE CEC competition-winning variants are compared. First, the algorithms have evaluated IEEE CEC 2019 and 2020 bound-constrained functions, and the performances have been compared. One unconstrained problem from IEEE CEC 2011 problem suite and five other constrained mechanical engineering design problems, out of which four issues have been taken from IEEE CEC 2020 non-convex constrained optimization suite, have been solved to compare the performances. Statistical analyses like Friedman's test and Wilcoxon's test are executed to verify the algorithm’s ability statistically. Performance analysis exposes that none of the DE variants can solve all the problems efficiently. Performance of SHADE and ELSHADE-SPACMA are considerable among the methods used for comparison to solve such mechanical design problems.

Human-Inspired Optimization Algorithms: Theoretical Foundations, Algorithms, Open-Research Issues and Application for Multi-Level Thresholding.

Humans take immense pride in their ability to be unpredictably intelligent and despite huge advances in science over the past century; our understanding about human brain is still far from complete. In general, human being acquire the high echelon of intelligence with the ability to understand, reason, recognize, learn, innovate, retain information, make decision, communicate and further solve problem. Thereby, integrating the intelligence of human to develop the optimization technique using the human problem-solving ability would definitely take the scenario to next level thus promising an affluent solution to the real world optimization issues. However, human behavior and evolution empowers human to progress or acclimatize with their environments at rates that exceed that of other nature based evolution namely swarm, bio-inspired, plant-based or physics-chemistry based thus commencing yet additional detachment of Nature-Inspired Optimization Algorithm (NIOA) i.e. Human-Inspired Optimization Algorithms (HIOAs). Announcing new meta-heuristic optimization algorithms are at all times a welcome step in the research field provided it intends to address problems effectively and quickly. The family of HIOA is expanding rapidly making it difficult for the researcher to select the appropriate HIOA; moreover, in order to map the problems alongside HIOA, it requires proper understanding of the theoretical fundamental, major rules governing HIOAs as well as common structure of HIOAs. Common challenges and open research issues are yet another important concern in HIOA that needs to be addressed carefully. With this in mind, our work distinguishes HIOAs on the basis of a range of criteria and discusses the building blocks of various algorithms to achieve aforementioned objectives. Further, this paper intends to deliver an acquainted survey and analysis associated with modern compartment of NIOA engineered upon the perception of human behavior and intelligence i.e. Human-Inspired Optimization Algorithms (HIOAs) stressing on its theoretical foundations, applications, open research issues and their implications on color satellite image segmentation to further develop Multi-Level Thresholding (MLT) models utilizing Tsallis and t-entropy as objective functions to judge their efficacy.

Factual Power Loss Lessening by Enhanced Synthetic Biome Optimization and Green Algae Algorithms

In this paper Enhanced Synthetic Biome Optimization (ESBO) and Green Algae algorithm (GAA) is designed to abridge the power loss. Synthetic Biome Optimization (SBO) algorithm is a nature-inspired optimization algorithm, stimulated by the stream of energy in a biome on the world. The biome can be enunciated as a cluster of existing entities living in a certain province and the biome outlines the associations among them. The deprived entity (creator) is rationalized by the upper and low borders of exploration space and the pre-eminent entity (putrefaction). Levy flight applied to augment the exploration and imitate the food probing process of many faunae. In order to augment the convergence characteristics of the SBO algorithm, sine-cosine functions has been incorporated in the technique. This augmentation will stimulate divergent solutions and modifies in the direction of the distinguished prospective solution in ESBO. Proposed GAA approach imitates growing, reproduction deeds of green algae in sunlight. Green algae live in the shape of algal colonies which consist of algal cells. When green algae in least amount of sunlight it will be small size, energy and particularly starvation level will be high, but it will attempt to acclimatize by using adaptation probability in the ambiance where it positioned. Enhanced Synthetic Biome Optimization and GAA appraised in IEEE 57 and 300 bus systems. Assessment with other techniques has been done. Projected ESBO and GAA approaches abridged the power loss meritoriously

A hybrid Genetic–Grey Wolf Optimization algorithm for optimizing Takagi–Sugeno–Kang fuzzy systems

Nature-inspired optimization techniques have been applied in various fields of study to solve optimization problems. Since designing a Fuzzy System (FS) can be considered one of the most complex optimization problems, many meta-heuristic optimizations have been developed to design FS structures. This paper aims to design a Takagi–Sugeno–Kang fuzzy Systems (TSK-FS) structure by generating the required fuzzy rules and selecting the most influential parameters for these rules. In this context, a new hybrid nature-inspired algorithm is proposed, namely Genetic–Grey Wolf Optimization (GGWO) algorithm, to optimize TSK-FSs. In GGWO, a hybridization of the genetic algorithm (GA) and the grey wolf optimizer (GWO) is applied to overcome the premature convergence and poor solution exploitation of the standard GWO. Using genetic crossover and mutation operators accelerates the exploration process and efficiently reaches the best solution (rule generation) within a reasonable time. The proposed GGWO is tested on several benchmark functions compared with other nature-inspired optimization algorithms. The result of simulations applied to the fuzzy control of nonlinear plants shows the superiority of GGWO in designing TSK-FSs with high accuracy compared with different optimization algorithms in terms of Root Mean Squared Error (RMSE) and computational time.