Search

A Virtual Power Plant (VPP) is a centralized energy system that manages, and coordinates distributed energy resources, integrating them into a unified entity. While the physical assets may be dispersed across various locations, the VPP integrates them into a virtual unified entity capable of responding to grid demands and market signals. This paper presents a tri-level hierarchical coordinated operational framework of VPP. Firstly, an Improved Pelican Optimization Algorithm (IPOA) is introduced to optimally schedule Distributed Energy Resources (DERs) within the VPP, resulting in a significant reduction in generation costs. Comparative analysis against conventional algorithms such as Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) demonstrates IPOA's superior performance, achieving an average reduction of 8.5% in generation costs across various case studies. The second stage focuses on securing the optimized generation data from rising cyber threats, employing the capabilities of machine learning, preferably, a convolutional autoencoder to learn the normal patterns of the optimized data to detect deviations from the optimized generation data to prevent suboptimal decisions. The model exhibits exceptional performance in detecting manipulated data, with a False Positive Rate (FPR) of 1.92% and a Detection Accuracy (DA) of 98.06%, outperforming traditional detection techniques. Lastly, the paper delves into the dynamic nature of the day ahead market that the VPP participates in. In responding to the grid by selling its optimized generated power via the day-ahead market, the VPP employs the Prophet model, another machine learning technique to forecast the spot market price for the day-ahead to mitigate the adverse effects of price volatility. By utilizing Prophet forecasts, the VPP achieves an average revenue increase of 15.3% compared to scenarios without price prediction, emphasizing the critical role of predictive analytics in optimizing economic gains. This tri-level coordinated approach adopted addresses key challenges in the energy sector, facilitating progress towards achieving universal access to clean and affordable energy. [ABSTRACT FROM AUTHOR]

Reservoir flood control scheduling is a challenging optimization task, particularly due to the complexity of various constraints. This paper proposes an innovative algorithm design approach to address this challenge. Combining the basic walrus optimization algorithm with the adaptive ε-constraint method and introducing the SPM chaotic mapping for population initialization, spiral search strategy, and local enhancement search strategy based on Cauchy mutation and reverse learning significantly enhances the algorithm's optimization performance. On this basis, innovate an adaptive approach ε A New Algorithm for Constraints and Multi Strategy Optimization Improvement (ε-IWOA). To validate the performance of the ε-IWOA algorithm, 24 constrained optimization test functions are used to test its optimization capabilities and effectiveness in solving constrained optimization problems. Experimental results demonstrate that the ε-IWOA algorithm exhibits excellent optimization ability and stable performance. Taking the Taolinkou Reservoir, Daheiting Reservoir, and Panjiakou Reservoir in the middle and lower reaches of the Luanhe River Basin as a case study, this paper applies the ε-IWOA algorithm to practical reservoir scheduling problems by constructing a three-reservoir flood control scheduling system with Luanxian as the control point. A comparative analysis is conducted with the ε-WOA, ε-DE and ε-PSO (particle swarm optimization) algorithms.The experimental results indicate that ε-IWOA algorithm performs the best in optimization, with the occupied flood control capacity of the three reservoirs reaching 89.32%, 90.02%, and 80.95%, respectively. The control points in Luan County can reduce the peak by 49%.This provides a practical and effective solution method for reservoir optimization scheduling models. This study offers new ideas and solutions for flood control optimization scheduling of reservoir groups, contributing to the optimization and development of reservoir scheduling work. [ABSTRACT FROM AUTHOR]

Geophysical inversion usually involves ill-posed problem. Regularization is the most commonly used method to mitigate this problem. There are many regularization parameter selection methods, among which the adaptive regularization method can automatically update parameters during iteration, reducing the difficulty of parameter selection. Therefore, it is widely used in linear inversion. However, there are very few studies on the use of adaptive regularization methods in stochastic optimization algorithms. The biggest difficulty is that in stochastic optimization algorithms, the search direction of any iteration is completely random. Data fitting term and stabilizing term vary in a wide range, making it difficult for traditional methods to work. In this paper, we consider the contributions of the data fitting term and the stabilizing term in the objective function and give an improved adaptive regularization method for very fast simulated annealing (VFSA) inversion for transient electromagnetic (TEM) data. The optimized method adjusts the two terms dynamically to make them in balance. We have designed several numerical experiments, and the experimental results demonstrate that the method in this paper not only accelerates the convergence, but also the inversion results are very little affected by the initial regularization parameter. Finally, we apply this method to field data, and the inversion results show very good agreements with nearby borehole data. [ABSTRACT FROM AUTHOR]

