Search

Summary: With the rapid increase in energy utilization and the tremendously growing number of connected devices in wireless sensor networks (WSNs), alternate power transfer methods have not only become significant for scholastic purposes but also the growth of WSNs and the reduction of operational costs. Simultaneous wireless information and power transfer (SWIPT) is an emerging technology that has the potential to boost the lifespan of WSNs. This work presents an innovative approach to improving the energy efficiency of WSNs. Here, a WSN is considered, and energy‐aware communication is established in six phases, such as setup, steady state, energy prediction, SWIPT‐based power transfer, communication/route discovery, and route maintenance. Further, a hybrid approach named tangent sine search optimization (TSSO) is created to identify the ideal node as cluster head (CH). Later, the age of the neighboring nodes is forecasted utilizing the deep long short‐term memory (DLSTM), whose trainable parameters are selected using the proposed TSSO algorithm. A SWIPT‐based power transfer is also performed for harvesting the energy to avoid node failures. The proposed TSSO‐DLSTM+SWIPT is investigated given various metrics, like delay, residual energy, throughput, and trust, and the values attained are 0.784 s, 0.790 J, 0.970 Mbps, and 0.997, respectively without any attacks. The proposed TSSO‐DLSTM+SWIPT obtained performance improvement of 11.08%, 10.07%, 7.99%, and 5.83% than the Iterative algorithm in terms of delay, residual energy, throughput, and trust. [ABSTRACT FROM AUTHOR]

Polycystic Ovary Syndrome (PCOS) is a hormonal state that affects women within the reproductive age group. Early and accurate diagnosis of medical conditions is crucial for the successful implementation of medication and prevention of significant health problems. In recent times, there has been an increasing amount of evidence suggesting that machine learning (ML) methods have significant potential in facilitating the diagnosis and classification of PCOS. The objective of this research is to evaluate the viability of using several machine learning algorithms, such as Random Forests, Decision Trees, Artificial Neural Networks, and XGBoost, for the purpose of classifying PCOS using clinical and laboratory features. Furthermore, the use of the Sine Cosine Algorithm was implemented for the purpose of selecting features in order to improve the accuracy and efficiency of the model. A sample of 500 individuals was selected for the purpose of training and assessing the models, with half of the participants (250) diagnosed with PCOS and the other half not exhibiting the disease. The findings suggest that the classification algorithms had strong performance in classifying PCOS, with XGBoost having the best level of performance. In addition, the use of the Sine Cosine Algorithm resulted in enhanced model precision and effectiveness via the identification of the most pertinent features for the classification objective. The results of this study emphasise the significant capabilities of machine learning methods, namely XGBoost and the Sine Cosine Algorithm, in aiding the diagnosis and classification of PCOS in a medical setting. Additional investigation is required in order to substantiate the models and prove their clinical significance in the provision of patient care. [ABSTRACT FROM AUTHOR]

Photovoltaic (PV) power classification model has become a significant alternative to PV power point forecasting model in which classes of future PV powers are estimated. In this work, a novel PV power classification model which could be realized using feed forward neural network (FFNN) trained with a hybrid meta-heuristic approach is proposed to forecast the classes of future PV powers. The insisted classification model is implemented to classify three classes of PV power for the location Oregon city of United States of America (USA) with latitude ${43.8041^0}N$ 43.8041 0 N , longitude ${120.5542^0}W$ 120.5542 0 W , and altitude of $1124$ 1124 m. The meta-heuristic approach comprising of Levy Flight (Levy)-Sine Cosine Algorithm (SCA)-Particle Swarm Optimization (PSO) is utilized for training the parameters of FFNN by minimizing the root mean square error $\left({{\rm{RMSE}}} \right)$ RMSE . The results disclose that the proposed approach attained the most accurate prediction of PV power with $\% {\rm{MAPE}} = 2.38$ % MAPE = 2.38 for the month of November as well as high classification accuracy with ${\rm{PCA}} = 94.96\% $ PCA = 94.96 % in the month of April. Based on the obtained results, the proposed LF-SCA-PSO trained FFNN outperformed the existing hybrid models in both prediction and classification and hence possess the potential to be a new alternative to assist engineers in predicting the PV power of solar systems at short- and long-time horizons. [ABSTRACT FROM AUTHOR]

In the world, grapes are considered as the most significant fruit, and it comprises various nutrients, like Vitamin C and it is utilized to produce wines and raisins. The major six general grape leaf diseases and pests are brown spots, leaf blight, downy mildew, anthracnose, and black rot. However, the existing manual detection methods are time-consuming and require more efforts. In this paper, an effectual grape leaf disease finding and percentage of pesticide detection approach is devised usingan optimized deep learning scheme. Here, the input image is pre-processed and then, black spot segmentation is done using proposed Taylor Remora Optimization Procedure (TROA). The TROA is the combination of Taylor concept and Remora Optimization Algorithm (ROA). After that, the multi-classification of grape leaf disease is performed to classify the disease as Black rot, Black measles, Isariopsis leaf spot and healthy. Accordingly, the training process of the Deep Neuro-Fuzzy Optimizer (DNFN) is done using Sine Cosine Butterfly Optimization (SCBO). Then, pesticide classification is done using Deep Maxout Network (DMN) and the training of the DMN is done using the Monarch Anti Corona Optimization (MACO) algorithm. Finally, the pesticide percentage level detection is performed using Deep Belief Network (DBN), which is trained by the TROA. The devised scheme obtained highest accuracy of 0.9327, sensitivity of 0.9383, and 0.9429. Thus, this method can assist as an effectual decision provision system for assisting the farmers to find the percentage of pesticide affected in grape leaf diseases. [ABSTRACT FROM AUTHOR]

