COVIDOA: a novel evolutionary optimization algorithm based on coronavirus disease replication lifecycle

A novel collocation method with a coronavirus optimization algorithm for the optimal control of COVID-19: A case study of Wuhan, China

In this study, we develop a numerical optimization approach to address the challenge of optimal control in the spread of COVID-19. We evaluate the impact of various control strategies aimed at reducing the number of exposed and infectious individuals. Our novel approach employs Legendre wavelets, their derivative operational matrix, and a collocation method to transform the COVID-19 transmission optimal control model into a nonlinear programming (NLP) problem. To solve this problem, we employ a coronavirus optimization algorithm (COVIDOA) to determine the optimal control, state variables, and objective value. We investigate three control plans for this highly contagious disease, focusing on individual protection, rapid detection and treatment, detection with delay in treatment, and environmental viral dispersion as time-based control functions. These strategies are applied within an SEIR-type control model specific to COVID-19 in China, designed to mitigate disease spread. Lastly, we analyze the effects of various parameters within the COVID-19 spread model. Our numerical results highlight the significant impact of strategies that minimize the number of exposed and infectious individuals, particularly those related to rapid detection, detection delay, and environmental viral dispersion, in controlling and preventing the transmission of the COVID-19 virus.

Boosting prairie dog optimizer for optimal planning of multiple wind turbine and photovoltaic distributed generators in distribution networks considering different dynamic load models

Deploying distributed generators (DGs) supplied by renewable energy resources poses a significant challenge for efficient power grid operation. The proper sizing and placement of DGs, specifically photovoltaics (PVs) and wind turbines (WTs), remain crucial due to the uncertain characteristics of renewable energy. To overcome these challenges, this study explores an enhanced version of a meta-heuristic technique called the prairie dog optimizer (PDO). The modified prairie dogs optimizer (mPDO) incorporates a novel exploration phase inspired by the slime mold algorithm (SMA) food approach. The mPDO algorithm is proposed to analyze the substantial effects of different dynamic load characteristics on the performance of the distribution networks and the designing of the PV-based and WT-based DGs. The optimization problem incorporates various operational constraints to mitigate energy loss in the distribution networks. Further, the study addresses uncertainties related to the random characteristics of PV and WT power outputs by employing appropriate probability distributions. The mPDO algorithm is evaluated using cec2020 benchmark suit test functions and rigorous statistical analysis to mathematically measure its success rate and efficacy while considering different type of optimization problems. The developed mPDO algorithm is applied to incorporate both PV and WT units, individually and simultaneously, into the IEEE 69-bus distribution network. This is achieved considering residential, commercial, industrial, and mixed time-varying voltage-dependent load demands. The efficacy of the modified algorithm is demonstrated using the standard benchmark functions, and a comparative analysis is conducted with the original PDO and other well-known algorithms, utilizing various statistical metrics. The numerical findings emphasize the significant influence of load type and time-varying generation in DG planning. Moreover, the mPDO algorithm beats the alternatives and improves distributed generators' technical advantages across all examined scenarios.

Maximizing solar radiations of PV panels using artificial gorilla troops reinforced by experimental investigations

This article's main objective is to maximize solar radiations (SRs) through the use of the gorilla troop algorithm (GTA) for identifying the optimal tilt angle (OTA) for photovoltaic (PV) panels. This is done in conjunction with an experimental work that consists of three 100 W PV panels tilted at three different tilt angles (TAs). The 28°, 30°, and 50° are the three TAs. The experimental data are collected every day for 181-day and revealed that the TA of 28° is superior to those of 50° and 30°. The GTA calculated the OTA to be 28.445°, which agrees with the experimental results, which show a TA of 28°. The SR of the 28o TA is 59.3% greater than that of the 50° TA and 4.5% higher than that of the 30° TA. Recent methods are used to compare the GTA with the other nine metaheuristics (MHTs)-the genetic algorithm, particle swarm, harmony search, ant colony, cuckoo search, bee colony, fire fly, grey wolf, and coronavirus disease optimizers-in order to figure out the optimal OTA. The OTA is calculated by the majority of the nine MHTs to be 28.445°, which is the same as the GTA and confirms the experimental effort. In only 181-day, the by experimentation it may be documented SR difference between the TAs of 28° and 50° TA is 159.3%. Numerous performance metrics are used to demonstrate the GTA's viability, and it is contrasted with other recent optimizers that are in competition.

