Explore the vast range of titles available.

The conventional blind source separation independent component analysis method has the problem of low-separation performance. In addition, the basic butterfly optimization algorithm has the problem of insufficient search capability. In order to solve the above problems, an independent component analysis method based on the double-mutant butterfly optimization algorithm (DMBOA) is proposed in this paper. The proposed method employs the kurtosis of the signal as the objective function. By optimizing the objective function, blind source separation of the signals is realized. Based on the original butterfly optimization algorithm, DMBOA introduces dynamic transformation probability and population reconstruction mechanisms to coordinate global and local search, and when the optimization stagnates, the population is reconstructed to increase diversity and avoid falling into local optimization. The differential evolution operator is introduced to mutate at the global position update, and the sine cosine operator is introduced to mutate at the local position update, hence, enhancing the local search capability of the algorithm. To begin, 12 classical benchmark test problems were selected to evaluate the effectiveness of DMBOA. The results reveal that DMBOA outperformed the other benchmark algorithms. Following that, DMBOA was utilized for the blind source separation of mixed image and speech signals. The simulation results show that the DMBOA can realize the blind source separation of an observed signal successfully and achieve higher separation performance than the compared algorithms.

This study proposes a modified Elephant Herding Optimization algorithm to enhance the capability of a classical algorithm for convalescent convergence rate and precision to solve global optimization problems. The proposed Improved Elephant Herding Optimization (IEHO) uses an opposition learning-based initialization to get a better initial population. A sine cosine-based clan updating operator updates the clan individuals towards or outwards their clan leaders. Levy flight distribution with step size controller is applied to perform a local and global search on newly updated positions. The separating operator is modified to maintain a balance between exploration and exploitation of the algorithm. In addition, an elitism strategy is introduced to retain the fittest individual in the consequent iterations. The effectiveness of IEHO is validated on 97 benchmark functions which include unimodal, multimodal, and CEC-BC-2017 functions. The performance of IEHO is compared to fourteen state-of-the-art algorithms along with the winner algorithm of CEC-BC-2017. Friedman's mean rank test shows the dominance of the proposed algorithm for unimodal and multimodal functions. The proposed IEHO algorithm secures the best rank for all 97 benchmark functions. Finally, the applicability of IEHO is shown on five real-world engineering design problems. Results have proven that IEHO performed superior or equivalent to the algorithms reported in the literature and evaluated in this work.

The Ivy Optimization Algorithm (IVY) is a novel swarm intelligence optimization algorithm that simulates the phototropic growth mechanism of plants. To comprehensively improve the overall optimization performance, this paper proposes an enhanced Ivy Optimization Algorithm (LSIVY) integrating improved Logistics chaotic mapping, sine–cosine operator, and adaptive t-distribution mutation strategy. Firstly, an improved cascaded Logistics chaotic mapping is used for population initialization. The double arcsine transformation improves the ergodicity and uniformity of chaotic sequences, so that initial solutions are distributed more evenly in the search space, population diversity is enhanced, and premature convergence is suppressed. Secondly, the sine–cosine operator is embedded into the position update mechanisms of IVY growth, climbing, and propagation evolution. Nonlinearly decreasing control parameters realize adaptive switching between global exploration and local exploitation and accelerate convergence. Thirdly, an adaptive t-distribution mutation strategy is designed to dynamically adjust mutation intensity according to the iteration cycle and implement directional perturbation at the optimal solution position. It combines the large-scale exploration advantage of the Cauchy distribution and the local fine search merit of the Gaussian distribution, which significantly improves the ability to escape from local optima. Comparative experiments with eight mainstream metaheuristics (DE, WOA, GWO, HHO, DBO, MBWO, AOO, native IVY) are conducted with 30 independent runs on 30-dimensional CEC 2014 (30 test functions) and CEC 2020 (10 composite functions). Quantitatively, LSIVY achieves 20~30 orders of magnitude higher optimization accuracy than standard IVY on unimodal functions, and its average standard deviation across all benchmarks drops by 4–6 orders of magnitude. LSIVY ranks first on all CEC 2020 composite functions, reducing over 30% of iterations compared with native IVY. Three classical constrained mechanical design problems (three-bar truss, cantilever beam, pressure vessel) are adopted for engineering verification. In the pressure vessel case, the average manufacturing cost of LSIVY is reduced by 9.2% against standard IVY, and the standard deviation of three engineering cases decreases by 2–3 orders on average, demonstrating remarkable robustness. The proposed algorithm not only improves the theoretical system of plant-inspired swarm intelligence algorithms but also has great application prospects in mechanical structure lightweight design, industrial equipment cost optimization, and other practical engineering fields.