Demand response (DR) refers to the customers' active reaction with respect to the changes of market pricing or incentive policies. DR plays an important role in improving network reliability, minimizing operational cost and increasing end users' benefits. Hence, the integration of DR in the microgrid (MG) management is gaining increasing popularity nowadays. This paper proposes a day-ahead MG scheduling framework in conjunction with DR and investigates the impact of DR in optimizing load profile and reducing overall power generation costs. A linear responsive model considering time of use (TOU) price and incentive is developed to model the active reaction of customers' consumption behaviors. Thereafter, a novel multi-swarm sine cosine algorithm (MSCA) is proposed to optimize the total power generation costs in the framework. In the proposed MSCA, several sub-swarms search for better solutions simultaneously which is beneficial for improving the population diversity. A cooperative learning scheme is developed to realize knowledge dissemination in the population and a competitive substitution strategy is proposed to prevent local optima stagnation. The simulation results obtained by the proposed MSCA are compared with other meta-heuristic algorithms to show its effectiveness in reducing overall generation costs. The outcomes with and without DR suggest that the DR program can effectively reduce the total generation costs and improve the stability of the MG network. [ABSTRACT FROM AUTHOR]

The current trend in global optimization research is to hybridize multiple variants to improve the quality of solutions to real-world problems that have recently arisen in practise. This paper introduces the accelerated sine cosine algorithm (A-SCA), which uses sine and cosine acceleration coefficients to improve SCA performance and afterwards the, accelerated SCA is combined with an Equilibrium optimizer (EO) called ASCAEO. Each nature-inspired optimization algorithm's performance relies on the operators employed for exploration and exploitation. Lacking this combination causes premature convergence, local optima trapping, and inability to attain global optima. In hybrid ASCAEO, the combination of an accelerated sine–cosine algorithm is utilized to enhance the exploration rate of classical SCA, whereas an equilibrium optimizer is used for the exploitation phase in an uncertain environment. The performance of ASCAEO is benchmarked in three test phases. Firstly, the proposed ASCAEO is validated using 38 benchmark functions with qualitative, quantitative, and scalability analyses, and its statistical findings are compared to 11 others existing metaheuristic algorithms. Secondly, ASCAEO is tested in optimizing three constrained engineering design problems for further analysis. Finally, Otsu's interclass variance function is used with the suggested ASCAEO to find the best threshold values for image segmentation. The mean inter-class variance and peak signal-to-noise ratio (PSNR) of the proposed algorithm are measured and compared to existing metaheuristics algorithms to show ASCAEO's superiority. Numerical and statistical experiments show that the hybrid variant solves benchmark and real-world applications with confined and unknown search spaces effectively. [ABSTRACT FROM AUTHOR]

This research deals with optimizing the welded I-girder of the single-beam bridge as a variant solution for this type of crane. The mass optimization is achieved by minimization of the welded I-girder cross-section area. The paper takes the following criteria as the constraint functions: strength, local stresses from the trolley wheel pressure, local buckling of the girder plates, global girder stability, deflection, relaxation time and the corresponding design-technological limitations. The hybridization of two new-generation metaheuristic algorithms, the Sine Cosine Algorithm and the Whale Optimization Algorithm, and original algorithms were used for the optimization procedures. The justification for applying these methods in solving practical engineering problems was confirmed by comparing the results with real solutions. As a result, significant material savings were achieved in this research, within the range of 39.52–51.92%. Also, comparing the results indicates the justification and advantages of the proposed hybridization procedure to the mentioned algorithms. [ABSTRACT FROM AUTHOR]

The Sine–Cosine algorithm (SCA) is efficient but faces challenges in exploitative abilities, slow convergence, and exploration–exploitation balance. This study proposes a novel optimization method, the learning-based sine–cosine algorithm (L-SCA), to solve the optimal power flow (OPF) problem. The basic SCA has been modified with a learning phase operator inspired by TLBO. The SCA handles global exploration, while the learner phase of teaching–learning based optimization (TLBO) offers strong local search capabilities, which can be utilized to enhance the solution neighborhood space provided by the SCA technique. The L-SCA and original SCA algorithms address OPF in IEEE 57-bus, Algerian 59-bus, and IEEE 118-bus power systems, considering twelve cases with a focus on cost savings, voltage stability, voltage profile, emissions, and power losses. The comparative study shows that the proposed L-SCA consistently outperforms standard SCA and other reported methods in all cases for varied-scale standard test systems as well as for a practical power system, within reasonable execution times. For instance, L-SCA in the Algerian 59-bus system cut fuel costs by around 13.13% compared to initial case, equating to annual savings of $2.2 million, while in the IEEE-118 bus system, power loss is significantly reduced to 17.881 MW, marking an 86.5% reduction compared to the base case. [ABSTRACT FROM AUTHOR]

