Binary Differential Evolution Research Articles

Seismic Damage Identification Using a Combination of Mixture of Gaussian and Harris Hawks Optimization

ABSTRACTThe present study aims to identify damage in structures using seismic responses and a two‐stage method based on mixture of Gaussian (MOG) and Harris hawks optimization (HHO). Two‐dimensional (2‐D) frame structures under seismic loads are simulated using the finite element method (FEM). The placement of sensors is optimized using a combination of an iterated improved reduced system (IIRS) and the binary differential evolution (BDE) algorithm. The MOG classifier is trained to find the damaged story and damaged element type (i.e., whether it is a beam or a column) using the nodal acceleration responses at the optimal sensor placement of the seismically loaded structure. Thus, as the first step, the possibly damaged elements are located through the classifier. Then, in the second step, the damage is accurately located and quantified by HHO algorithm. The performance of the proposed method is assessed using the numerical results of 2‐D frames of 7 and 14 stories in different damage scenarios with and without considering noise. As a result, the efficiency of the proposed method for the seismic damage identification of 2‐D frames is revealed. Sensor positions are well optimized, and it causes the method to be highly effective. Moreover, MOG correctly finds a damaged story and identifies whether a damaged element is a beam or a column. Damage in the presence of noise is also localized and quantified precisely by HHO.

Binary metaheuristic algorithms for 0–1 knapsack problems: Performance analysis, hybrid variants, and real-world application

This paper examines the performance of three binary metaheuristic algorithms when applied to two distinct knapsack problems (0–1 knapsack problems (KP01) and multidimensional knapsack problems (MKP)). These binary algorithms are based on the classical mantis search algorithm (MSA), the classical quadratic interpolation optimization (QIO) method, and the well-known differential evolution (DE). Because these algorithms were designed for continuous optimization problems, they could not be used directly to solve binary knapsack problems. As a result, the V-shaped and S-shaped transfer functions are used to propose binary variants of these algorithms, such as binary differential evolution (BDE), binary quadratic interpolation optimization (BQIO), and binary mantis search algorithm (BMSA). These binary variants are evaluated using various high-dimensional KP01 examples and compared to several classical metaheuristic techniques to determine their efficacy. To enhance the performance of those binary algorithms, they are combined with repair operator 2 (RO2) to offer better hybrid variants, namely HMSA, HQIO, and HDE. Those hybrid algorithms are evaluated using several medium- and large-scale KP01 and MKP instances, as well as compared to other hybrid algorithms, to demonstrate their effectiveness. This comparison is conducted using three performance metrics: average fitness value, Friedman mean rank, and computational cost. The experimental findings demonstrate that HQIO is a strong alternative for solving KP01 and MKP. In addition, the proposed algorithms are applied to the Merkle-Hellman Knapsack Cryptosystem and the resource allocation problem in adaptive multimedia systems (AMS) to illustrate their effectiveness when applied to optimize those real applications. The experimental findings illustrate that the proposed HQIO is a strong alternative for handling various knapsack-based applications.

Feature Selection by Binary Differential Evolution for Predicting the Energy Production of a Wind Plant

We propose a method for selecting the optimal set of weather features for wind energy prediction. This problem is tackled by developing a wrapper approach that employs binary differential evolution to search for the best feature subset, and an ensemble of artificial neural networks to predict the energy production from a wind plant. The main novelties of the approach are the use of features provided by different weather forecast providers and the use of an ensemble composed of a reduced number of models for the wrapper search. Its effectiveness is verified using weather and energy production data collected from a 34 MW real wind plant. The model is built using the selected optimal subset of weather features and allows for (i) a 1% reduction in the mean absolute error compared with a model that considers all available features and a 4.4% reduction compared with the model currently employed by the plant owners, and (ii) a reduction in the number of selected features by 85% and 50%, respectively. Reducing the number of features boosts the prediction accuracy. The implication of this finding is significant as it allows plant owners to create profitable offers in the energy market and efficiently manage their power unit commitment, maintenance scheduling, and energy storage optimization.

Accurate fault section diagnosis of power systems with a binary adaptive quadratic interpolation learning differential evolution