Electricity generation in Islanded Urban Microgrids (IUMG) now relies heavily on a diverse range of Renewable Energy Sources (RES). However, the dependable utilization of these sources hinges upon efficient Electrical Energy Storage Systems (EESs). As the intermittent nature of RES output and the low inertia of IUMGs often lead to significant frequency fluctuations, the role of EESs becomes pivotal. While these storage systems effectively mitigate frequency deviations, their high costs and elevated power density requirements necessitate alternative strategies to balance power supply and demand. In recent years, substantial attention has turned towards harnessing Electric Vehicle (EV) batteries as Mobile EV Energy Storage (MEVES) units to counteract frequency variations in IUMGs. Integrating MEVES into the IUMG infrastructure introduces complexity and demands a robust control mechanism for optimal operation. Therefore, this paper introduces a robust, high-order degree of freedom cascade controller known as the 1PD-3DOF-PID (1 + Proportional + Derivative—Three Degrees Of Freedom Proportional-Integral-Derivative) controller for Load Frequency Control (LFC) in IUMGs integrated with MEVES. The controller's parameters are meticulously optimized using the Coati Optimization Algorithm (COA) which mimics coati behavior in nature, marking its debut in LFC of IUMG applications. Comparative evaluations against classical controllers and algorithms, such as 3DOF-PID, PID, Reptile Search Algorithm, and White Shark Optimizer, are conducted under diverse IUMG operating scenarios. The testbed comprises various renewable energy sources, including wind turbines, photovoltaics, Diesel Engine Generators (DEGs), Fuel Cells (FCs), and both Mobile and Fixed energy storage units. Managing power balance in this entirely renewable environment presents a formidable challenge, prompting an examination of the influence of MEVES, DEG, and FC as controllable units to mitigate active power imbalances. Metaheuristic algorithms in MATLAB-SIMULINK platforms are employed to identify the controller's gains across all case studies, ensuring the maintenance of IUMG system frequency within predefined limits. Simulation results convincingly establish the superiority of the proposed controller over other counterparts. Furthermore, the controller's robustness is rigorously tested under ± 25% variations in specific IUMG parameters, affirming its resilience. Statistical analyses reinforce the robust performance of the COA-based 1PD-3DOF-PID control method. This work highlights the potential of the COA Technique-optimized 1PD-3DOF-PID controller for IUMG control, marking its debut application in the LFC domain for IUMGs. This comprehensive study contributes valuable insights into enhancing the reliability and stability of Islanded Urban Microgrids while integrating Mobile EV Energy Storage, marking a significant advancement in the field of Load-Frequency Control. [ABSTRACT FROM AUTHOR]

This paper provides six metaheuristic algorithms, namely Fast Cuckoo Search (FCS), Salp Swarm Algorithm (SSA), Dynamic control Cuckoo search (DCCS), Gradient-Based Optimizer (GBO), Northern Goshawk Optimization (NGO), Opposition Flow Direction Algorithm (OFDA) to efficiently solve the optimal power flow (OPF) issue. Under standard and conservative operating settings, the OPF problem is modeled utilizing a range of objectives, constraints, and formulations. Five case studies have been conducted using IEEE 30-bus and IEEE 118-bus standard test systems to evaluate the effectiveness and robustness of the proposed algorithms. A performance evaluation procedure is suggested to compare the optimization techniques' strength and resilience. A fresh comparison methodology is created to compare the proposed methodologies with other well-known methodologies. Compared to previously reported optimization algorithms in the literature, the obtained results show the potential of GBO to solve various OPF problems efficiently. [ABSTRACT FROM AUTHOR]

