Multistrategy-Boosted Carnivorous Plant Algorithm: Performance Analysis and Application in Engineering Designs

I-CPA: An Improved Carnivorous Plant Algorithm for Solar Photovoltaic Parameter Identification Problem

The carnivorous plant algorithm (CPA), which was recently proposed for solving optimization problems, is a population-based optimization algorithm inspired by plants. In this study, the exploitation phase of the CPA was improved with the teaching factor strategy in order to achieve a balance between the exploration and exploitation capabilities of CPA, minimize getting stuck in local minima, and produce more stable results. The improved CPA is called the I-CPA. To test the performance of the proposed I-CPA, it was applied to CEC2017 functions. In addition, the proposed I-CPA was applied to the problem of identifying the optimum parameter values of various solar photovoltaic modules, which is one of the real-world optimization problems. According to the experimental results, the best value of the root mean square error (RMSE) ratio between the standard data and simulation data was obtained with the I-CPA method. The Friedman mean rank statistical analyses were also performed for both problems. As a result of the analyses, it was observed that the I-CPA produced statistically significant results compared to some classical and modern metaheuristics. Thus, it can be said that the proposed I-CPA achieves successful and competitive results in identifying the parameters of solar photovoltaic modules.

Binary Sand Cat Swarm Optimization Algorithm for Wrapper Feature Selection on Biological Data

In large datasets, irrelevant, redundant, and noisy attributes are often present. These attributes can have a negative impact on the classification model accuracy. Therefore, feature selection is an effective pre-processing step intended to enhance the classification performance by choosing a small number of relevant or significant features. It is important to note that due to the NP-hard characteristics of feature selection, the search agent can become trapped in the local optima, which is extremely costly in terms of time and complexity. To solve these problems, an efficient and effective global search method is needed. Sand cat swarm optimization (SCSO) is a newly introduced metaheuristic algorithm that solves global optimization algorithms. Nevertheless, the SCSO algorithm is recommended for continuous problems. bSCSO is a binary version of the SCSO algorithm proposed here for the analysis and solution of discrete problems such as wrapper feature selection in biological data. It was evaluated on ten well-known biological datasets to determine the effectiveness of the bSCSO algorithm. Moreover, the proposed algorithm was compared to four recent binary optimization algorithms to determine which algorithm had better efficiency. A number of findings demonstrated the superiority of the proposed approach both in terms of high prediction accuracy and small feature sizes.