Boosting Arithmetic Optimization Algorithm with Genetic Algorithm Operators for Feature Selection: Case Study on Cox Proportional Hazards Model

A BiLSTM model enhanced with multi-objective arithmetic optimization for COVID-19 diagnosis from CT images

In response to the relentless mutation of the coronavirus disease, current artificial intelligence algorithms for the automated diagnosis of COVID-19 via CT imaging exhibit suboptimal accuracy and efficiency. This manuscript proposes a multi-objective optimization algorithm (MOAOA) to enhance the BiLSTM model for COVID-19 automated diagnosis. The proposed approach involves configuring several hyperparameters for the bidirectional long short-term memory (BiLSTM), optimized using the MOAOA intelligent optimization algorithm, and subsequently validated on publicly accessible medical datasets. Remarkably, our model achieves an impressive 95.32% accuracy and 95.09% specificity. Comparative analysis with state-of-the-art techniques demonstrates that the proposed model significantly enhances accuracy, efficiency, and other performance metrics, yielding superior results.

Bird's Eye View feature selection for high-dimensional data

In machine learning, an informative dataset is crucial for accurate predictions. However, high dimensional data often contains irrelevant features, outliers, and noise, which can negatively impact model performance and consume computational resources. To tackle this challenge, the Bird's Eye View (BEV) feature selection technique is introduced. This approach is inspired by the natural world, where a bird searches for important features in a sparse dataset, similar to how a bird search for sustenance in a sprawling jungle. BEV incorporates elements of Evolutionary Algorithms with a Genetic Algorithm to maintain a population of top-performing agents, Dynamic Markov Chain to steer the movement of agents in the search space, and Reinforcement Learning to reward and penalize agents based on their progress. The proposed strategy in this paper leads to improved classification performance and a reduced number of features compared to conventional methods, as demonstrated by outperforming state-of-the-art feature selection techniques across multiple benchmark datasets.

A Novel Hybrid Harris Hawk-Arithmetic Optimization Algorithm for Industrial Wireless Mesh Networks

A novel hybrid Harris Hawk-Arithmetic Optimization Algorithm (HHAOA) for optimizing the Industrial Wireless Mesh Networks (WMNs) and real-time pressure process control was proposed in this research article. The proposed algorithm uses inspiration from Harris Hawk Optimization and the Arithmetic Optimization Algorithm to improve position relocation problems, premature convergence, and the poor accuracy the existing techniques face. The HHAOA algorithm was evaluated on various benchmark functions and compared with other optimization algorithms, namely Arithmetic Optimization Algorithm, Moth Flame Optimization, Sine Cosine Algorithm, Grey Wolf Optimization, and Harris Hawk Optimization. The proposed algorithm was also applied to a real-world industrial wireless mesh network simulation and experimentation on the real-time pressure process control system. All the results demonstrate that the HHAOA algorithm outperforms different algorithms regarding mean, standard deviation, convergence speed, accuracy, and robustness and improves client router connectivity and network congestion with a 31.7% reduction in Wireless Mesh Network routers. In the real-time pressure process, the HHAOA optimized Fractional-order Predictive PI (FOPPI) Controller produced a robust and smoother control signal leading to minimal peak overshoot and an average of a 53.244% faster settling. Based on the results, the algorithm enhanced the efficiency and reliability of industrial wireless networks and real-time pressure process control systems, which are critical for industrial automation and control applications.

A Comprehensive Survey on Arithmetic Optimization Algorithm

Arithmetic Optimization Algorithm (AOA) is a recently developed population-based nature-inspired optimization algorithm (NIOA). AOA is designed under the inspiration of the distribution behavior of the main arithmetic operators in mathematics and hence, it also belongs to mathematics-inspired optimization algorithm (MIOA). MIOA is a powerful subset of NIOA and AOA is a proficient member of it. AOA is published in early 2021 and got a massive recognition from research fraternity due to its superior efficacy in different optimization fields. Therefore, this study presents an up-to-date survey on AOA, its variants, and applications.