Permanent magnet synchronous motor (PMSM) systems have gained popularity in various fields due to their advantages such as high speed, high accuracy, low maintenance, and high reliability. This paper presents the speed tracking control of a permanent magnet synchronous motor (PMSM) using a hybrid fractional order PI and type 2 fuzzy control with fractional order PD control (FOT2F-FOPD). The SRF-PLL observes the motor speed and estimates the rotor's position by interpreting the input voltages of the motor instead of using a sensor. Then, the controller parameters (gain, μ and λ) are tuned based on a novel optimization algorithm called Incomprehensible but Intelligible-in-time (IbI) Logics algorithm (ILA). The proposed controller enhances the performance of the system and regulates the speed of the motor under parameter variations such as the speed and the load. So, the proposed ILA (FOT2F-FOPD) controller is assessed using MATLAB/Simulink simulation and compared with other controller techniques. The proposed technique reduces the settling time, steady state error and overshoot by at least 65%, 54% and 53% respectively under load conditions compared with (PSO, optimized FOPD, FOPI and PI). While at no load condition, the settling time and the error are reduced by 31% and 12.5% respectively with no overshoot in output response. The results show a significant improvement in the performance of motors used with the application of the proposed controller and the employment of the (ILA) optimization compared with FOPI and PI controllers. [ABSTRACT FROM AUTHOR]

The min–max multi-vehicle Chinese postman problem is an NP-hard problem, which is widely used in path planning problems based on road network graphs, such as urban road structure probing planning, urban road underground cavity detection planning, high-voltage line inspection planning, and so on. With the rapid increase in the number of nodes and connections of road network graph, the solution time and path equilibrium constraints pose new challenges to the problem solving. In this paper, we propose a critical-edge tabu search algorithm, CTA-kroutes, for solving the min–max multi-vehicle postman problem for large-scale road networks. First, the initial solution with balanced path lengths is obtained by segmenting the Eulerian paths; second, the critical edges are moved in the initial solution to construct the neighborhood solution, and the tabu search algorithm is used to find the optimal solution iteratively; and lastly, the solution optimization algorithm is used at the end of each iteration to de-duplicate and optimally reconstruct the current search result. Experiments show that the CTA-kroutes algorithm can effectively improve the equalization of multi-vehicle paths and its applicability to large-scale road networks. [ABSTRACT FROM AUTHOR]

Multi-criteria decision-making (MCDM) presents a significant challenge in decision-making processes, aiming to ascertain optimal choice by considering multiple criteria. This paper proposes rank order centroid (ROC) method, MCDM technique, to determine weights for sub-objective functions, specifically, addressing issue of automatic generation control (AGC) within two area interconnected power system (TAIPS). The sub-objective functions include integral time absolute errors (ITAE) for frequency deviations and control errors in both areas, along with ITAE of fluctuation in tie-line power. These are integrated into an overall objective function, with ROC method systematically assigning weights to each sub-objective. Subsequently, a PID controller is designed based on this objective function. To further optimize objective function, Jaya optimization algorithm (JOA) is implemented, alongside other optimization algorithms such as teacher–learner based optimization algorithm (TLBOA), Luus–Jaakola algorithm (LJA), Nelder–Mead simplex algorithm (NMSA), elephant herding optimization algorithm (EHOA), and differential evolution algorithm (DEA). Six distinct case analyses are conducted to evaluate controller's performance under various load conditions, plotting data to illustrate responses to frequency and tie-line exchange fluctuations. Additionally, statistical analysis is performed to provide further insights into efficacy of JOA-based PID controller. Furthermore, to prove the efficacy of JOA-based proposed controller through non-parametric test, Friedman rank test is utilized. [ABSTRACT FROM AUTHOR]

Artificial Neural Networks (ANNs) have been used in a multitude of real-world applications given their predictive capabilities, and algorithms based on gradient descent, such as Backpropagation (BP) and variants, are usually considered for their optimisation. However, these algorithms have been shown to get stuck at local optima, and they require a cautious design of the architecture of the model. This paper proposes a novel memetic training method for simultaneously learning the ANNs structure and weights based on the Coral Reef Optimisation algorithms (CROs), a global-search metaheuristic based on corals' biology and coral reef formation. Three versions based on the original CRO combined with a Local Search procedure are developed: (1) the basic one, called Memetic CRO; (2) a statistically guided version called Memetic SCRO (M-SCRO) that adjusts the algorithm parameters based on the population fitness; (3) and, finally, an improved Dynamic Statistically-driven version called Memetic Dynamic SCRO (M-DSCRO). M-DSCRO is designed with the idea of improving the M-SCRO version in the evolutionary process, evaluating whether the fitness distribution of the population of ANNs is normal to automatically decide the statistic to be used for assigning the algorithm parameters. Furthermore, all algorithms are adapted to the design of ANNs by means of the most suitable operators. The performance of the different algorithms is evaluated with 40 classification datasets, showing that the proposed M-DSCRO algorithm outperforms the other two versions on most of the datasets. In the final analysis, M-DSCRO is compared against four state-of-the-art methods, demonstrating its superior efficacy in terms of overall accuracy and minority class performance. [ABSTRACT FROM AUTHOR]