Fault section diagnosis (FSD) is essential for ensuring the effective operation of power systems. To determine the faulty sections accurately, we proposed an improved binary adaptive quadratic interpolation learning differential evolution called BAQILDE for solving the FSD problem. By comparing the received warning data with the anticipated states of circuit breakers and protective relays, an analytical 0–1 integer programming function is established. To tackle the resultant function accurately, the population in BAQILDE is directly encoded in binary instead of floating-point to facilitate the solving convenience. Besides, three enhanced strategies including adaptive mutation operator, time-varying crossover rate, and dual transformation operator are developed to equilibrate the population diversity and convergence well to strengthen BAQILDE. To evaluate BAQILDE's performance, four test systems were used for verification, including 4-substation power system, IEEE 118 bus system, and two actual failures that occurred in Guangzhou and Jilin power grids, China. The results show that BAQILDE can diagnose various failures within 0.12 s with 100 % success rate and 0 diagnosis error, consuming an average of 32.21 function evaluation times. It outperformed other well-known peer algorithms in success rate, diagnosis error, robustness, convergence, and statistical analysis, which demonstrates its strong competitiveness in solving the FSD problem.

Sustainable Commitment Scheduling for Power, Heat, and Natural Gas Dispatch

This manuscript presents commitment scheduling of power, heat and natural gas in presence of thermal generating units (TUs), cogeneration units (CUs), heat only units (HUs), solar PV plants, wind turbine generators and PEV parking lot with charging and discharging facility considering carbon capture. Power to gas technology comprising of carbon capture unit, electrolyzer, hydrogen storage unit, and methanation procedure, is used to provide natural gas demand using CO2 taken from TUs, CUs, HUs and hydrogen produced by electrolyzer. Total operative cost of TUs, CUs, HUs plus running cost of WGs and SPs are minimized whilst fulfilling a number of unit commitment constraints as well as generation scheduling constraints. Binary differential evolution along with priority list is applied for solving this problem. Numerical results of the system are comprehended for giving valued particulars for operative problem.

A Hybrid Feature-Selection Method Based on mRMR and Binary Differential Evolution for Gene Selection

The selection of critical features from microarray data as biomarkers holds significant importance in disease diagnosis and drug development. It is essential to reduce the number of biomarkers while maintaining their performance to effectively minimize subsequent validation costs. However, the processing of microarray data often encounters the challenge of the “curse of dimensionality”. Existing feature-selection methods face difficulties in effectively reducing feature dimensionality while ensuring classification accuracy, algorithm efficiency, and optimal search space exploration. This paper proposes a hybrid feature-selection algorithm based on an enhanced version of the Max Relevance and Min Redundancy (mRMR) method, coupled with differential evolution. The proposed method improves the quantization functions of mRMR to accommodate the continuous nature of microarray data attributes, utilizing them as the initial step in feature selection. Subsequently, an enhanced differential evolution algorithm is employed to further filter the features. Two adaptive mechanisms are introduced to enhance early search efficiency and late population diversity, thus reducing the number of features and balancing the algorithm’s exploration and exploitation. The results highlight the improved performance and efficiency of the hybrid algorithm in feature selection for microarray data analysis.

A novel binary genetic differential evolution optimization algorithm for wind layout problems

<abstract><p>This paper addresses the increasingly critical issue of environmental optimization in the context of rapid economic development, with a focus on wind farm layout optimization. As the demand for sustainable resource management, climate change mitigation, and biodiversity conservation rises, so does the complexity of managing environmental impacts and promoting sustainable practices. Wind farm layout optimization, a vital subset of environmental optimization, involves the strategic placement of wind turbines to maximize energy production and minimize environmental impacts. Traditional methods, such as heuristic approaches, gradient-based optimization, and rule-based strategies, have been employed to tackle these challenges. However, they often face limitations in exploring the solution space efficiently and avoiding local optima. To advance the field, this study introduces LSHADE-SPAGA, a novel algorithm that combines a binary genetic operator with the LSHADE differential evolution algorithm, effectively balancing global exploration and local exploitation capabilities. This hybrid approach is designed to navigate the complexities of wind farm layout optimization, considering factors like wind patterns, terrain, and land use constraints. Extensive testing, including 156 instances across different wind scenarios and layout constraints, demonstrates LSHADE-SPAGA's superiority over seven state-of-the-art algorithms in both the ability of jumping out of the local optima and solution quality.</p></abstract>

Multiobjective Binary Differential Approach with Parameter Tuning for Discovering Business Process Models: MoD-ProM.

Process discovery approaches analyze the business data to automatically uncover structured information, known as a process model. The quality of a process model is measured using quality dimensions, completeness (replay fitness), preciseness, simplicity, and generalization. Traditional process discovery algorithms usually output a single process model. A single model may not accurately capture the observed behavior and overfit the training data. We have formed the process discovery problem in a multiobjective framework that yields several candidate solutions for the end user who can pick a suitable model based on the local environmental constraints (possibly varying). We consider the Binary Differential Evolution approach in a multiobjective framework for the task of process discovery. The proposed method employs dichotomous crossover/mutation operators. The parameters are tuned using grey relational analysis combined with the Taguchi approach. We have compared the proposed approach with the well-known single-objective algorithms and state-of-the-art multiobjective evolutionary algorithm-Nondominated Sorting Genetic Algorithm (NSGA-II). Additional comparison via computing a weighted average of the quality dimensions is also undertaken. Results show that the proposed algorithm is computationally efficient and produces diversified candidate solutions that score high on the fitness functions. It is shown that the process models generated by the proposed approach are superior to or at least as good as those generated by the state-of-the-art algorithms.