This paper employs the Sine Cosine Algorithm, a recent meta-heuristic method, to enhance the radiation properties of concentric elliptical antenna arrays in far-field applications, such as smart grid wireless communication and the Internet of Things. It focuses on minimizing the Sidelobe Level, a key parameter in antenna radiation, to mitigate unwanted signals and interference. The proposed method, known for its global optimization effectiveness, tackles the challenge of designing sparse multiple concentric elliptical arrays. By using the Sine Cosine Algorithm, the inter-element spacing and optimal determination of amplitude coefficients are achieved, resulting in a radiation pattern with reduced sidelobe level. To showcase the adaptability and superior performance of our proposed algorithm, we systematically evaluated its effectiveness across four distinct sets of concentric elliptical antenna arrays. These arrays comprise varying numbers of elements: (6, 12, 18 elements, 6, 12, 18, 24 elements, 6, 12, 18, 24, 30 elements and 6, 12, 18, 24, 30, 36 elements) with and without a central element. Using the sine cosine algorithm, we synthesize arrays and compare their sidelobe level and First Null Beam Width values with those from recent methods. Our findings consistently shows that the proposed algorithm consistently outperforms alternatives, yielding significantly lower sidelobe level values in all comparisons. [ABSTRACT FROM AUTHOR]

The Squirrel Search Algorithm (SSA) is an innovative optimization method that takes inspiration from the foraging and gliding behavior of squirrels. Despite its simple structure and stable performance, it is prone to the same issues as other algorithms, such as falling into local optima and experiencing premature convergence. To address this problem, this paper proposes an improved squirrel search algorithm embedded with the Sine Cosine Algorithm (SCSSA). Firstly, the Sine Cosine Algorithm is introduced into the SSA to enhance its local exploitation ability. Secondly, the Sobol sequence is utilized to generate the initial population, resulting in higher quality initial solutions. Thirdly, dimensional learning is applied to squirrels on both hickory and oak trees, promoting population diversity and preventing local optima. Finally, the glide constant Gc in SSA is adjusted to decay nonlinearly with iteration count, starting with a large value that gradually decreases in the early stage to facilitate global exploration, and then rapidly decreasing in the later stage to promote local exploitation. Extensive experiments are conducted on 23 classic benchmark functions, the CEC2017 test set, and three engineering problems. The experimental results show that SCSSA can effectively maintain population diversity and can achieve a balance between exploration and exploitation. It consistently outperforms the comparison algorithms in terms of numerical optimization and convergence rate. [ABSTRACT FROM AUTHOR]

Abstract Researchers are increasingly focusing on renewable energy due to its high reliability, energy independence, efficiency, and environmental benefits. This paper introduces a novel multi-objective framework for the short-term scheduling of microgrids (MGs), which addresses the conflicting objectives of minimizing operating expenses and reducing pollution emissions. The core contribution is the development of the Chaotic Self-Adaptive Sine Cosine Algorithm (CSASCA). This algorithm generates Pareto optimal solutions simultaneously, effectively balancing cost reduction and emission mitigation. The problem is formulated as a complex multi-objective optimization task with goals of cost reduction and environmental protection. To enhance decision-making within the algorithm, fuzzy logic is incorporated. The performance of CSASCA is evaluated across three scenarios: (1) PV and wind units operating at full power, (2) all units operating within specified limits with unrestricted utility power exchange, and (3) microgrid operation using only non-zero-emission energy sources. This third scenario highlights the algorithm’s efficacy in a challenging context not covered in prior research. Simulation results from these scenarios are compared with traditional Sine Cosine Algorithm (SCA) and other recent optimization methods using three test examples. The innovation of CSASCA lies in its chaotic self-adaptive mechanisms, which significantly enhance optimization performance. The integration of these mechanisms results in superior solutions for operation cost, emissions, and execution time. Specifically, CSASCA achieves optimal values of 590.45 €ct for cost and 337.28 kg for emissions in the first scenario, 98.203 €ct for cost and 406.204 kg for emissions in the second scenario, and 95.38 €ct for cost and 982.173 kg for emissions in the third scenario. Overall, CSASCA outperforms traditional SCA by offering enhanced exploration, improved convergence, effective constraint handling, and reduced parameter sensitivity, making it a powerful tool for solving multi-objective optimization problems like microgrid scheduling.

This work uses the vector-valued Bernoulli equation to build a nonlinear multi-variable grey Bernoulli model, which is available to describe the nonlinear relationship between the output variables. By using P a d e ´ approximation, the proposed model can be implemented with high time efficiency. Additionally, the Sine Cosine Algorithm is employed to determine the Bernoulli exponent, thereby enhancing prediction accuracy. To evaluate the predictive performance of the proposed model, three case studies using three real-world data sets with different features of predicting per capita household income, fuel prices and crude oil prices are carried out. The results are compared with three existing grey multi-input multi-output models. Experimental results demonstrate that the proposed model excels in handling nonlinear relationships between variables and has strong robustness against noise, consistently delivering lower error values, demonstrating superior predictive performance. • A nonlinear multi-variable grey Bernoulli model is proposed based on the Hadamard product. • Linear parameter estimation is carried out using the least squares method or the least norm method. • P a d e ´ approximation is used to compute the matrix exponential to improve the time efficiency. • The model is optimized using the Sine Cosine Algorithm. • The proposed model shows superior prediction performance compared with three other typical models. [ABSTRACT FROM AUTHOR]