Multilevel Threshold Segmentation of Skin Lesions in Color Images Using Coronavirus Optimization Algorithm

Skin Cancer (SC) is among the most hazardous due to its high mortality rate. Therefore, early detection of this disease would be very helpful in the treatment process. Multilevel Thresholding (MLT) is widely used for extracting regions of interest from medical images. Therefore, this paper utilizes the recent Coronavirus Disease Optimization Algorithm (COVIDOA) to address the MLT issue of SC images utilizing the hybridization of Otsu, Kapur, and Tsallis as fitness functions. Various SC images are utilized to validate the performance of the proposed algorithm. The proposed algorithm is compared to the following five meta-heuristic algorithms: Arithmetic Optimization Algorithm (AOA), Sine Cosine Algorithm (SCA), Reptile Search Algorithm (RSA), Flower Pollination Algorithm (FPA), Seagull Optimization Algorithm (SOA), and Artificial Gorilla Troops Optimizer (GTO) to prove its superiority. The performance of all algorithms is evaluated using a variety of measures, such as Mean Square Error (MSE), Peak Signal-To-Noise Ratio (PSNR), Feature Similarity Index Metric (FSIM), and Normalized Correlation Coefficient (NCC). The results of the experiments prove that the proposed algorithm surpasses several competing algorithms in terms of MSE, PSNR, FSIM, and NCC segmentation metrics and successfully solves the segmentation issue.

A hierarchical multi-leadership sine cosine algorithm to dissolving global optimization and data classification: The COVID-19 case study

The Sine Cosine Algorithm (SCA) is an outstanding optimizer that is appreciably used to dissolve complicated real-world problems. Nevertheless, this algorithm lacks sufficient population diversification and a sufficient balance between exploration and exploitation. So, effective techniques are required to tackle the SCA's fundamental shortcomings. Accordingly, the present paper suggests an improved version of SCA called Hierarchical Multi-Leadership SCA (HMLSCA) which uses an effective hierarchical multi-leadership search mechanism to lead the search process on multiple paths. The efficiency of the HMLSCA has been appraised and compared with a set of famous metaheuristic algorithms to dissolve the classical eighteen benchmark functions and thirty CEC 2017 test suites. The results demonstrate that the HMLSCA outperforms all compared algorithms and that the proposed algorithm provided a promising efficiency. Moreover, the HMLSCA was applied to handle the medicine data classification by optimizing the support vector machine's (SVM) parameters and feature weighting in eight datasets. The experiential outcomes verify the productivity of the HMLSCA with the highest classification accuracy and a gain scoring 1.00 Friedman mean rank versus the other evaluated metaheuristic algorithms. Furthermore, the proposed algorithm was used to diagnose COVID-19, in which it attained the topmost accuracy of 98% in diagnosing the infection on the COVID-19 dataset, which proves the performance of the proposed search strategy.

Human Activity Recognition Using Hybrid Coronavirus Disease Optimization Algorithm for Internet of Medical Things

BACKGROUND

In our current digital world, smartphones are no longer limited to communication but are used in various real-world applications. In the healthcare industry, smartphones have sensors that can record data about our daily activities. Such data can be used for many healthcare purposes, such as elderly healthcare services, early disease diagnoses, and archiving patient data for further use. However, the data collected from the various sensors involve high dimensional features, which are not equally helpful in human activity recognition (HAR).

METHODS

This paper proposes an algorithm for selecting the most relevant subset of features that will contribute efficiently to the HAR process. The proposed method is based on a hybrid version of the recent Coronavirus Disease Optimization Algorithm (COVIDOA) with Simulated Annealing (SA). SA algorithm is merged with COVIDOA to improve its performance and help escape the local optima problem.

RESULTS

The UCI-HAR dataset from the UCI machine learning repository assesses the proposed algorithm's performance. A comparison is conducted with seven well-known feature selection algorithms, including the Arithmetic Optimization Algorithm (AOA), Gray Wolf Optimizer (GWO), Whale Optimization Algorithm (WOA), Reptile Search Algorithm (RSA), Zebra Optimization Algorithm (ZOA), Gradient-Based Optimizer (GBO), Seagull Optimization Algorithm (SOA), and Coyote Optimization Algorithm (COA) regarding fitness, STD, accuracy, size of selected subset, and processing time.