This paper explores scenarios for powering rural areas in Gaita Selassie with renewable energy plants, aiming to reduce system costs by optimizing component numbers to meet energy demands. Various scenarios, such as combining solar photovoltaic (PV) with pumped hydro-energy storage (PHES), utilizing wind energy with PHES, and integrating a hybrid system of PV, wind, and PHES, have been evaluated based on diverse criteria, encompassing financial aspects and reliability. To achieve the results, meta-heuristics such as the Multiobjective Gray wolf optimization algorithm (MOGWO) and Multiobjective Grasshopper optimization algorithm (MOGOA) were applied using MATLAB software. Moreover, optimal component sizing has been investigated utilizing real-time assessment data and meteorological data from Gaita Sillasie, Ethiopia. Metaheuristic optimization techniques were employed to pinpoint the most favorable loss of power supply probability (LPSP) with the least cost of energy (COE) and total life cycle cost (TLCC) for the hybrid system, all while meeting operational requirements in various scenarios. The Multi-Objective Grey Wolf Optimization (MOGWO) technique outperformed the Multi-Objective Grasshopper Optimization Algorithm (MOGOA) in optimizing the problem, as suggested by the results. Furthermore, based on MOGWO findings, the hybrid solar PV-Wind-PHES system demonstrated the lowest COE (0.126€/kWh) and TLCC (€6,897,300), along with optimal satisfaction of the village's energy demand and LPSP value. In the PV-Wind-PHSS scenario, the TLCC and COE are 38%, 18%, 2%, and 1.5% lower than those for the Wind-PHS and PV-PHSS scenarios at LPSP 0%, according to MOGWO results. Overall, this research contributes valuable insights into the design and implementation of sustainable energy solutions for remote communities, paving the way for enhanced energy access and environmental sustainability. [ABSTRACT FROM AUTHOR]

Logistics distribution is one of the main sources of carbon dioxide emissions at present, and there are also such distribution problems in the shipbuilding process. With the increasing attention paid to environmental problems, how to effectively reduce the energy consumption of block transportation and improve the utilization rate of resources in the factory is the key problem that China's shipbuilding industry needs to solve at present. This article considers the time windows for block transportation tasks, as well as the self-loading constraints of different types of flat cars, and establishes an optimization model that minimizes the empty transport time and energy consumption of the flat cars as the optimization objective. Then, an Improved Genetic Whale Optimization Algorithm is designed, which combines the cross and mutation ideas of genetic algorithms and proposes a whale individual position updating mechanism under a mixed strategy. Furthermore, the performance and computational efficiency of the algorithm are verified through comparative analysis with other classical optimization algorithms on standard test examples. Finally, the shipyard's block transportation example proves that the energy-saving ship block transportation scheduling method can effectively improve the efficiency of shipbuilding enterprise's block transportation and reduce the energy consumption in the block transportation process. It proves the engineering practicality of the green dispatching method proposed in this paper, which can further provide a decision-making method for shipyard managers. [ABSTRACT FROM AUTHOR]

The Manta Ray Foraging Optimization Algorithm (MRFO) is a metaheuristic algorithm for solving real-world problems. However, MRFO suffers from slow convergence precision and is easily trapped in a local optimal. Hence, to overcome these deficiencies, this paper proposes an Improved MRFO algorithm (IMRFO) that employs Tent chaotic mapping, the bidirectional search strategy, and the Levy flight strategy. Among these strategies, Tent chaotic mapping distributes the manta ray more uniformly and improves the quality of the initial solution, while the bidirectional search strategy expands the search area. The Levy flight strategy strengthens the algorithm's ability to escape from local optimal. To verify IMRFO's performance, the algorithm is compared with 10 other algorithms on 23 benchmark functions, the CEC2017 and CEC2022 benchmark suites, and five engineering problems, with statistical analysis illustrating the superiority and significance of the difference between IMRFO and other algorithms. The results indicate that the IMRFO outperforms the competitor optimization algorithms. [ABSTRACT FROM AUTHOR]