An Optimization Method of Production-Distribution in Multi-Value-Chain

Value chain collaboration management is an effective means for enterprises to reduce costs and increase efficiency to enhance competitiveness. Vertical and horizontal collaboration have received much attention, but the current collaboration model combining the two is weak in terms of task assignment and node collaboration constraints in the whole production-distribution process. Therefore, in the enterprise dynamic alliance, this paper models the MVC (multi-value-chain) collaboration process for the optimization needs of the MVC collaboration network in production-distribution and other aspects. Then a MVC collaboration network optimization model is constructed with the lowest total production-distribution cost as the optimization objective and with the delivery cycle and task quantity as the constraints. For the high-dimensional characteristics of the decision space in the multi-task, multi-production end, multi-distribution end, and multi-level inventory production-distribution scenario, a genetic algorithm is used to solve the MVC collaboration network optimization model and solve the problem of difficult collaboration of MVC collaboration network nodes by adjusting the constraints among genes. In view of the multi-level characteristics of the production-distribution scenario, two chromosome coding methods are proposed: staged coding and integrated coding. Moreover, an algorithm ERGA (enhanced roulette genetic algorithm) is proposed with enhanced elite retention based on a SGA (simple genetic algorithm). The comparative experiment results of SGA, SEGA (strengthen elitist genetic algorithm), ERGA, and the analysis of the population evolution process show that ERGA is superior to SGA and SEGA in terms of time cost and optimization results through the reasonable combination of coding methods and selection operators. Furthermore, ERGA has higher generality and can be adapted to solve MVC collaboration network optimization models in different production-distribution environments.

Machine Learning Methods for Survival Analysis with Clinical and Transcriptomics Data of Breast Cancer

Breast cancer is one of the most common cancers in women worldwide, which causes an enormous number of deaths annually. However, early diagnosis of breast cancer can improve survival outcomes enabling simpler and more cost-effective treatments. The recent increase in data availability provides unprecedented opportunities to apply data-driven and machine learning methods to identify early-detection prognostic factors capable of predicting the expected survival and potential sensitivity to treatment of patients, with the final aim of enhancing clinical outcomes. This tutorial presents a protocol for applying machine learning models in survival analysis for both clinical and transcriptomic data. We show that integrating clinical and mRNA expression data is essential to explain the multiple biological processes driving cancer progression. Our results reveal that machine-learning-based models such as random survival forests, gradient boosted survival model, and survival support vector machine can outperform the traditional statistical methods, i.e., Cox proportional hazard model. The highest C-index among the machine learning models was recorded when using survival support vector machine, with a value 0.688, whereas the C-index recorded using the Cox model was 0.677. Shapley Additive Explanation (SHAP) values were also applied to identify the feature importance of the models and their impact on the prediction outcomes.

Enhanced Arithmetic Optimization Algorithm for Parameter Estimation of PID Controller

The Proportional-Integral-Derivative (PID) controller is a key component in most engineering applications. The main disadvantage of PID is the selection of the best values for its parameters using traditional methods that do not achieve the best response. In this work, the recently released empirical identification algorithm that is the Arithmetic Optimization Algorithm (AOA) was used to determine the best values of the PID parameters. AOA was selected due to its effective exploration ability. Unfortunately, AOA cannot achieve the best parameter values due to its poor exploitation of search space. Hence, the performance of the AOA exploit is improved by combining it with the Harris Hawk Optimization (HHO) algorithm which has an efficient exploit mechanism. In addition, avoidance of trapping in the local lower bounds of AOA-HHO is enhanced by the inclusion of perturbation and mutation factors. The proposed AOA-HHO algorithm is tested when choosing the best values for PID parameters to control two engineering applications namely DC motor regulation and three fluid level sequential tank systems. AOA-HHO has superiority over AOA and comparative algorithms.

Evaluating the Applications of Dendritic Neuron Model with Metaheuristic Optimization Algorithms for Crude-Oil-Production Forecasting