To optimize radial distribution systems, this study suggests the utilization of the Grey Wolf Optimizer (GWO), a hybrid metaheuristic optimization method, combined with the Sine Cosine method (SCA). The primary objective of this work is to enhance the distribution system by determining the most efficient network reconfiguration, sizing, and placement of various distributed energy sources in distribution system. The energy sources considered include capacitors, solar cells, wind turbines, biomass-based distributed generation units, and battery storage units. To achieve this goal, the proposed strategy incorporates the power loss sensitivity technique, which assists in identifying suitable candidate buses and accelerates the resolution process. Moreover, the model considers fluctuations in solar irradiance and wind speed using Weibull and Beta probability distribution functions, compensating for the intermittent nature of renewable energy sources and the variability in demand. To address power fluctuations, voltage surges, significant losses, and inadequate voltage stability challenges, battery energy storage, diesel generators, and dispatchable biomass DGs are employed to mitigate variability and enhance supply continuity. The proposed approach is evaluated and validated by comparing it to existing optimization strategies using IEEE 69-bus and 84-bus RDSs. The results demonstrate that the suggested technique achieves faster convergence to near-optimal solutions. The proposed methodology yields a significant reduction of up to 80% in power losses in the 69-bus system and a 35% reduction in the 84-bus system, signifying higher performance than existing methods. [ABSTRACT FROM AUTHOR]

As a significant branch of production scheduling problem, the Flexibility Job Shop Scheduling Problem (FJSP) is a typical NP-hard problem. Most conventional flexible workshop scheduling primarily focuses on performance aspects involving production efficiency such as time and quality. In recent years, due to increased energy costs and environmental pollution, 'low-carbon scheduling' has garnered attention as a new scheduling paradigm among scholars and engineers. This paper investigates a low-carbon flexible Job shop scheduling problem, proposing a Grey Wolf Optimization algorithm (SC-GWO), aiming to minimize the sum of carbon emission costs and makespan costs. This algorithm employs the Grey Wolf Algorithm (GWO) as the fundamental optimization method, adaptively choosing between global and local searches based on the dispersion degree of individuals. Firstly, integrating the Sine Cosine Algorithm (SCA), the sinusoidal cosine search mechanism is applied to GWO to enhance its local search capability. Secondly, a new leader selection mechanism is introduced to prevent leaders from falling into local optima, thus improving the algorithm's global exploration capability. Utilizing a nonlinear convergence factor strategy controls the global exploration and local exploitation capabilities in different algorithm stages, enhancing optimization accuracy and accelerating convergence, achieving a dynamic balance between the two. Finally, validation of the SC-GWO algorithm's ability to solve low-carbon scheduling problems in flexible job shop scheduling instances is conducted. Experimental results demonstrate the superior performance of SC-GWO in solving low-carbon flexible workshop scheduling instances. Comparative experiments against four other advanced algorithms on 22 classic benchmark test functions confirm SC-GWO's better convergence. Through standard test functions like Bandimarte instances applied to solve FJSP, experimental results showcase the excellent optimization performance of SC-GWO. Compared to HGWO and GWO, the makespan time is reduced by 22.25% and 39.27%, respectively. The proposed SC-GWO algorithm demonstrates favorable solving effects on flexible job shop scheduling instances, meeting actual production scheduling needs. [ABSTRACT FROM AUTHOR]

The sine cosine algorithm (SCA) and multi-verse optimizer (MVO) are the recognized optimization strategies frequently employed in numerous scientific areas. However, both SCA and MVO grapple with optimizing the transition between the exploitation and exploration mechanisms. Furthermore, MVO exhibits constraints in its exploitation capabilities. To tackle these limitations, this paper introduces a hybrid model termed SMVO, combining the advantages of both SCA and MVO. This hybrid approach seeks to harmonize exploitation and exploration stages by leveraging the unique advantages of each parent algorithm. The efficacy of SMVO was assessed using 23 benchmark test functions, revealing its competitive performance against not only SCA and MVO but also the ant lion optimization (ALO) and the dragonfly algorithm (DA). Additionally, SMVO's applicability was further validated by successfully addressing three distinct engineering optimization challenges, underscoring its stability and promise as a global optimization tool. [ABSTRACT FROM AUTHOR]

The health of rolling bearing is of great importance for the normal operation of rotating machinery. The fault diagnosis process can be roughly summarized as signal processing, feature extraction, and fault classification. In this paper, a novel feature extraction and fault diagnosis method with fractional order back-propagation neural network is put forward. The new sine cosine algorithm optimized variational mode decomposition is performed on vibration signals, and the fault feature vectors are selected and built by singular value decomposition. Inspired by the fractional order calculus, a fractional order back-propagation neural network is employed to realize fault classification. The capability of the developed fault diagnosis algorithm is comprehensively evaluated via benchmark bearing data. The experimental results demonstrate that the designed method substantially extracts bearing defect features, increases classification accuracy and efficiency, and also outperforms existing algorithms. [ABSTRACT FROM AUTHOR]