In view of the current problems of spectrum resource scarcity, return congestion, and insufficient energy utilization in the unmanned aerial vehicle (UAV)-assisted Internet of Vehicles (IoV), this paper investigates the cooperative caching and power control, and proposes a joint optimization method to improve the overall Energy Efficiency (EE). In this method, we first propose a communication establishment threshold to control the V2V communication distance and serve as a joint optimization factor. Then we derive the closed form expressions of offloading ratio and EE of the UAV-assisted IoV, and formulate the optimization problem of maximizing EE. Due to the coupling relationship between caching strategy and transmission power, it is difficult for us to directly solve the optimization problem. Furthermore, we propose an alternating optimization algorithm for solving the optimization problem. Finally, the experimental simulation compare the propose joint optimization method with other existing optimization methods, and the simulation results prove the effectiveness and superiority of the propose joint optimization method. [ABSTRACT FROM AUTHOR]

Edge detection in images is a vital application of image processing in fields such as object detection and identification of lesion regions in medical images. This problem is more complex in the domain of color images due to the combination of color layer information and the need to achieve a unified edge boundary across these layers, which increases the complexity of the problem. In this paper, a simple and effective method for edge detection in color images is proposed using a combination of support vector machine (SVM) and the social spider optimization (SSO) algorithm. In the proposed method, the input color image is first converted to a grayscale image, and an initial estimation of the image edges is performed based on it. To this end, the proposed method utilizes an SVM with a Radial Basis Function (RBF) kernel, in which the model's hyperparameters are tuned using the SSO algorithm. After the formation of initial image edges, the resulting edges are compared with pairwise combinations of color layers, and an attempt is made to improve the edge localization using the SSO algorithm. In this step, the optimization algorithm's task is to refine the image edges in a way that maximizes the compatibility with pairwise combinations of color layers. This process leads to the formation of prominent image edges and reduces the adverse effects of noise on the final result. The performance of the proposed method in edge detection of various color images has been evaluated and compared with similar previous strategies. According to the obtained results, the proposed method can successfully identify image edges more accurately, as the edges identified by the proposed method have an average accuracy of 93.11% for the BSDS500 database, which is an increase of at least 0.74% compared to other methods. [ABSTRACT FROM AUTHOR]

High precision is a very important index in target tracking. In order to improve the prediction accuracy of target tracking, an optimized Kalman filter approach based on improved Gray Wolf algorithm (IGWO-OKF) is proposed in this paper. Since the convergence speed of traditional Gray Wolf algorithm is slow, meanwhile, the number of gray wolves and the choice of the maximum number of iterations has a great influence on the algorithm, a nonlinear control parameter combination adjustment strategy is proposed. An improved Grey Wolf Optimization algorithm (IGWO) is formed by determining the best combination of adjustment parameters through the fastest iteration speed of the algorithm. The improved Grey Wolf Optimization algorithm (IGWO) is formed, and the process noise covariance matrix and observation noise covariance matrix in Kalman filter are optimized by IGWO. The proposed approach is applied into. The experiment results show that the proposed IGWO-OKF approach has low error, high accuracy and good prediction effect. [ABSTRACT FROM AUTHOR]

Concrete-filled steel tube columns (CFSTCs) are important elements in the construction sector and predictive analysis of their behavior is essential. Recent works have revealed the potential of metaheuristic-assisted approximators for this purpose. The main idea of this paper, therefore, is to introduce a novel integrative model for appraising the axial compression capacity (Pu) of CFSTCs. The proposed model represents an artificial neural network (ANN) supervised by satin bowerbird optimizer (SBO). In other words, this metaheuristic algorithm trains the ANN optimally to find the best contribution of input parameters to the Pu. In this sense, column length and the compressive strength of concrete, as well as the characteristics of the steel tube (i.e., diameter, thickness, yield stress, and ultimate stress), are considered input data. The prediction results are compared to five ANNs supervised by backtracking search algorithm (BSA), earthworm optimization algorithm (EWA), social spider algorithm (SOSA), salp swarm algorithm (SSA), and wind-driven optimization. Evaluating various accuracy indicators showed that the proposed model surpassed all of them in both learning and reproducing the Pu pattern. The obtained values of mean absolute percentage error of the SBO-ANN was 2.3082% versus 4.3821%, 17.4724%, 15.7898%, 4.2317%, and 3.6884% for the BSA-ANN, EWA-ANN, SOSA-ANN, SSA-ANN and WDA-ANN, respectively. The higher accuracy of the SBO-ANN against several hybrid models from earlier literature was also deduced. Moreover, the outcomes of principal component analysis on the dataset showed that the yield stress, diameter, and ultimate stress of the steel tube are the three most important factors in Pu prediction. A predictive formula is finally derived from the optimized SBO-ANN by extracting and organizing the weights and biases of the ANN. Owing to the accurate estimation shown by this model, the derived formula can reliably predict the Pu of concrete-filled steel tube columns. [ABSTRACT FROM AUTHOR]