The forecasting and prediction of crude oil are necessary in enabling governments to compile their economic plans. Artificial neural networks (ANN) have been widely used in different forecasting and prediction applications, including in the oil industry. The dendritic neural regression (DNR) model is an ANNs that has showed promising performance in time-series prediction. The DNR has the capability to deal with the nonlinear characteristics of historical data for time-series forecasting applications. However, it faces certain limitations in training and configuring its parameters. To this end, we utilized the power of metaheuristic optimization algorithms to boost the training process and optimize its parameters. A comprehensive evaluation is presented in this study with six MH optimization algorithms used for this purpose: whale optimization algorithm (WOA), particle swarm optimization algorithm (PSO), genetic algorithm (GA), sine-cosine algorithm (SCA), differential evolution (DE), and harmony search algorithm (HS). We used oil-production datasets for historical records of crude oil production from seven real-world oilfields (from Tahe oilfields, in China), provided by a local partner. Extensive evaluation experiments were carried out using several performance measures to study the validity of the DNR with MH optimization methods in time-series applications. The findings of this study have confirmed the applicability of MH with DNR. The applications of MH methods improved the performance of the original DNR. We also concluded that the PSO and WOA achieved the best performance compared with other methods.

Enhanced feature selection technique using slime mould algorithm: a case study on chemical data

Feature selection techniques are considered one of the most important preprocessing steps, which has the most significant influence on the performance of data analysis and decision making. These FS techniques aim to achieve several objectives (such as reducing classification error and minimizing the number of features) at the same time to increase the classification rate. FS based on Metaheuristic (MH) is considered one of the most promising techniques to improve the classification process. This paper presents a modified method of the Slime mould algorithm depending on the Marine Predators Algorithm (MPA) operators as a local search strategy, which leads to increasing the convergence rate of the developed method, named SMAMPA and avoiding the attraction to local optima. The efficiency of SMAMPA is evaluated using twenty datasets and compared its results with the state-of-the-art FS methods. In addition, the applicability of SMAMPA to work with real-world problems is evaluated by using it as a quantitative structure-activity relationship (QSAR) model. The obtained results show the high ability of the developed SMAMPA method to reduce the dimension of the tested datasets by increasing the prediction rate. In addition, it provides results better than other FS techniques in terms of performance metrics.

Estimation of heavy metal concentrations (Cd and Pb) in plant leaves using optimal spectral indicators and artificial neural networks

The necessity of continuously monitoring the agricultural products in terms of their health has enforced the development of rapid, low-cost, and non-destructive monitoring solutions. Heavy metal contamination of the plants is known as a source of health threats that are made by their proximities with pollutant soil, water, and air. In this paper, a method was proposed to measure lead (Pb) and cadmium (Cd) contamination of plant leaves through field spectrometry as a low-cost solution for continuous monitoring. The study area was Mahneshan county of Zanjan province in Iran with rich heavy metal mines that have more potential for plant contamination. At first, we collected different plant samples throughout the study area and measured the Pb and Cd concentrations using ICP-AES, in which we observed that the concentrations of Pb and Cd are in the range of 1.4 ~ 282.6 and 0.3 ~ 66.7 μgg-1, respectively, and then we tried to find the optimum estimator model through a multi-objective version of genetic algorithm (GA) optimization that finds simultaneously the structure of an artificial neural network and its input features. The features extracted from the raw spectrums have been collimated to be compatible with the Sentinel-2 multispectral bands for the possibility of further developments. The results demonstrate the efficiency of the optimum estimator model in estimation of the leaves' Pb and Cd contamination, irrespective of the plant type, which has reached the R2 of 0.99 and 0.85 for Pb and Cd, respectively. Additionally, the results suggested that the 783-, 842-, and 865-nm spectral bands, which are similar to the 7, 8, and 8a sentinel-2 spectral bands, are more efficient for this purpose.

An Improved Genetic Algorithm for Location Allocation Problem with Grey Theory in Public Health Emergencies