In recent years, Sine Cosine Algorithm (SCA) is a kind of meta-heuristic optimization algorithm with simple structure, simple parameters and trigonometric function principle. It has been proved that it has good competitiveness among the existing optimization algorithms. However, the single mechanism of SCA leads to its insufficient utilization of the information of the whole population, insufficient ability to jump out of local optima and poor performance at solving complex objective function. Therefore, this paper introduces social learning strategy (SL) and elite opposition-based learning (EOBL) strategy to improve SCA, and proposes novel algorithm: enhancing Sine Cosine Algorithm based on elite opposition-based learning and social learning (ESLSCA). Social learning strategy takes full advantage of information from the entire population. The elite opposition-based learning strategy provides a possibility for the algorithm to jump out of local optima and increases the diversity of the population. To demonstrate the performance of ESLSCA, this paper uses 22 well-known benchmark test functions and CEC2019 test function set to evaluate ESLSCA. The comparisons show that the proposed ESLSCA has better performance than the standard SCA and it is very competitive among other excellent optimization algorithms. [ABSTRACT FROM AUTHOR]

The holding pole is a special lifting device for the construction of transmission towers. The optimization design model for the holding pole was established. The minimum mass was set as the optimization objective. The cross-section sizes of members, the connection modes of auxiliary members and the coordinates of the rocker joint were set the optimization variables. The allowable stress, displacement and buckling coefficient were taken as the constraining conditions. An improved sine cosine algorithm (ISCA) was proposed to carry out the size, shape and topology optimization designs of the holding pole. For the ISCA, the Lévy flight was introduced to enhance the global search ability, elite guidance strategy was applied to enhance the local search ability, and the greedy selection strategy was used to update the optimal solution. The example shows that, the ISCA can effectively solve the optimization design problems of spatial truss structures. [ABSTRACT FROM AUTHOR]

Sine cosine algorithm (SCA) is a recently developed meta-heuristic method based on the characteristics of sine and cosine functions. However, SCA algorithm may suffer premature convergence in solving complex optimization problems. To mitigate this limitation, a modified SCA (MSCA) is developed to achieve an effective balance between exploration and exploitation. Specifically, the conversion parameter can be configured adaptively by using the individual fitness information in the evolution process to guide the individual search behavior. After that, an inertia weight is embedded in the position updating equation to further improve the search accuracy and accelerate the convergence speed. The performance of MSCA algorithm is investigated on 13 benchmark functions and the chaotic time series prediction problem. Experimental results demonstrate that MSCA algorithm is more effective than the other optimization methods. [ABSTRACT FROM AUTHOR]

Particle Swarm Optimization (PSO) is facing more challenges in solving high-dimensional global optimization problems. In order to overcome this difficulty, this paper proposes a novel PSO variant of the hybrid Sine Cosine Algorithm (SCA) strategy, named Velocity Four Sine Cosine Particle Swarm Optimization (VFSCPSO). The introduction of the SCA strategy in the velocity formulation ensures that the global optimal solution is found accurately. It increases the flexibility of PSO. A series of experiments are conducted on the CEC2005 test suite with compositional algorithms, algorithmic variants, and good intelligent algorithms. The experimental results show that the algorithm effectively improves the overall performance of compositional algorithms; the Friedman test proves that the algorithm has good competitiveness. The algorithm also performs better in PID parameter tuning. Therefore, the VFSCPSO is able to solve the high-dimensional global optimization problems in a better way. [ABSTRACT FROM AUTHOR]

The demand for frequency spectrum is increasing rapidly with the wide growth of wireless communications. Spectrum sensing issues present in Cognitive Radio Sensor Networks (CRSN) are detected dynamically using spectral sensing techniques, which also help to utilize frequency bands more effectively. The study proposes a novel Cosine Sand Cat Optimization (CSCO) protocol to address spectral sensing problems by selecting the optimal Cluster Head (CH) in a CRSN. The CRSN is simulated, and spectral allocation is performed using LeNet to extract signal components. Then, Primary User (PU) aware optimal CH selection is performed using the proposed CSCO by taking account of multi-objective fitness parameters. Finally, data communication is performed between nodes after CH selection using the CSCO protocol. The simulation results of CSCO were validated to determine its superiority concerning Secondary User (SU) density, and it attained residual energy, network lifetime, Packet Delivery Ratio (PDR), normalized throughput, and delay of 69.457 J, 77, 75.89%, 74.473, and 4.782ms, respectively. [ABSTRACT FROM AUTHOR]