This study presents an advanced metaheuristic approach termed the Enhanced Gorilla Troops Optimizer (EGTO), which builds upon the Marine Predators Algorithm (MPA) to enhance the search capabilities of the Gorilla Troops Optimizer (GTO). Like numerous other metaheuristic algorithms, the GTO encounters difficulties in preserving convergence accuracy and stability, notably when tackling intricate and adaptable optimization problems, especially when compared to more advanced optimization techniques. Addressing these challenges and aiming for improved performance, this paper proposes the EGTO, integrating high and low-velocity ratios inspired by the MPA. The EGTO technique effectively balances exploration and exploitation phases, achieving impressive results by utilizing fewer parameters and operations. Evaluation on a diverse array of benchmark functions, comprising 23 established functions and ten complex ones from the CEC2019 benchmark, highlights its performance. Comparative analysis against established optimization techniques reveals EGTO's superiority, consistently outperforming its counterparts such as tuna swarm optimization, grey wolf optimizer, gradient based optimizer, artificial rabbits optimization algorithm, pelican optimization algorithm, Runge Kutta optimization algorithm (RUN), and original GTO algorithms across various test functions. Furthermore, EGTO's efficacy extends to addressing seven challenging engineering design problems, encompassing three-bar truss design, compression spring design, pressure vessel design, cantilever beam design, welded beam design, speed reducer design, and gear train design. The results showcase EGTO's robust convergence rate, its adeptness in locating local/global optima, and its supremacy over alternative methodologies explored. [ABSTRACT FROM AUTHOR]

In order to improve the accuracy of transformer fault diagnosis and improve the influence of unbalanced samples on the low accuracy of model identification caused by insufficient model training, this paper proposes a transformer fault diagnosis method based on SMOTE and NGO-GBDT. Firstly, the Synthetic Minority Over-sampling Technique (SMOTE) was used to expand the minority samples. Secondly, the non-coding ratio method was used to construct multi-dimensional feature parameters, and the Light Gradient Boosting Machine (LightGBM) feature optimization strategy was introduced to screen the optimal feature subset. Finally, Northern Goshawk Optimization (NGO) algorithm was used to optimize the parameters of Gradient Boosting Decision Tree (GBDT), and then the transformer fault diagnosis was realized. The results show that the proposed method can reduce the misjudgment of minority samples. Compared with other integrated models, the proposed method has high fault identification accuracy, low misjudgment rate and stable performance. [ABSTRACT FROM AUTHOR]

Artificial Neural Networks (ANNs) have been used in a multitude of real-world applications given their predictive capabilities, and algorithms based on gradient descent, such as Backpropagation (BP) and variants, are usually considered for their optimisation. However, these algorithms have been shown to get stuck at local optima, and they require a cautious design of the architecture of the model. This paper proposes a novel memetic training method for simultaneously learning the ANNs structure and weights based on the Coral Reef Optimisation algorithms (CROs), a global-search metaheuristic based on corals' biology and coral reef formation. Three versions based on the original CRO combined with a Local Search procedure are developed: (1) the basic one, called Memetic CRO; (2) a statistically guided version called Memetic SCRO (M-SCRO) that adjusts the algorithm parameters based on the population fitness; (3) and, finally, an improved Dynamic Statistically-driven version called Memetic Dynamic SCRO (M-DSCRO). M-DSCRO is designed with the idea of improving the M-SCRO version in the evolutionary process, evaluating whether the fitness distribution of the population of ANNs is normal to automatically decide the statistic to be used for assigning the algorithm parameters. Furthermore, all algorithms are adapted to the design of ANNs by means of the most suitable operators. The performance of the different algorithms is evaluated with 40 classification datasets, showing that the proposed M-DSCRO algorithm outperforms the other two versions on most of the datasets. In the final analysis, M-DSCRO is compared against four state-of-the-art methods, demonstrating its superior efficacy in terms of overall accuracy and minority class performance. [ABSTRACT FROM AUTHOR]