The demand for emergency medical facilities (EMFs) has witnessed an explosive growth recently due to the COVID-19 pandemic and the rapid spread of the virus. To expedite the location of EMFs and the allocation of patients to these facilities at times of disaster, a location-allocation problem (LAP) model that can help EMFs cope with major public health emergencies was proposed in this study. Given the influence of the number of COVID-19-infected persons on the demand for EMFs, a grey forecasting model was also utilized to predict the accumulative COVID-19 cases during the pandemic and to calculate the demand for EMFs. A serial-number-coded genetic algorithm (SNCGA) was proposed, and dynamic variation was used to accelerate the convergence. This algorithm was programmed using MATLAB, and the emergency medical facility LAP (EMFLAP) model was solved using the simple (standard) genetic algorithm (SGA) and SNCGA. Results show that the EMFLAP plan based on SNCGA consumes 8.34% less time than that based on SGA, and the calculation time of SNCGA is 20.25% shorter than that of SGA. Therefore, SNCGA is proven convenient for processing the model constraint conditions, for naturally describing the available solutions to a problem, for improving the complexity of algorithms, and for reducing the total time consumed by EMFLAP plans. The proposed method can guide emergency management personnel in designing an EMFLAP decision scheme.

Automatic Text Summarization for Hindi Using Real Coded Genetic Algorithm

In the present scenario, Automatic Text Summarization (ATS) is in great demand to address the ever-growing volume of text data available online to discover relevant information faster. In this research, the ATS methodology is proposed for the Hindi language using Real Coded Genetic Algorithm (RCGA) over the health corpus, available in the Kaggle dataset. The methodology comprises five phases: preprocessing, feature extraction, processing, sentence ranking, and summary generation. Rigorous experimentation on varied feature sets is performed where distinguishing features, namely- sentence similarity and named entity features are combined with others for computing the evaluation metrics. The top 14 feature combinations are evaluated through Recall-Oriented Understudy for Gisting Evaluation (ROUGE) measure. RCGA computes appropriate feature weights through strings of features, chromosomes selection, and reproduction operators: Simulating Binary Crossover and Polynomial Mutation. To extract the highest scored sentences as the corpus summary, different compression rates are tested. In comparison with existing summarization tools, the ATS extractive method gives a summary reduction of 65%.

Binary Aquila Optimizer for Selecting Effective Features from Medical Data: A COVID-19 Case Study

Medical technological advancements have led to the creation of various large datasets with numerous attributes. The presence of redundant and irrelevant features in datasets negatively influences algorithms and leads to decreases in the performance of the algorithms. Using effective features in data mining and analyzing tasks such as classification can increase the accuracy of the results and relevant decisions made by decision-makers using them. This increase can become more acute when dealing with challenging, large-scale problems in medical applications. Nature-inspired metaheuristics show superior performance in finding optimal feature subsets in the literature. As a seminal attempt, a wrapper feature selection approach is presented on the basis of the newly proposed Aquila optimizer (AO) in this work. In this regard, the wrapper approach uses AO as a search algorithm in order to discover the most effective feature subset. S-shaped binary Aquila optimizer (SBAO) and V-shaped binary Aquila optimizer (VBAO) are two binary algorithms suggested for feature selection in medical datasets. Binary position vectors are generated utilizing S- and V-shaped transfer functions while the search space stays continuous. The suggested algorithms are compared to six recent binary optimization algorithms on seven benchmark medical datasets. In comparison to the comparative algorithms, the gained results demonstrate that using both proposed BAO variants can improve the classification accuracy on these medical datasets. The proposed algorithm is also tested on the real-dataset COVID-19. The findings testified that SBAO outperforms comparative algorithms regarding the least number of selected features with the highest accuracy.

ST-AL: a hybridized search based metaheuristic computational algorithm towards optimization of high dimensional industrial datasets