Short-term load forecasting is viewed as one promising technology for demand prediction under the most critical inputs for the promising arrangement of power plant units. Thus, it is imperative to present new incentive methods to motivate such power system operations for electricity management. This paper proposes an approach for short-term electric load forecasting using long short-term memory networks and an improved sine cosine algorithm called MetaREC. First, using long short-term memory networks for a special kind of recurrent neural network, the dispatching commands have the characteristics of storing and transmitting both long-term and short-term memories. Next, four important parameters are determined using the sine cosine algorithm base on a logistic chaos operator and multilevel modulation factor to overcome the inaccuracy of long short-term memory networks prediction, in terms of the manual selection of parameter values. Moreover, the performance of the MetaREC method outperforms others with regard to convergence accuracy and convergence speed on a variety of test functions. Finally, our analysis is extended to the scenario of the MetaREC_long short-term memory with back propagation neural network, long short-term memory networks with default parameters, long short-term memory networks with the conventional sine-cosine algorithm, and long short-term memory networks with whale optimization for power load forecasting on a real electric load dataset. Simulation results demonstrate that the multiple forecasts with MetaREC_long short-term memory can effectively incentivize the high accuracy and stability for short-term power load forecasting.

Since it is difficult for the traditional fault diagnosis method based on dissolved gas analysis (DGA) to meet today’s engineering needs in terms of diagnostic accuracy and stability, this paper proposes an artificial intelligence fault diagnosis method based on a probabilistic neural network (PNN) and bio-inspired optimizer. The PNN is used as the basic classifier of the fault diagnosis model, and the bio-inspired optimizer, improved salp swarm algorithm (ISSA), is used to optimize the hidden layer smoothing factor of PNN, which stably improves the classification performance of PNN. Compared with the traditional SSA, the sine cosine algorithm (SCA) and disruption operator are introduced in ISSA, which effectively improves the exploration capability and convergence speed. To verify the engineering applicability of the proposed method, the ISSA-PNN model was developed and tested using sensor data provided by Jiangxi Province Power Supply Company. In addition, the method is compared with machine learning methods such as support vector machine (SVM), back propagation neural network (BPNN), multi-layer perceptron (MLP), and traditional fault diagnosis methods such as the international electrotechnical commission (IEC) ratio method. The results show that the proposed method has a strong learning ability for complex fault data and has advantages in accuracy and robustness compared to other methods.

In recent years, growing peak pressure is posing a huge challenge for the operators of electrical power systems. As the most important clean renewable energy, hydropower is often advised as a response to the peak loads in China. Thus, a novel hybrid sine cosine algorithm (HSCA) is proposed to deal with the complex peak operation problem of cascade hydropower reservoirs. In HSCA, the elite-guide evolution strategy is embedded into the standard sine cosine algorithm to improve the convergence rate of the swarm. The Gaussian local search strategy is used to increase the diversity of the population. The random mutation operator is adopted to enhance the search capability of the individuals in the evolutionary process. The proposed method is applied to solve the complex peak operation problem of two hydropower systems. The simulations indicate that in different cases, HSCA can generate the scheduling results with higher quality than several benchmark methods. Hence, this paper provides a feasible method for the complex peak operation problem of cascade hydropower reservoirs.