Feature selection is a critical component of machine learning and data mining to remove redundant and irrelevant features from a dataset. The Chimp Optimization Algorithm (CHoA) is widely applicable to various optimization problems due to its low number of parameters and fast convergence rate. However, CHoA has a weak exploration capability and tends to fall into local optimal solutions in solving the feature selection process, leading to ineffective removal of irrelevant and redundant features. To solve this problem, this paper proposes the Enhanced Chimp Hierarchy Optimization Algorithm for adaptive lens imaging (ALI-CHoASH) for searching the optimal classification problems for the optimal subset of features. Specifically, to enhance the exploration and exploitation capability of CHoA, we designed a chimp social hierarchy. We employed a novel social class factor to label the class situation of each chimp, enabling effective modelling and optimization of the relationships among chimp individuals. Then, to parse chimps' social and collaborative behaviours with different social classes, we introduce other attacking prey and autonomous search strategies to help chimp individuals approach the optimal solution faster. In addition, considering the poor diversity of chimp groups in the late iteration, we propose an adaptive lens imaging back-learning strategy to avoid the algorithm falling into a local optimum. Finally, we validate the improvement of ALI-CHoASH in exploration and exploitation capabilities using several high-dimensional datasets. We also compare ALI-CHoASH with eight state-of-the-art methods in classification accuracy, feature subset size, and computation time to demonstrate its superiority. [ABSTRACT FROM AUTHOR]

The shuffled frog leaping algorithm (SFLA) is a promising metaheuristic bionics algorithm, which has been designed by the shuffled complex evolution and the particle swarm optimization (PSO) framework. However, it is easily trapped into local optimum and has the low optimization accuracy when it is used to optimize complex engineering problems. To overcome the shortcomings, a novel modified shuffled frog leaping algorithm (MSFLA) with inertia weight is proposed in this paper. To extend the scope of the direction and length of the updated worst frog (vector) of the original SFLA, the inertia weight α was introduced and its meaning and range of the new parameters are fully explained. Then the convergence of the MSFLA is deeply analyzed and proved theoretically by a new dynamic equation formed by Z-transform. Finally, we have compared the solution of the 7 benchmark functions with the original SFLA, other improved SFLAs, genetic algorithm, PSO, artificial bee colony algorithm, and the grasshopper optimization algorithm with invasive weed optimization. The testing results showed that the modified algorithms can effectively improve the solution accuracy and convergence property, and exhibited an excellent ability of global optimization in high-dimensional space and complex function problems. [ABSTRACT FROM AUTHOR]

Addressing the challenge of efficiently solving multi-objective optimization problems (MOP) and attaining satisfactory optimal solutions has always posed a formidable task. In this paper, based on the chicken swarm optimization algorithm, proposes the non-dominated sorting chicken swarm optimization (NSCSO) algorithm. The proposed approach involves assigning ranks to individuals in the chicken swarm through fast non-dominance sorting and utilizing the crowding distance strategy to sort particles within the same rank. The MOP is tackled based on these two strategies, with the integration of an elite opposition-based learning strategy to facilitate the exploration of optimal solution directions by individual roosters. NSCSO and 6 other excellent algorithms were tested in 15 different benchmark functions for experiments. By comprehensive comparison of the test function results and Friedman test results, the results obtained by using the NSCSO algorithm to solve the MOP problem have better performance. Compares the NSCSO algorithm with other multi-objective optimization algorithms in six different engineering design problems. The results show that NSCSO not only performs well in multi-objective function tests, but also obtains realistic solutions in multi-objective engineering example problems. [ABSTRACT FROM AUTHOR]