The rapid growth of data generated by several applications like engineering, biotechnology, energy, and others has become a crucial challenge in the high dimensional data mining. The large amounts of data, especially those with high dimensions, may contain many irrelevant, redundant, or noisy features, which may negatively affect the accuracy and efficiency of the industrial data mining process. Recently, several meta-heuristic optimization algorithms have been utilized to evolve feature selection techniques for dealing with the vast dimensionality problem. Despite optimization algorithms' ability to find the near-optimal feature subset of the search space, they still face some global optimization challenges. This paper proposes an improved version of the sooty tern optimization (ST) algorithm, namely the ST-AL method, to improve the search performance for high-dimensional industrial optimization problems. ST-AL method is developed by boosting the performance of STOA by applying four strategies. The first strategy is the use of a control randomization parameters that ensure the balance between the exploration-exploitation stages during the search process; moreover, it avoids falling into local optimums. The second strategy entails the creation of a new exploration phase based on the Ant lion (AL) algorithm. The third strategy is improving the STOA exploitation phase by modifying the main equation of position updating. Finally, the greedy selection is used to ignore the poor generated population and keeps it from diverging from the existing promising regions. To evaluate the performance of the proposed ST-AL algorithm, it has been employed as a global optimization method to discover the optimal value of ten CEC2020 benchmark functions. Also, it has been applied as a feature selection approach on 16 benchmark datasets in the UCI repository and compared with seven well-known optimization feature selection methods. The experimental results reveal the superiority of the proposed algorithm in avoiding local minima and increasing the convergence rate. The experimental result are compared with state-of-the-art algorithms, i.e., ALO, STOA, PSO, GWO, HHO, MFO, and MPA and found that the mean accuracy achieved is in range 0.94-1.00.

Arithmetic Optimization with RetinaNet Model for Motor Imagery Classification on Brain Computer Interface

Brain Computer Interface (BCI) technology commonly used to enable communication for the person with movement disability. It allows the person to communicate and control assistive robots by the use of electroencephalogram (EEG) or other brain signals. Though several approaches have been available in the literature for learning EEG signal feature, the deep learning (DL) models need to further explore for generating novel representation of EEG features and accomplish enhanced outcomes for MI classification. With this motivation, this study designs an arithmetic optimization with RetinaNet based deep learning model for MI classification (AORNDL-MIC) technique on BCIs. The proposed AORNDL-MIC technique initially exploits Multiscale Principal Component Analysis (MSPCA) approach for the EEG signal denoising and Continuous Wavelet Transform (CWT) is exploited for the transformation of 1D-EEG signal into 2D time-frequency amplitude representation, which enables to utilize the DL model via transfer learning approach. In addition, the DL based RetinaNet is applied for extracting of feature vectors from the EEG signal which are then classified with the help of ID3 classifier. In order to optimize the classification efficiency of the AORNDL-MIC technique, arithmetical optimization algorithm (AOA) is employed for hyperparameter tuning of the RetinaNet. The experimental analysis of the AORNDL-MIC algorithm on the benchmark data sets reported its promising performance over the recent state of art methodologies.

Enhanced Feature Selection Based on Integration Containment Neighborhoods Rough Set Approximations and Binary Honey Badger Optimization

This article appoints a novel model of rough set approximations (RSA), namely, rough set approximation models build on containment neighborhoods RSA (CRSA), that generalize the traditional notions of RSA and obtain valuable consequences by minifying the boundary areas. To justify this extension, it is integrated with the binary version of the honey badger optimization (HBO) algorithm as a feature selection (FS) approach. The main target of using this extension is to assess the quality of selected features. To evaluate the performance of BHBO based on CRSA, a set of ten datasets is used. In addition, the results of BHOB are compared with other well-known FS approaches. The results show the superiority of CRSA over the traditional RS approximations. In addition, they illustrate the high ability of BHBO to improve the classification accuracy overall the compared methods in terms of performance metrics.

Nature-inspired optimization algorithms and their significance in multi-thresholding image segmentation: an inclusive review