CONCLUSIONS

The results proved that the proposed approach outperforms state-of-the-art HAR techniques, achieving an average performance of 97.82% in accuracy and a reduction ratio in feature selection of 52.7%.

A Comprehensive Survey on Aquila Optimizer

Aquila Optimizer (AO) is a well-known nature-inspired optimization algorithm (NIOA) that was created in 2021 based on the prey grabbing behavior of Aquila. AO is a population-based NIOA that has demonstrated its effectiveness in the field of complex and nonlinear optimization in a short period of time. As a result, the purpose of this study is to provide an updated survey on the topic. This survey accurately reports on the designed enhanced AO variations and their applications. In order to properly assess AO, a rigorous comparison between AO and its peer NIOAs is conducted over mathematical benchmark functions. The experimental results show the AO provides competitive outcomes.

MOCOVIDOA: a novel multi-objective coronavirus disease optimization algorithm for solving multi-objective optimization problems

A novel multi-objective Coronavirus disease optimization algorithm (MOCOVIDOA) is presented to solve global optimization problems with up to three objective functions. This algorithm used an archive to store non-dominated POSs during the optimization process. Then, a roulette wheel selection mechanism selects the effective archived solutions by simulating the frameshifting technique Coronavirus particles use for replication. We evaluated the efficiency by solving twenty-seven multi-objective (21 benchmarks & 6 real-world engineering design) problems, where the results are compared against five common multi-objective metaheuristics. The comparison uses six evaluation metrics, including IGD, GD, MS, SP, HV, and delta p (Δ P ). The obtained results and the Wilcoxon rank-sum test show the superiority of this novel algorithm over the existing algorithms and reveal its applicability in solving multi-objective problems.

Compression of Bio-Signals Using Block-Based Haar Wavelet Transform and COVIDOA for IoMT Systems

Background: Bio-signals are the essential data that smart healthcare systems require for diagnosing and treating common diseases. However, the amount of these signals that need to be processed and analyzed by healthcare systems is huge. Dealing with such a vast amount of data presents difficulties, such as the need for high storage and transmission capabilities. In addition, retaining the most useful clinical information in the input signal is essential while applying compression. Methods: This paper proposes an algorithm for the efficient compression of bio-signals for IoMT applications. This algorithm extracts the features of the input signal using block-based HWT and then selects the most important features for reconstruction using the novel COVIDOA. Results: We utilized two different public datasets for evaluation: MIT-BIH arrhythmia and EEG Motor Movement/Imagery, for ECG and EEG signals, respectively. The proposed algorithm’s average values for CR, PRD, NCC, and QS are 18.06, 0.2470, 0.9467, and 85.366 for ECG signals and 12.6668, 0.4014, 0.9187, and 32.4809 for EEG signals. Further, the proposed algorithm shows its efficiency over other existing techniques regarding processing time. Conclusions: Experiments show that the proposed method successfully achieved a high CR while maintaining an excellent level of signal reconstruction in addition to its reduced processing time compared with the existing techniques.

A penalty-based algorithm proposal for engineering optimization problems

This paper presents a population-based evolutionary computation model for solving continuous constrained nonlinear optimization problems. The primary goal is achieving better solutions in a specific problem type, regardless of metaphors and similarities. The proposed algorithm assumes that candidate solutions interact with each other to have better fitness values. The interaction between candidate solutions is limited with the closest neighbors by considering the Euclidean distance. Furthermore, Tabu Search Algorithm and Elitism selection approach inspire the memory usage of the proposed algorithm. Besides, this algorithm is structured on the principle of the multiplicative penalty approach that considers satisfaction rates, the total deviations of constraints, and the objective function value to handle continuous constrained problems very well. The performance of the algorithm is evaluated with real-world engineering design optimization benchmark problems that belong to the most used cases by evolutionary optimization researchers. Experimental results show that the proposed algorithm produces satisfactory results compared to the other algorithms published in the literature. The primary purpose of this study is to provide an algorithm that reaches the best-known solution values rather than duplicating existing algorithms through a new metaphor. We constructed the proposed algorithm with the best combination of features to achieve better solutions. Different from similar algorithms, constrained engineering problems are handled in this study. Thus, it aims to prove that the proposed algorithm gives better results than similar algorithms and other algorithms developed in the literature.