Class imbalance is a significant study problem that is biased, exhibiting excellent performance toward the majority classes in the dataset while showing inferior performance toward minority classes. When dealing with real-world issues, this kind of biased nature affects classification accuracy. The Improved Binary Sine Cosine Algorithm (IBSCA) has been used in this work to identify a subset of the majority class in the best possible way. The proposed IBSCA makes some enhancements over the conventional Binary Sine Cosine Algorithm (BSCA) to address the issue of premature convergence with local optimal solutions. To improve classification accuracy for unbalanced datasets, the proposed IBSCA seeks to identify the optimal collection of instances from the majority class. The advised IBSCA makes use of the alpha agent, beta agent, and random agent’s location, which tends to devote considerable time to exploration to find the best possible set of instances. By using the geometric mean (G-mean) and F-score to describe the fitness function, the proposed IBSCA aims to solve the multi-objective optimization issue. On 18 datasets with different imbalance ratios taken from the KEEL repository, experimentation is conducted. Comparisons are made between the suggested IBSCA and the traditional Binary Sine Cosine Algorithm, Binary Particle Swarm Optimization (BPSO), and Binary Grey Wolf Optimization (BGWO). Additionally, the performance of the suggested IBSCA is evaluated against the top outcomes from different research papers. Metrics like sensitivity, F-score, G-mean, and area under curve (AUC) show that the suggested IBSCA outperforms the state-of-the-art algorithms. The statistical findings using the Wilcoxon signed rank test and Friedman test also demonstrate that the suggested IBSCA is more efficient than the other conventional algorithms.

In the current era of industrialization, renewable energy (such as wind and solar energy) plays an significant role in power generation sector, and it helps to decrease the generation cost and the environmental pollution. In this work, hybrid source of energy (like solar and wind energy) has been integrated with the traditional dynamic economic emission dispatch (EED) (DEED) problem to formulate a new model, i.e., complicated constrained hybrid energy integrated DEED problem, which may be able to generate less polluted power than the traditional DEED problem. Here, the quasi-opposition learning (QOL) approach and chaotic dynamics have been introduced in a novel sine cosine algorithm (SCA) to enhance its convergence and diversity. Effectiveness of the presented solution of the dynamic thermal-wind-solar EED problem has been properly validated by solving three aspects, i.e., the cost, the emission and the combined cost-emission using QOL-based chaotic SCA. The use of solar and wind energy in the DEED problem reduces the generating costs by 8% and 20.84%, respectively, compared to traditional and wind-integrated DEED. The robustness of the proposed modified SCA has been presented by comparing the results with the results offered by SCA and other recently published algorithms. [ABSTRACT FROM AUTHOR]

An IDS (Intrusion Detection System) is essential for network security experts, as it allows one to identify and respond to abnormal traffic present in a network. An IDS can be utilized for evaluating the various types of malicious attacks. Hence, detecting intrusions has become a significant research area in the contemporary era, especially with the evolution of technologies. With the progress of ML (Machine Learning)-based algorithms, researchers have striven to perform optimal ID. However, most of these studies lag in accordance with their accuracy rate. Thus, to attain a high accuracy rate in ID, the present study proposes ML-based meta-heuristic algorithms, as these approaches possess innate merits of determining near-optimal solutions in limited time and are capable of dealing with multi-dimensional data. The study proposes OWSA (Optimal Whale Sine Algorithm) for selecting suitable and relevant features. With an exclusive optimization process using the SCA (Sine Cosine Algorithm), this study proposes to combine SCA with WOA (Whale Optimization Algorithm) for mitigating the demerits of both, with its hybridization thereby achieving OWSA. Following this, AWRF (Artificial Neural Network Weighted Random Forest) is proposed for classification. The main intention of this process is to propose a weight-updating process for discrete trees in the RF model. The proposed approach is motivated by avoiding overfitting and attaining stability and flexibility. This approach is assessed with regard to performance via a comparative analysis, so as to uncover the best performance of this proposed technique in ID. [ABSTRACT FROM AUTHOR]

Aiming at the shortcomings of Chimp optimization algorithm (ChOA), which is easy to fall into local optimal value and imbalance between global exploration ability and local exploitation ability. To improve ChOA from the perspective of multi-strategy mixing, MSChimp was proposed, and the algorithm was applied to global optimization and minimum spanning tree problems. The main research work of this paper is as follows: (1) In the initialization stage of ChOA, an opposition-based learning strategy was introduced to improve the population diversity; Sine Cosine Algorithm (SCA) was introduced in the exploitation process to improve the convergence speed and accuracy of the algorithm in the later stage, so as to balance the exploration and exploitation capabilities of the algorithm. (2) The improved algorithm was compared with different types of meta-heuristic algorithms in 20 benchmark functions and CEC 2019 test sets, and was used to solve the minimum spanning tree. The experimental results show that the improved ChOA has significantly improved the ability to find the optimal value, which verifies the effectiveness and feasibility of MSChimp. Compared with other algorithms, the algorithm proposed in this paper has strong competitiveness. [ABSTRACT FROM AUTHOR]