Multilevel Thresholding (MLT) is considered as a significant and imperative research field in image segmentation that can efficiently resolve difficulties aroused while analyzing the segmented regions of multifaceted images with complicated nonlinear conditions. MLT being a simple exponential combinatorial optimization problem is commonly phrased by means of a sophisticated objective function requirement that can only be addressed by nondeterministic approaches. Consequently, researchers are engaging Nature-Inspired Optimization Algorithms (NIOA) as an alternate methodology that can be widely employed for resolving problems related to MLT. This paper delivers an acquainted review related to novel NIOA shaped lately in last three years (2019-2021) highlighting and exploring the major challenges encountered during the development of image multi-thresholding models based on NIOA.

Analysis of Nanofluid Particles in a Duct with Thermal Radiation by Using an Efficient Metaheuristic-Driven Approach

This study investigated the steady two-phase flow of a nanofluid in a permeable duct with thermal radiation, a magnetic field, and external forces. The basic continuity and momentum equations were considered along with the Buongiorno model to formulate the governing mathematical model of the problem. Furthermore, the intelligent computational strength of artificial neural networks (ANNs) was utilized to construct the approximate solution for the problem. The unsupervised objective functions of the governing equations in terms of mean square error were optimized by hybridizing the global search ability of an arithmetic optimization algorithm (AOA) with the local search capability of an interior point algorithm (IPA). The proposed ANN-AOA-IPA technique was implemented to study the effect of variations in the thermophoretic parameter (Nt), Hartmann number (Ha), Brownian (Nb) and radiation (Rd) motion parameters, Eckert number (Ec), Reynolds number (Re) and Schmidt number (Sc) on the velocity profile, thermal profile, Nusselt number and skin friction coefficient of the nanofluid. The results obtained by the designed metaheuristic algorithm were compared with the numerical solutions obtained by the Runge–Kutta method of order 4 (RK-4) and machine learning algorithms based on a nonlinear autoregressive network with exogenous inputs (NARX) and backpropagated Levenberg–Marquardt algorithm. The mean percentage errors in approximate solutions obtained by ANN-AOA-IPA are around 10−6 to 10−7. The graphical analysis illustrates that the velocity, temperature, and concentration profiles of the nanofluid increase with an increase in the suction parameter, Eckert number and Schmidt number, respectively. Solutions and the results of performance indicators such as mean absolute deviation, Theil’s inequality coefficient and error in Nash–Sutcliffe efficiency further validate the proposed algorithm’s utility and efficiency.

An Arithmetic-Trigonometric Optimization Algorithm with Application for Control of Real-Time Pressure Process Plant

This paper proposes a novel hybrid arithmetic-trigonometric optimization algorithm (ATOA) using different trigonometric functions for complex and continuously evolving real-time problems. The proposed algorithm adopts different trigonometric functions, namely sin, cos, and tan, with the conventional sine cosine algorithm (SCA) and arithmetic optimization algorithm (AOA) to improve the convergence rate and optimal search area in the exploration and exploitation phases. The proposed algorithm is simulated with 33 distinct optimization test problems consisting of multiple dimensions to showcase the effectiveness of ATOA. Furthermore, the different variants of the ATOA optimization technique are used to obtain the controller parameters for the real-time pressure process plant to investigate its performance. The obtained results have shown a remarkable performance improvement compared with the existing algorithms.

An Improved Moth-Flame Optimization Algorithm with Adaptation Mechanism to Solve Numerical and Mechanical Engineering Problems

Moth-flame optimization (MFO) algorithm inspired by the transverse orientation of moths toward the light source is an effective approach to solve global optimization problems. However, the MFO algorithm suffers from issues such as premature convergence, low population diversity, local optima entrapment, and imbalance between exploration and exploitation. In this study, therefore, an improved moth-flame optimization (I-MFO) algorithm is proposed to cope with canonical MFO's issues by locating trapped moths in local optimum via defining memory for each moth. The trapped moths tend to escape from the local optima by taking advantage of the adapted wandering around search (AWAS) strategy. The efficiency of the proposed I-MFO is evaluated by CEC 2018 benchmark functions and compared against other well-known metaheuristic algorithms. Moreover, the obtained results are statistically analyzed by the Friedman test on 30, 50, and 100 dimensions. Finally, the ability of the I-MFO algorithm to find the best optimal solutions for mechanical engineering problems is evaluated with three problems from the latest test-suite CEC 2020. The experimental and statistical results demonstrate that the proposed I-MFO is significantly superior to the contender algorithms and it successfully upgrades the shortcomings of the canonical MFO.