Feature Subspace Learning-based Binary Differential Evolution Algorithm for Unsupervised Feature Selection

Feature Subspace Learning-based Binary Differential Evolution Algorithm for Unsupervised Feature Selection

Improved binary differential evolution with dimensionality reduction mechanism and binary stochastic search for feature selection

Computer systems store massive amounts of data with numerous features, leading to the need to extract the most important features for better classification in a wide variety of applications. Poor performance of various machine learning algorithms may be caused by unimportant features that increase the time and memory required to build a classifier. Feature selection (FS) is one of the efficient approaches to reducing the unimportant features. This paper, therefore, presents a new FS, named BDE-BSS-DR, that utilizes Binary Differential Evolution (BDE), Binary Stochastic Search (BSS) algorithm, and Dimensionality Reduction (DR) mechanism. The BSS algorithm increases the search capability of the BDE by escaping from local optimal points and exploring the search space. The DR mechanism then reduces the dimensions of the search space gradually. As a result of using DR, the local optima of the search space and the problem of wrong removal of important features before starting the search process are reduced. The algorithm's efficiency is evaluated on 20 different medical datasets. The obtained outcomes indicate that the BDE-BSS-DR outperforms the BDE and BDE-BSS algorithms significantly. Furthermore, the effectiveness of the proposed algorithms in selecting the most important features of the heart disease data, several cancer diseases, and COVID-19 are also compared with several other state-of-the-art methods. Our results show that the BDE-BSS-DR with SVM classifier has a significant advantage over other methods with an average classification accuracy of 95.05% in heart disease and 99.40% in COVID-19 disease. In addition, the comparisons made with KNN and SVM classification prove the efficiency of the DR and BSS in generating a subset of optimal and informative features.

Ensemble classification of integrated CT scan datasets in detecting COVID-19 using feature fusion from contourlet transform and CNN

The COVID-19 disease caused by coronavirus is constantly changing due to the emergence of different variants and thousands of people are dying every day worldwide. Early detection of this new form of pulmonary disease can reduce the mortality rate. In this paper, an automated method based on machine learning (ML) and deep learning (DL) has been developed to detect COVID-19 using computed tomography (CT) scan images extracted from three publicly available datasets (A total of 11,407 images; 7397 COVID-19 images and 4010 normal images). An unsupervised clustering approach that is a modified region-based clustering technique for segmenting COVID-19 CT scan image has been proposed. Furthermore, contourlet transform and convolution neural network (CNN) have been employed to extract features individually from the segmented CT scan images and to fuse them in one feature vector. Binary differential evolution (BDE) approach has been employed as a feature optimization technique to obtain comprehensible features from the fused feature vector. Finally, a ML/DL-based ensemble classifier considering bagging technique has been employed to detect COVID-19 from the CT images. A fivefold and generalization cross-validation techniques have been used for the validation purpose. Classification experiments have also been conducted with several pre-trained models (AlexNet, ResNet50, GoogleNet, VGG16, VGG19) and found that the ensemble classifier technique with fused feature has provided state-of-the-art performance with an accuracy of 99.98%.

AMoDeBic: An adaptive Multi-objective Differential Evolution biclustering algorithm of microarray data using a biclustering binary mutation operator

In bioinformatics, biclustering is a crucial optimization task that can reveal hidden patterns and identify groups of genes that behave similarly under certain conditions. This study aims to efficiently identify high-quality and cohesive biclusters that share common characteristics across two data dimensions. To achieve this, we propose the first biclustering approach that utilizes Multi-objective Differential Evolution (DE), which is a novel technique for gene group discovery. Additionally, we introduce the Biclustering Binary Differential Evolution (BBDE), a new mutation operator that combines node addition and deletion, guided by an adaptive factor F. We thoroughly tested our method’s effectiveness taking into account biological relevance, noise, overlap resistance, and statistics. We compared our results to state of the art algorithms using both synthetic and real datasets like Yeast Cell Cycle, Saccharomyces cerevisiae, and Human B Cell. Our algorithms outperformed the comparisons and effectively identified significant biclusters.