Summary: One of the attacks that have rapidly happen is Advanced Persistent Threat (APT). APT attacks contain different sophisticated approaches and methods of attacking targets for stealing confidential as well as sensitive information. This research introduced novel and effective APT attack detection techniques, namely Smart Flower Cosine Algorithm‐driven Deep Convolutional Neural Network (SFCA‐DeepCNN). Here, the APT attack detection is done by the DeepCNN, wherein the weight of DeepCNN is updated by the proposed SFCA. The SFCA is modeled by unifying the Smart Flower Optimization Algorithm (SFOA) and Sine Cosine Algorithm (SCA). Additionally, the pre‐processing process is done by Quantile normalization, and the features are chosen based on the fuzzy‐based distance measures. Moreover, data augmentation is done to increase the size of data by performing the oversampling that avoids the overfitting problems. Furthermore, the proposed optimized deep learning scheme detects the accurate APT detection outcome. The performance improvement of the proposed method for testing accuracy is 9.417%, 10.47%, 4.232%, and 3.068% higher than the existing methods, such as, Deep Learning, Support Vector Machine (SVM), Bidirectional Long Short‐Term Memory (Bi‐LSTM), and Hidden Markov Model (HMM). [ABSTRACT FROM AUTHOR]

The sine cosine algorithm (SCA) is a new meta-heuristic algorithm. It has been proven to be very competitive compared with other meta-heuristic algorithms and has attracted significant attention from researchers in different fields. At present, there is no research on the application of SCA in the truss structure. In order to solve the truss optimization problem, the following improvements are made to SCA in this paper. Firstly, a non-linear conversion parameter is set to replace the linear conversion parameter, so that the exploration area is better in line with the characteristics of the actual optimization situation. Secondly, the Lévy flight is employed to enhance the algorithm's global search ability. Thirdly, a novel elite guidance strategy taking advantage of memory data is proposed to strengthen the local search ability. Finally, a greedy selection strategy is adopted for the selection of the candidate. Combining the finite element method, we apply ISCA to optimize the size, shape and topology of truss structures. The examples show that ISCA can use less calculation time, get better results, and also better stability. So, the ISCA is effective to solve the size, shape and topology optimization problems of truss structures. [ABSTRACT FROM AUTHOR]

Multilevel thresholding is a fundamental, substantial and constructive technique that has been widely recognized and concerned in recent years. However, the computational complexity rises as the threshold level raises. The golden jackal optimization (GJO) imitates discovering prey, tracking and encircling prey, and trapping prey by employing a collaborative foraging mechanism. To eliminate the GJO's drawbacks, such as premature convergence, inferior computation accuracy and sluggish convergence rate, this paper proposes a hybrid golden jackal optimization with a sine cosine algorithm (SCGJO) based on Kapur's entropy to tackle the multilevel thresholding image segmentation, the intention is to actualize the accurate threshold values and the maximal fitness values. The SCGJO not only has fantastic adaptability and reliability to promote the complementary benefits and boost the convergence accuracy but also integrates exploration and exploitation to mitigate search stagnation and arrive at the ideal value. The experimental results demonstrate that the SCGJO is superior to the other algorithms and has a quicker convergence rate, higher computation accuracy, greater segmentation quality and stronger stability. In addition, the SCGJO is a steady and trustworthy approach for tackling image segmentation. [ABSTRACT FROM AUTHOR]

Chaotic maps are sources of randomness formed by a set of rules and chaotic variables. They have been incorporated into metaheuristics because they improve the balance of exploration and exploitation, and with this, they allow one to obtain better results. In the present work, chaotic maps are used to modify the behavior of the binarization rules that allow continuous metaheuristics to solve binary combinatorial optimization problems. In particular, seven different chaotic maps, three different binarization rules, and three continuous metaheuristics are used, which are the Sine Cosine Algorithm, Grey Wolf Optimizer, and Whale Optimization Algorithm. A classic combinatorial optimization problem is solved: the 0-1 Knapsack Problem. Experimental results indicate that chaotic maps have an impact on the binarization rule, leading to better results. Specifically, experiments incorporating the standard binarization rule and the complement binarization rule performed better than experiments incorporating the elitist binarization rule. The experiment with the best results was STD_TENT, which uses the standard binarization rule and the tent chaotic map. [ABSTRACT FROM AUTHOR]

This paper proposed a parallel deep forest algorithm based on Spark and NRSCA strategy (PDF-SNRSCA), aiming to address several issues encountered by parallel deep forest algorithms in big data environments, such as excessive redundancy and irrelevant features, low utilization rate of features at both ends, slow model convergence speed, and low parallel efficiency of cascading forests. Firstly, the algorithm proposes a feature selection strategy (FSNRS) based on neighborhood rough sets and fisher score, which measures the correlation and redundancy of features to effectively reduce the number of redundant and irrelevant features. Secondly, it proposed a scanning strategy based on random selection and equidistant extraction (S-RSEE) to ensure that all features are utilized with the same probability and solve the problem of low utilization rate of two ends in multi-scanning. Finally, combining with the Spark framework, the algorithm realized the parallel training of cascading forests, and it proposed a feature filtering mechanism based on the importance index (FFM-II) to balance the dimensions of enhanced class vectors and original class vectors, thereby accelerating the model convergence speed. Meanwhile, the algorithm designed a task scheduling mechanism based on SCA (TSM-SCA) to redistribute tasks and ensure load balancing in the cluster, which solves the problem of low parallel efficiency of cascading forests. Experiments show that the PDF-SNRSCA algorithm can effectively improve the classification performance of deep forests and greatly enhance the efficiency of parallel training of deep forests. [ABSTRACT FROM AUTHOR]