EWOA-OPF: Effective Whale Optimization Algorithm to Solve Optimal Power Flow Problem

The optimal power flow (OPF) is a vital tool for optimizing the control parameters of a power system by considering the desired objective functions subject to system constraints. Metaheuristic algorithms have been proven to be well-suited for solving complex optimization problems. The whale optimization algorithm (WOA) is one of the well-regarded metaheuristics that is widely used to solve different optimization problems. Despite the use of WOA in different fields of application as OPF, its effectiveness is decreased as the dimension size of the test system is increased. Therefore, in this paper, an effective whale optimization algorithm for solving optimal power flow problems (EWOA-OPF) is proposed. The main goal of this enhancement is to improve the exploration ability and maintain a proper balance between the exploration and exploitation of the canonical WOA. In the proposed algorithm, the movement strategy of whales is enhanced by introducing two new movement strategies: (1) encircling the prey using Levy motion and (2) searching for prey using Brownian motion that cooperate with canonical bubble-net attacking. To validate the proposed EWOA-OPF algorithm, a comparison among six well-known optimization algorithms is established to solve the OPF problem. All algorithms are used to optimize single- and multi-objective functions of the OPF under the system constraints. Standard IEEE 6-bus, IEEE 14-bus, IEEE 30-bus, and IEEE 118-bus test systems are used to evaluate the proposed EWOA-OPF and comparative algorithms for solving the OPF problem in diverse power system scale sizes. The comparison of results proves that the EWOA-OPF is able to solve single- and multi-objective OPF problems with better solutions than other comparative algorithms.

Robust Model Predictive Control Paradigm for Automatic Voltage Regulators against Uncertainty Based on Optimization Algorithms

This paper introduces a robust model predictive controller (MPC) to operate an automatic voltage regulator (AVR). The design strategy tends to handle the uncertainty issue of the AVR parameters. Frequency domain conditions are derived from the Hermite–Biehler theorem to maintain the stability of the perturbed system. The tuning of the MPC parameters is performed based on a new evolutionary algorithm named arithmetic optimization algorithm (AOA), while the expert designers use trial and error methods to achieve this target. The stability constraints are handled during the tuning process. An effective time-domain objective is formulated to guarantee good performance for the AVR by minimizing the voltage maximum overshoot and the response settling time simultaneously. The results of the suggested AOA-based robust MPC are compared with various techniques in the literature. The system response demonstrates the effectiveness and robustness of the proposed strategy with low control effort against the voltage variations and the parameters’ uncertainty compared with other techniques.

DMFO-CD: A Discrete Moth-Flame Optimization Algorithm for Community Detection

In this paper, a discrete moth–flame optimization algorithm for community detection (DMFO-CD) is proposed. The representation of solution vectors, initialization, and movement strategy of the continuous moth–flame optimization are purposely adapted in DMFO-CD such that it can solve the discrete community detection. In this adaptation, locus-based adjacency representation is used to represent the position of moths and flames, and the initialization process is performed by considering the community structure and the relation between nodes without the need of any knowledge about the number of communities. Solution vectors are updated by the adapted movement strategy using a single-point crossover to distance imitating, a two-point crossover to calculate the movement, and a single-point neighbor-based mutation that can enhance the exploration and balance exploration and exploitation. The fitness function is also defined based on modularity. The performance of DMFO-CD was evaluated on eleven real-world networks, and the obtained results were compared with five well-known algorithms in community detection, including GA-Net, DPSO-PDM, GACD, EGACD, and DECS in terms of modularity, NMI, and the number of detected communities. Additionally, the obtained results were statistically analyzed by the Wilcoxon signed-rank and Friedman tests. In the comparison with other comparative algorithms, the results show that the proposed DMFO-CD is competitive to detect the correct number of communities with high modularity.