Binary differential evolution applied to the optimization of the voltage stability margin through the selection of corrective control sets

Binary differential evolution applied to the optimization of the voltage stability margin through the selection of corrective control sets

Transmission Expansion Planning using Binary Differential Evolution considering forecasted solar Photovoltaic generation

Transmission Expansion Planning (TEP) can be essentially affected by solar Photovoltaic (PV) penetration because its generation is uncertain depending on weather and the environment at a specific time. This uncertainty can impact transmission expansion planning because the uncertain generation of solar PV causes difficulty to expand transmission lines with secure system operations. The aim of the proposed TEP method is to construct transmission lines to handle the increase in solar PV sources and electricity demand while ensuring that the power system constraints are not violated. The goal of the objective function is to minimize the total cost of the system, which comprises both the investment cost and the operating cost of generation. Hourly resolution values of solar PV generation and electricity demand are considered in the planning. Moreover, to obtain accurate values of solar PV generation for planning a system with secure operations, this paper proposes a Long Short-Term Memory (LSTM) for forecasting solar PV generation. The Binary Differential Evolution (BDE) algorithm is applied to solve the TEP problem. The proposed TEP method is tested through an IEEE 24 bus test system. The results from the proposed method show that the obtained expansion plan provides the minimum total system cost without system violations.

Multiobjective optimization algorithm with dynamic operator selection for feature selection in high-dimensional classification

Feature selection (FS) is an important technique in data preprocessing that aims to reduce the number of features for training while maintaining a high accuracy for classification. In recent studies, FS has been extended to optimize multiple objectives simultaneously in classification. To better solve this problem, this paper proposes a new multiobjective optimization algorithm with dynamic operator selection for feature selection in high-dimensional classification, called FS-DOS. First, two complementary search operators with different characteristics are designed, where the first operator is a quick search (QS) operator aiming to accelerate the convergence speed, and the other operator is a modified binary differential evolution (BDE) operator that can prevent the algorithm from falling into a local optimum. In addition, a dynamic selection strategy based on the idea of resource allocation is also designed to dynamically select the most suitable operator for each solution according to its corresponding performance improvement on aggregated objective values. The simulation results on fifteen different real-world high-dimensional FS datasets show that FS-DOS can obtain a feature subset with higher quality than several state-of-the-art FS algorithms. Importantly, in terms of error rate, FS-DOS wins 55 out of 75 comparisons. In terms of dimensionality reduction, the number of features selected by FS-DOS is between one hundredth and one thousandth of the original dataset.

A two-stage hybrid biomarker selection method based on ensemble filter and binary differential evolution incorporating binary African vultures optimization

BackgroundIn the field of genomics and personalized medicine, it is a key issue to find biomarkers directly related to the diagnosis of specific diseases from high-throughput gene microarray data. Feature selection technology can discover biomarkers with disease classification information.ResultsWe use support vector machines as classifiers and use the five-fold cross-validation average classification accuracy, recall, precision and F1 score as evaluation metrics to evaluate the identified biomarkers. Experimental results show classification accuracy above 0.93, recall above 0.92, precision above 0.91, and F1 score above 0.94 on eight microarray datasets.MethodThis paper proposes a two-stage hybrid biomarker selection method based on ensemble filter and binary differential evolution incorporating binary African vultures optimization (EF-BDBA), which can effectively reduce the dimension of microarray data and obtain optimal biomarkers. In the first stage, we propose an ensemble filter feature selection method. The method combines an improved fast correlation-based filter algorithm with Fisher score. obviously redundant and irrelevant features can be filtered out to initially reduce the dimensionality of the microarray data. In the second stage, the optimal feature subset is selected using an improved binary differential evolution incorporating an improved binary African vultures optimization algorithm. The African vultures optimization algorithm has excellent global optimization ability. It has not been systematically applied to feature selection problems, especially for gene microarray data. We combine it with a differential evolution algorithm to improve population diversity.ConclusionCompared with traditional feature selection methods and advanced hybrid methods, the proposed method achieves higher classification accuracy and identifies excellent biomarkers while retaining fewer features. The experimental results demonstrate the effectiveness and advancement of our proposed algorithmic model.

Seismic damage identification of moment frames based on random forest algorithm and enhanced gray wolf optimization