The selection of attributes has become a crucial research focus in the domains of pattern recognition, machine learning, and big data analysis. In essence, the contemporary challenge revolves around reducing dimensionality while maintaining both a quick response time and improved classification performance. Metaheuristics algorithms (MAs) have emerged as pivotal tools in addressing this issue. Firstly, the problem of attribute selection was approached using the manta ray foraging optimization (MRFO) approach, but the majority of MAs suffer from a problem of convergence toward local minima. To mitigate this challenge, an enhanced variant of MRFO, known as MRFOSCA, employs trigonometric operators inspired by the sine cosine algorithm (SCA) to tackle the feature selection problem. The k -nearest neighbor ( k -NN) technique is employed for feature-set selection. Additionally, the statistical significance of the proposed algorithms is assessed using the nonparametric Wilcoxon’s rank-sum test at a 5% significance level. The outcomes are assessed and compared against some well-known MAs, including the original MRFO and SCA, as well as Harris Hawks optimizer, dragonfly algorithm, grasshopper optimizer algorithm, whale optimizer algorithm, salp swarm algorithm, and grey wolf optimizer. The experimental and comparison analyses validate the pretty effective performance of the proposed methods on low- and high-dimensional datasets by providing the highest accuracy in 85% of the feature selection benchmarks.

Due to technical advancements and the proliferation of mobile applications, facial analysis (FA) of humans has recently become an important area for computer vision research. FA investigates a variety of difficulties, including gender recognition, facial expression recognition, age and race recognition, with the goal of automatically comprehending social interactions. Due to the dimensional challenge posed by pre-trained CNN networks, the scientific community has developed numerous techniques inspired by biology, swarm intelligence theory, physics, and mathematical rules. This article presents a gender recognition system based on scAOA, that is a modified version of the Archimedes optimization algorithm (AOA). The latest variant (scAOA) enhances the exploitation stage by using trigonometric operators inspired by the sine cosine algorithm (SCA) in order to prevent local optima and to accelerate the convergence. The main purpose of this paper is to apply scAOA to select the relevant deep features provided by two pretrained models of CNN (AlexNet & ResNet) to recognize the gender of a human person categorized into two classes (men and women). Two datasets are used to evaluate the proposed approach (scAOA): the Brazilian FEI dataset and the Georgia Tech Face dataset (GT). In terms of accuracy, Fscore and statistical test, the comparison analysis demonstrates that scAOA outperforms other modern and competitive optimizers such as AOA, SCA, Ant lion optimizer (ALO), Salp swarm algorithm (SSA), Grey wolf optimizer (GWO), Simple genetic algorithm (SGA), Grasshopper optimization algorithm (GOA) and Particle swarm optimizer (PSO).

As one of recently proposed optimization algorithm, sine cosine algorithm (SCA) suffers from the problems of skipping over true solutions, stagnating in local optima and premature convergence. Therefore, an improved sine cosine algorithm with heterogeneous subpopulations (HSISCA) is developed in this paper. The population of HSISCA is divided into two subpopulations which comply with different search mechanisms and information sharing rules. One subpopulation is specified to enhance exploration by incorporating Levy flight and random search guidance into SCA, while the other is specified to enhance exploitation by adaptive differential mutation operator. The exploration subpopulation is denied access to the information of exploitation subpopulation, but the exploitation subpopulation is allowed access to the information of exploration subpopulation. Moreover, the greedy selection is applied to each individual to preserve useful information. HSISCA is tested on the CEC2014 and CEC2017 benchmark functions, and is used for designing fractional order PID (FOPID) controller. The results confirm the better performance of HSISCA compared to other competitive algorithms, and demonstrate the effectiveness of HSISCA in designing FOPID controller for complex systems.

One of the central issues that must be resolved for a metaheuristic optimization process to work well is the dilemma of the balance between exploration and exploitation. The metaheuristics (MH) that achieved this balance can be called balanced MH, where a Q-Learning (QL) integration framework was proposed for the selection of metaheuristic operators conducive to this balance, particularly the selection of binarization schemes when a continuous metaheuristic solves binary combinatorial problems. In this work the use of this framework is extended to other recent metaheuristics, demonstrating that the integration of QL in the selection of operators improves the exploration-exploitation balance. Specifically, the Whale Optimization Algorithm and the Sine-Cosine Algorithm are tested by solving the Set Covering Problem, showing statistical improvements in this balance and in the quality of the solutions.