The shuffled frog leaping algorithm (SFLA) is a promising metaheuristic bionics algorithm, which has been designed by the shuffled complex evolution and the particle swarm optimization (PSO) framework. However, it is easily trapped into local optimum and has the low optimization accuracy when it is used to optimize complex engineering problems. To overcome the shortcomings, a novel modified shuffled frog leaping algorithm (MSFLA) with inertia weight is proposed in this paper. To extend the scope of the direction and length of the updated worst frog (vector) of the original SFLA, the inertia weight α was introduced and its meaning and range of the new parameters are fully explained. Then the convergence of the MSFLA is deeply analyzed and proved theoretically by a new dynamic equation formed by Z-transform. Finally, we have compared the solution of the 7 benchmark functions with the original SFLA, other improved SFLAs, genetic algorithm, PSO, artificial bee colony algorithm, and the grasshopper optimization algorithm with invasive weed optimization. The testing results showed that the modified algorithms can effectively improve the solution accuracy and convergence property, and exhibited an excellent ability of global optimization in high-dimensional space and complex function problems. [ABSTRACT FROM AUTHOR]

Health condition assessment is the basis for formulating and optimizing maintenance strategies of complex systems, which is crucial for ensuring the safe and stable operation of these systems. In complex system health condition assessment, it is not only necessary for the model to handle various uncertainties to ensure the accuracy of assessment results, but also to have a transparent and reasonable assessment process and interpretable, traceable assessment results. belief rule base (BRB) has been widely used as an interpretable modeling method in health condition assessment. However, BRB-based models currently face two issues: (1) inaccuracies in expert-provided parameters that can affect the model's accuracy, and (2) after model optimization, interpretability may be reduced. Therefore, this paper proposes a new method for complex system health condition assessment called interpretable BRB with reference value optimization (I-BRB). Firstly, to address the issue of inaccurate reference values, a reference value optimization algorithm with interpretability constraints is designed, which optimizes the reference values without compromising expert knowledge. Secondly, the remaining parameters are optimized using the projection covariance matrix adaptation evolution strategy (P-CMA-ES) with interpretability constraints to improve the model's accuracy. Finally, a case study evaluating the bearing components of a flywheel system is conducted to validate the proposed method. Experimental results demonstrate that I-BRB achieves higher accuracy in health condition assessment. [ABSTRACT FROM AUTHOR]

Path planning is one of the most critical issues in many related fields including UAVs. Many researchers have addressed this problem according to different conditions and limitations, but modelling the 3-D space and routing with an evolutional algorithm in such spaces is an open issue. So, in this paper, we first, introduce a method to grids the environment using geometrical shapes. This can reduce the random states of cell decomposition and increases the computational speed. We then propose an effective routing algorithm based on the butterfly optimization algorithm (BOA). It can simultaneously optimize multiple path planning objectives. It uses an objective function to compute the shortest path, based on obstacle avoidance and the UAV's operational power minimization. A novel concept, the intelligent throwing agent, used in this algorithm prevents getting stuck in local optima and increases the network coverage in path planning. The throwing agent prevents the collision of the UAV with the obstacles using geometrical techniques and contour lines. The simulation results show that BOA has the least and second-least cost in best-case and worst-case scenarios in comparison with ant colony and particle swarm. Its run time and the optimal value of the fitting function are also better than the two other algorithms. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) is extensively used in modern-day life, such as in smart homes, intelligent transportation, etc. However, the present security measures cannot fully protect the IoT due to its vulnerability to malicious assaults. Intrusion detection can protect IoT devices from the most harmful attacks as a security tool. Nevertheless, the time and detection efficiencies of conventional intrusion detection methods need to be more accurate. The main contribution of this paper is to develop a simple as well as intelligent security framework for protecting IoT from cyber-attacks. For this purpose, a combination of Decisive Red Fox (DRF) Optimization and Descriptive Back Propagated Radial Basis Function (DBRF) classification are developed in the proposed work. The novelty of this work is, a recently developed DRF optimization methodology incorporated with the machine learning algorithm is utilized for maximizing the security level of IoT systems. First, the data preprocessing and normalization operations are performed to generate the balanced IoT dataset for improving the detection accuracy of classification. Then, the DRF optimization algorithm is applied to optimally tune the features required for accurate intrusion detection and classification. It also supports increasing the training speed and reducing the error rate of the classifier. Moreover, the DBRF classification model is deployed to categorize the normal and attacking data flows using optimized features. Here, the proposed DRF-DBRF security model's performance is validated and tested using five different and popular IoT benchmarking datasets. Finally, the results are compared with the previous anomaly detection approaches by using various evaluation parameters. [ABSTRACT FROM AUTHOR]