SummaryThe present study aims to identify damage in two‐dimensional (2‐D) moment frames using seismic responses by combining the random forest (RF) machine classifier and the enhanced gray wolf optimizer (EGWO) metaheuristic algorithm. First, a 2‐D moment frame for the dynamic analysis is simulated using the finite element method (FEM). Then, the placement of sensors is optimized using a proposed optimal sensor placement (POSP) method, which is a combination of the iterated improved reduced system (IIRS) and the binary differential evolution (BDE) optimization algorithm. The acceleration responses of the moment frame having damaged elements under 1995 Kobe earthquake are measured at the optimal sensor placement. Then, the natural frequencies and mode shapes of the structure are extracted using the auto‐regressive model with exogenous input method (ARX) as a system identification method. The natural frequencies are exploited to train an RF machine learning network that can find the damaged story of the moment frame. Then, EGWO is employed to accurately locate and quantify the damaged elements of the structure. The efficiency of the proposed method is assessed through considering a six‐story frame with 18 elements, a seven‐story frame with 49 elements, and the experimental data of an eight‐story frame for various conditions. The results show that the RF algorithm has an outstanding performance to correctly find a damaged story. Furthermore, the location and severity of damaged elements are precisely determined by EGWO algorithm. As a final outcome, it is demonstrated that the two‐step proposed method is very effective in seismically identifying damage to such structures.

Feature Selection Using Diversity-Based Multi-objective Binary Differential Evolution

By identifying relevant features from the original data, feature selection methods can maintain or improve the classification accuracy and reduce the dimensionality. Recently, many multi-objective evolutionary methods have been proposed for feature selection. However, effectively handling the trade-offs between convergence and diversity of the non-dominated solutions remains a major challenge, especially for high-dimensional datasets. To cover this issue, this work studies a diversity-based multi-objective differential evolution approach to feature selection. During the environmental selection process, each of the solutions in the candidate pool will have a diversity score, and solutions with large diversity score values will be preferred so as to improve the population diversity. To reduce the search space, irrelevant and weakly relevant features are detected and removed in the proposed method. A new binary mutation operator using the neighborhood information of individuals is also proposed, aiming to produce better feature subsets. Experimental results on 14 datasets with varying difficulties show that the proposed feature selection method can obtain significantly better feature selection performance than current popular multi-objective feature selection methods.

Superpixel-based multiobjective change detection based on self-adaptive neighborhood-based binary differential evolution

With strong penetrability and high resolution, synthetic aperture radar (SAR) images have been widely used in remote sensing image change detection. With the essence of heuristics, metaheuristics are suitable for the needs of most real-life optimization problems according to the expected solution quality and allowable calculation time. To improve the accuracy of change detection, this paper proposes a novel efficient metaheuristic change detection procedure. More specifically, we develop a superpixel-based multiobjective change detection method based on superpixel-wise feature representation and self-adaptive neighborhood-based binary difference evolution. During the clustering for feature analysis, a multiobjective optimization problem (MOP) is modeled which take the likelihood and Bhattacharyya distance between changed and unchanged classes as two objective functions. To solve the MOP, this paper firstly applies the superpixel binary representation technique into the encoding process of multiobjective evolutionary algorithm so that the dimension of pixel coding space can be substantially reduced. Then a self-adaptive neighborhood-based binary differential evolution strategy is proposed to explore the optimal change detection strategy, where a novel mutation operator integrating neighborhood information is designed for the improvement of change detection performance. Experimental results on three real SAR datasets confirm that the proposed method can make a better performance on change detection and the metaheuristic algorithm has good convergence and stability.

Scalable feature subset selection for big data using parallel hybrid evolutionary algorithm based wrapper under apache spark environment.

Extant sequential wrapper-based feature subset selection (FSS) algorithms are not scalable and yield poor performance when applied to big datasets. Hence, to circumvent these challenges, we propose parallel and distributed hybrid evolutionary algorithms (EAs) based wrappers under Apache Spark. We propose two hybrid EAs based on the Binary Differential Evolution (BDE), and Binary Threshold Accepting (BTA), namely, (i) Parallel Binary Differential Evolution and Threshold Accepting (PB-DETA), where BDE and BTA work in tandem in every iteration, and (ii) its ablation variant, Parallel Binary Threshold Accepting and Differential Evolution (PB-TADE). Here, BTA is invoked to enhance the search capability and avoid premature convergence of BDE. For comparison purposes, we also parallelized two state-of-the-art algorithms: adaptive DE (ADE) and permutation based DE (DE-FSPM), and named them PB-ADE and P-DE-FSPM respectively. Throughout, logistic regression (LR) is employed to compute the fitness function, namely, area under the receiver operator characteristic curve (AUC). The effectiveness of the proposed algorithms is tested over the five big datasets of varying dimensions. It is noteworthy that the PB-TADE turned out to be statistically significant than the rest. All the algorithms have shown the repeatability property. The proposed parallel model attained a speedup of 2.2–2.9. We also reported feature subset with high AUC and least cardinality.