Background and aim: Machine learning methods are examined by many researchers to identify weeds in crop images captured by drones. However, metaheuristic optimization is rarely used in optimizing the machine learning models used in weed classification. Therefore, this research targets developing a new optimization algorithm that can be used to optimize machine learning models and ensemble models to boost the classification accuracy of weed images. Methodology: This work proposes a new approach for classifying weed and wheat images captured by a sprayer drone. The proposed approach is based on a voting classifier that consists of three base models, namely, neural networks (NNs), support vector machines (SVMs), and K-nearest neighbors (KNN). This voting classifier is optimized using a new optimization algorithm composed of a hybrid of sine cosine and grey wolf optimizers. The features used in training the voting classifier are extracted based on AlexNet through transfer learning. The significant features are selected from the extracted features using a new feature selection algorithm. Results: The accuracy, precision, recall, false positive rate, and kappa coefficient were employed to assess the performance of the proposed voting classifier. In addition, a statistical analysis is performed using the one-way analysis of variance (ANOVA), and Wilcoxon signed-rank tests to measure the stability and significance of the proposed approach. On the other hand, a sensitivity analysis is performed to study the behavior of the parameters of the proposed approach in achieving the recorded results. Experimental results confirmed the effectiveness and superiority of the proposed approach when compared to the other competing optimization methods. The achieved detection accuracy using the proposed optimized voting classifier is 97.70%, F-score is 98.60%, specificity is 95.20%, and sensitivity is 98.40%. Conclusion: The proposed approach is confirmed to achieve better classification accuracy and outperforms other competing approaches.

The world is still trying to recover from the devastation caused by the wide spread of COVID-19, and now the monkeypox virus threatens becoming a worldwide pandemic. Although the monkeypox virus is not as lethal or infectious as COVID-19, numerous countries report new cases daily. Thus, it is not surprising that necessary precautions have not been taken, and it will not be surprising if another worldwide pandemic occurs. Machine learning has recently shown tremendous promise in image-based diagnosis, including cancer detection, tumor cell identification, and COVID-19 patient detection. Therefore, a similar application may be implemented to diagnose monkeypox as it invades the human skin. An image can be acquired and utilized to further diagnose the condition. In this paper, two algorithms are proposed for improving the classification accuracy of monkeypox images. The proposed algorithms are based on transfer learning for feature extraction and meta-heuristic optimization for feature selection and optimization of the parameters of a multi-layer neural network. The GoogleNet deep network is adopted for feature extraction, and the utilized meta-heuristic optimization algorithms are the Al-Biruni Earth radius algorithm, the sine cosine algorithm, and the particle swarm optimization algorithm. Based on these algorithms, a new binary hybrid algorithm is proposed for feature selection, along with a new hybrid algorithm for optimizing the parameters of the neural network. To evaluate the proposed algorithms, a publicly available dataset is employed. The assessment of the proposed optimization of feature selection for monkeypox classification was performed in terms of ten evaluation criteria. In addition, a set of statistical tests was conducted to measure the effectiveness, significance, and robustness of the proposed algorithms. The results achieved confirm the superiority and effectiveness of the proposed methods compared to other optimization methods. The average classification accuracy was 98.8%.

Attempting to address optimization problems in various scientific disciplines is a fundamental and significant difficulty requiring optimization. This study presents the waterwheel plant technique (WWPA), a novel stochastic optimization technique motivated by natural systems. The proposed WWPA’s basic concept is based on modeling the waterwheel plant’s natural behavior while on a hunting expedition. To find prey, WWPA uses plants as search agents. We present WWPA’s mathematical model for use in addressing optimization problems. Twenty-three objective functions of varying unimodal and multimodal types were used to assess WWPA’s performance. The results of optimizing unimodal functions demonstrate WWPA’s strong exploitation ability to get close to the optimal solution, while the results of optimizing multimodal functions show WWPA’s strong exploration ability to zero in on the major optimal region of the search space. Three engineering design problems were also used to gauge WWPA’s potential for improving practical programs. The effectiveness of WWPA in optimization was evaluated by comparing its results with those of seven widely used metaheuristic algorithms. When compared with eight competing algorithms, the simulation results and analyses demonstrate that WWPA outperformed them by finding a more proportionate balance between exploration and exploitation.

Metaheuristic algorithms have successfully been used to solve any type of optimization problem in the field of structural engineering. The newly proposed Arithmetic Optimization Algorithm (AOA) has recently been presented for mathematical problems. The AOA is a metaheuristic that uses the main arithmetic operators’ distribution behavior, such as multiplication, division, subtraction, and addition in mathematics. In this paper, a dynamic version of the arithmetic optimization algorithm (DAOA) is presented. During an optimization process, a new candidate solution change to regulate exploration and exploitation in a dynamic version in each iteration. The most remarkable attribute of DAOA is that it does not need to make any effort to preliminary fine-tuning parameters relative to the most present metaheuristic. Also, the new accelerator functions are added for a better search phase. To evaluate the performance of both the AOA and its dynamic version, minimizing the weight of several truss structures under frequency bound is tested. These algorithms ’ efficiency is obtained by five classical engineering problems and optimizing different truss structures under various loading conditions and limitations.