The demand for frequency spectrum is increasing rapidly with the wide growth of wireless communications. Spectrum sensing issues present in Cognitive Radio Sensor Networks (CRSN) are detected dynamically using spectral sensing techniques, which also help to utilize frequency bands more effectively. The study proposes a novel Cosine Sand Cat Optimization (CSCO) protocol to address spectral sensing problems by selecting the optimal Cluster Head (CH) in a CRSN. The CRSN is simulated, and spectral allocation is performed using LeNet to extract signal components. Then, Primary User (PU) aware optimal CH selection is performed using the proposed CSCO by taking account of multi-objective fitness parameters. Finally, data communication is performed between nodes after CH selection using the CSCO protocol. The simulation results of CSCO were validated to determine its superiority concerning Secondary User (SU) density, and it attained residual energy, network lifetime, Packet Delivery Ratio (PDR), normalized throughput, and delay of 69.457 J, 77, 75.89%, 74.473, and 4.782ms, respectively.

Abstract The sine cosine algorithm (SCA) is widely recognized for its efficacy in solving optimization problems, although it encounters challenges in striking a balance between exploration and exploitation. To improve these limitations, a novel model, termed the novel sine cosine algorithm (nSCA), is introduced. In this advanced model, the roulette wheel selection (RWS) mechanism and opposition-based learning (OBL) techniques are integrated to augment its global optimization capabilities. A meticulous evaluation of nSCA performance has been carried out in comparison with state-of-the-art optimization algorithms, including multi-verse optimizer (MVO), salp swarm algorithm (SSA), moth-flame optimization (MFO), grasshopper optimization algorithm (GOA), and whale optimization algorithm (WOA), in addition to the original SCA. This comparative analysis was conducted across a wide array of 23 classical test functions and 29 CEC2017 benchmark functions, thereby facilitating a comprehensive assessment. Further validation of nSCA utility has been achieved through its deployment in five distinct engineering optimization case studies. Its effectiveness and relevance in addressing real-world optimization issues have thus been emphasized. Across all conducted tests and practical applications, nSCA was found to outperform its competitors consistently, furnishing more effective solutions to both theoretical and applied optimization problems.

To address the shortcomings of the sine cosine algorithm such as the low search accuracy, slow convergence speed, and easily falling into local optimality, a sine cosine algorithm for elite individual collaborative search was proposed. Firstly, tent chaotic mapping was used to initialize the population and the hyperbolic tangent function was applied non-linearly to adjust the parameters of the sine cosine algorithm, which enhanced the uniformity of population distribution and balanced the global exploration and local exploitation ability. Secondly, the search method of the sine cosine algorithm was improved by combining the search strategy of the sine cosine algorithm, the m-neighborhood locally optimal individual-guided search strategy, and the global optimal individual-guided search strategy, and, then, the three search strategies were executed alternately, which achieved collaboration, improved the convergence accuracy, and prevented the algorithm from falling into local optima. Finally, a greedy selection strategy was employed to select the best individuals for the population, which accelerated the convergence speed of the sine cosine algorithm. The simulation results illustrated that the sine cosine algorithm for elite individual collaborative search demonstrated a better optimization performance than the sine cosine algorithm, the other improved sine cosine algorithms, the other chaos-based algorithms, and other intelligent optimization algorithms. In addition, the feasibility and applicability of the sine cosine algorithm for elite individual collaborative search were further demonstrated by two mechanical optimization design experiments. [ABSTRACT FROM AUTHOR]

Electroencephalography (EEG) serves as a diagnostic technique for measuring brain waves and brain activity. Despite its precision in capturing brain electrical activity, certain factors like environmental influences during the test can affect the objectivity and accuracy of EEG interpretations. Challenges associated with interpretation, even with advanced techniques to minimize artifact influences, can significantly impact the accurate interpretation of EEG findings. To address this issue, artificial intelligence (AI) has been utilized in this study to analyze anomalies in EEG signals for epilepsy detection. Recurrent neural networks (RNNs) are AI techniques specifically designed to handle sequential data, making them well-suited for precise time-series tasks. While AI methods, including RNNs and artificial neural networks (ANNs), hold great promise, their effectiveness heavily relies on the initial values assigned to hyperparameters, which are crucial for their performance for concrete assignment. To tune RNN performance, the selection of hyperparameters is approached as a typical optimization problem, and metaheuristic algorithms are employed to further enhance the process. The modified hybrid sine cosine algorithm has been developed and used to further improve hyperparameter optimization. To facilitate testing, publicly available real-world EEG data is utilized. A dataset is constructed using captured data from healthy and archived data from patients confirmed to be affected by epilepsy, as well as data captured during an active seizure. Two experiments have been conducted using generated dataset. In the first experiment, models were tasked with the detection of anomalous EEG activity. The second experiment required models to segment normal, anomalous activity as well as detect occurrences of seizures from EEG data. Considering the modest sample size (one second of data, 158 data points) used for classification models demonstrated decent outcomes. Obtained outcomes are compared with those generated by other cutting-edge metaheuristics and rigid statistical validation, as well as results' interpretation is performed. [ABSTRACT FROM AUTHOR]