Search

Nanofluids, characterized by the dispersion of nanoparticles in a base liquid, have attracted significant attention in recent years due to their exceptional thermal properties. Specifically, the specific heat capacity of nanofluids plays a crucial role in the design and optimization of heat transfer systems. Traditional experimental methods for determining the specific heat capacity of nanofluids are often limited in terms of cost, time, and operating condition ranges. To address these limitations, this research focuses on the development of a novel predictive model for estimating the specific heat capacity of nanofluids. This study aims to develop a machine learning regression model called Gradient Boost Regression (GBR) with Grid Search optimization (GSO) for accurately predicting the specific heat capacity of aluminum nitride (Al2N3) nanoparticles that are suspended in both water and an ethylene glycol (EG) solution. The GBR-GSO model capitalizes on the strengths of GBR, which can effectively capture complex relationships, and GSO, a metaheuristic optimization technique inspired by the law of gravity. By integrating these two approaches, we aim to create a robust and accurate predictive model for specific heat capacity in nanofluids. To develop and validate the GBR-GSO model, a diverse dataset based on experimental-specific heat capacity collected from the literature has been designed. The performance of the model has been evaluated by comparing its predictions with experimental data. The GBR-GSO model achieved 99.99% accuracy with the experimental data of specific heat capacity. This research contributes to the advancement of nanofluid-based heat transfer systems by providing an effective tool for predicting the specific heat capacity of nanofluids. The developed model can facilitate the design and optimization of various engineering applications, leading to the development of energy-efficient and sustainable technologies. [ABSTRACT FROM AUTHOR]

In this paper, a new model predictive control termed as intelligent model predictive control (IMPC) combined with an improved new competitive swarm optimizer (CSO) is designed. The analytical predictive model is not necessarily established a priori in the proposed IMPC algorithm, and the control plant can be used directly as the predictive model to reduce the complexity of the algorithm. In addition, two new techniques, dynamic initialization and back steps methods, are proposed and utilized to improve the traditional CSO to realize constraints management during the optimization process. An application to aeroengine transient-state control is studied to verify the effectiveness of the presented IMPC algorithm. It is shown that, benefitting from the IMPC algorithm, the control task is well completed and all the constraints are satisfied. Practical Applications: This paper proposes a new optimization algorithm to solve some complex optimization problems with constraints. The designed new optimization algorithm is simple and easy to implement and it is more suitable for applications with black-box models or complex optimization objective functions compared with some existing optimization algorithms. This paper may provide some help to researchers who are interested in model predictive control or metaheuristic algorithms and to people whose work contains some complex optimization problems. This paper also provides a design method of aeroengine transient-state control plans. The simulation results showed that compared with some existing control methods or optimization algorithms, the aeroengine could accelerate to the desired steady-state point with shorter transient time and all constraints are satisfied when utilizing the proposed new optimization algorithm. [ABSTRACT FROM AUTHOR]

This study is a first attempt to provide an effective tool for crack prediction in beam-type structures using the peridynamics (PD) theory and metaheuristic-based optimization. The norm of the difference between the response of the tested beam and that of the trial model (analyzed using PD), is minimized to find the position and depth of crack. Model calibration is discussed thoroughly. Five well-known metaheuristics as well as an upgraded charged system search algorithm are considered. Results reveal that the proposed procedure can effectively localize and detect the crack severity, even in noise contaminated cases. [ABSTRACT FROM AUTHOR]

Brushless direct current (BLDC) motors are widely used in dynamic applications because of advantages such as high efficiency, wide speed range and low maintenance requirements. The classical Proportional-Integral (PI) control method is generally used for speed control of BLDC motor drivers. Although this method is easy to apply, the determined controller coefficients are generally constant and hence insufficient in dynamic changes. For this reason, methods that respond faster to dynamic changes, such as fuzzy-PI, have been proposed in the literature. Although the rule-based fuzzy controller increases its response ability to dynamic changes, determined rule-based coefficients affects the system performance completely. Therefore, the determination of the rule base values of the fuzzy controller is critical. In this paper, meta-heuristic Cuckoo Optimization Algorithm (COA) is proposed to determine the rule base values of the fuzzy controller for BLDC motor. Additionally, the rule-based table values of the fuzzy controller used for BLDC motor is determined using other meta-heuristic algorithms such as Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Imperialist Competitive Algorithm (ICA), Invasive Weed Optimization (IWO) and the results are compared. Finally, experimental studies for Pittman44 series BLDC motor are also carried out and the results are obtained. [ABSTRACT FROM AUTHOR]

In wind energy systems, it is necessary to have a good knowledge of the used generator and its parameters. Despite the motor manufacturer's specifications, accurately estimating the machine parameter reference values is critical for the perfect control system. In this context, off-line identification tests of a 3 kW permanent magnet synchronous machine were conducted to determine the mechanical and electrical parameters. In addition, this research exploits a meta-heuristic optimization technic dubbed grey wolf optimizer in the on-line parameter's identification field. The estimate method is focused on the parameter's estimation linked to a reference model. The rule is based on the cancelation of the current error among the measured and the associated estimated current. For each measurement, the grey wolf estimator adapts the reference model parameters until the model response and the accurate response be similar. All were implemented using the real-time interface of the DSpace DS1104 Controller card while using the ControlDesk graphical user interface and the Simulink/MATLAB environments. Results from hardware simulation confirm the efficacy and benefits of the suggested strategy. [ABSTRACT FROM AUTHOR]

• A new Weibull log-logistic mixture distribution accumulation generation operator is established. • A novel grey model with multiple interaction effects is established. • The robustness and stability of the proposed method is proved and validated. • A new parameter estimation method is designed. • The proposed method is superior to other seven benchmark models in four case studies. Forecasting the failure of hard disk drives is important in server operation and has attracted increasing attention. However, current disk drive warning systems suffer from high false positive rates and high resource consumption when dealing with hard disk drive overall failure. Therefore, to accurately and stably predict hard disk drive overall failure, this paper develops a new Weibull Log-Logistic grey forecasting model with multiple interaction effects. Firstly, to capture and fit the trend of hard disk failure data flexibly and reduce the volatility, a new accumulation generation operator is established by introducing the Weibull Log-Logistic mixture distribution. Secondly, the proposed model constructs a multiple interaction term to describe the nonlinear relationship of the dependent variables on the system behavior series and the multiple interaction effects between the independent variables. Then, the parameter estimation method is designed to improve the fitting accuracy of the new model, in which linear estimation method, nonlinear estimation method, and meta-heuristic optimization algorithm are used to calculate the parameter values according to their categories. Finally, four varieties of hard disk drive data sets from BackBlaze are selected as study cases to validate the effectiveness of the proposed model. The results show that the mean MAPE of the proposed method is 2.1181 %, 2.2306 %, 8.1712 %, and 4.3417 %, respectively, corresponding to (hard disk drives ST8000NM0055, ST12000NM0007, ST10000NM0086, and ST14000NM0138), and the average value of the evaluation metrics are optimal in all competing models. Furthermore, it is observed that the number of reallocated sectors has the greatest influence in causing the failure of hard disk drives. [ABSTRACT FROM AUTHOR]

Dynamic-radius search, formerly known as sequential search, is an effective neighborhood exploration technique for standard edge-exchange neighborhoods such as 2-opt, 2-opt*, swap, relocation, Or-opt, string exchange, etc. Up to now, it has only been used for vehicle routing problems with a homogeneous fleet and in the single-depot context. In this work, we extend dynamic-radius search to the multi-depot vehicle routing problem, in which 2-opt and 2-opt* moves may involve routes from different depots. To this end, we equip dynamic-radius search with a modified pruning criterion that still guarantees to identify a best-improving move, either intra-depot or inter-depot, with little additional computational effort. We experimentally confirm that substantial speedups of factors of 100 and more are achieved compared to an also optimized implementation of lexicographic search, another effective neighborhood exploration technique using a feasibility-based pruning criterion. As one would expect, better local optima are found on average when allowing inter-depot moves in radius search (positive result). Against intuition, we do however not end up with a better ILS metaheuristic regarding best found solutions, i.e., better average results do not translate into better overall results. We can at least partly explain the latter negative result, which might be useful for other researchers and their attempt to algorithmically optimize their neighborhood exploration procedures. [ABSTRACT FROM AUTHOR]

This study presents the K-means clustering-based grey wolf optimizer, a new algorithm intended to improve the optimization capabilities of the conventional grey wolf optimizer in order to address the problem of data clustering. The process that groups similar items within a dataset into non-overlapping groups. Grey wolf hunting behaviour served as the model for grey wolf optimizer, however, it frequently lacks the exploration and exploitation capabilities that are essential for efficient data clustering. This work mainly focuses on enhancing the grey wolf optimizer using a new weight factor and the K-means algorithm concepts in order to increase variety and avoid premature convergence. Using a partitional clustering-inspired fitness function, the K-means clustering-based grey wolf optimizer was extensively evaluated on ten numerical functions and multiple real-world datasets with varying levels of complexity and dimensionality. The methodology is based on incorporating the K-means algorithm concept for the purpose of refining initial solutions and adding a weight factor to increase the diversity of solutions during the optimization phase. The results show that the K-means clustering-based grey wolf optimizer performs much better than the standard grey wolf optimizer in discovering optimal clustering solutions, indicating a higher capacity for effective exploration and exploitation of the solution space. The study found that the K-means clustering-based grey wolf optimizer was able to produce high-quality cluster centres in fewer iterations, demonstrating its efficacy and efficiency on various datasets. Finally, the study demonstrates the robustness and dependability of the K-means clustering-based grey wolf optimizer in resolving data clustering issues, which represents a significant advancement over conventional techniques. In addition to addressing the shortcomings of the initial algorithm, the incorporation of K-means and the innovative weight factor into the grey wolf optimizer establishes a new standard for further study in metaheuristic clustering algorithms. The performance of the K-means clustering-based grey wolf optimizer is around 34% better than the original grey wolf optimizer algorithm for both numerical test problems and data clustering problems. [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]

The chimp optimization algorithm (ChOA) is a nature-inspired algorithm that imitates chimpanzees' individual intelligence and hunting behaviors. In this algorithm, the hunting process consists of four steps: driving, blocking, chasing, and attacking. Because of the novelty of ChOA, the steps of the hunting process have been modeled in the simplest possible way, leading to slow and premature convergence similar to other iterative algorithms. This paper proposes six spiral functions and introduces two novel hybrid spiral functions (SEB-ChOA) to rectify the abovementioned deficiencies. The SEB-ChOAs' performance is evaluated on 23 standard benchmarks, 20 benchmarks of IEEE CEC-2005, 10 cases of IEEE CEC06-2019 test-suite, and 12 constrained real-world engineering problems of IEEE CEC-2020. The SEB-ChOAs are compared with three groups of optimization algorithms, including Particle Swarm Optimization (PSO) and Genetic Algorithm (GA) as the most well-known optimization algorithms, Slime Mould Algorithm (SMA), Marine Predators Algorithm (MPA), Ant Lion Optimization (ALO), Henry Gas Solubility Optimization (HGSO), as almost novel optimization algorithms, and jDE100 and DISHchain1e+12, as winners of IEEE CEC06-2019 competition, and also EBOwithCMAR and CIPDE as superior secondary optimization algorithms. The SEB-ChOAs reached the first rank among almost all benchmarks and demonstrated very competitive results compared to jDE100 and DISHchain1e+12 as the best-performing optimizers. Statistical evidence shows that the SEB-ChOA outperforms the PSO, GA, SMA, MPA, ALO, and HGSO optimizers while producing results comparable to those of the jDE100 and DISHchain1e+12 algorithms. [ABSTRACT FROM AUTHOR]

To solve the problems of high computational cost and the long time required by the simulation and calculation of aeroengines' exhaust systems, a method of predicting the characteristics of infrared radiation based on the hybrid kernel extreme learning machine (HKELM) optimized by the improved dung beetle optimizer (IDBO) was proposed. Firstly, the Levy flight strategy and variable spiral strategy were introduced to improve the optimization performance of the dung beetle optimizer (DBO) algorithm. Secondly, the superiority of IDBO algorithm was verified by using 23 benchmark functions. In addition, the Wilcoxon signed-rank test was applied to evaluate the experimental results, which proved the superiority of the IDBO algorithm over other current prominent metaheuristic algorithms. Finally, the hyperparameters of HKELM were optimized by the IDBO algorithm, and the IDBO-HKELM model was applied to the prediction of characteristics of infrared radiation of a typical axisymmetric nozzle. The results showed that the RMSE and MAE of the IDBO-HKELM model were 20.64 and 8.83, respectively, which verified the high accuracy and feasibility of the proposed method for predictions of aeroengines' infrared radiation characteristics. [ABSTRACT FROM AUTHOR]

In an effort to balance the distribution of services across a given territory, dispersion and diversity models typically aim to maximize the minimum distance between any pair of facilities. Specifically, in the capacitated dispersion problem (CDP), each facility has an associated capacity or level of service, and the objective is to select a set of facilities so that the minimum distance between any pair of them (dispersion) is maximized, while ensuring a user-defined level of service. This problem can be formulated as a linear integer model, where the sum of the capacities of the selected facilities must match or exceed the total demand in the network. Real-life applications often necessitate considering the levels of uncertainty affecting the capacity of the nodes. Failure to account for this uncertainty could lead to low-quality or infeasible solutions in practical scenarios. However, research addressing the stochastic version of the CDP is scarce. This paper introduces two models for the CDP with stochastic capacities, incorporating soft constraints and penalty costs for violating the total capacity constraint. The first model includes a probabilistic constraint to ensure the required level of service with a certain probability, while the second model introduces a soft constraint with penalty costs for violations. To solve both variants of the model, a forward–backward simheuristic algorithm is proposed. Our approach combines a metaheuristic algorithm with Monte Carlo simulation, enabling the efficient handling of the random behavior of node capacities and obtaining reliable solutions regardless of their probability distribution. [ABSTRACT FROM AUTHOR]

This paper addresses the critical role of supercapacitors as energy storage systems with a specific focus on their modeling and identification. The lack of a standardized and efficient method for identifying supercapacitor parameters has a definite effect on widespread adoption of supercapacitors, especially in high-power density applications like electric vehicle regenerative braking. The study focuses on parameterizing the Zubieta model for supercapacitors, which involves identifying seven parameters using a hybrid metaheuristic gradient-based optimization (MGBO) approach. The effectiveness of the MGBO method is compared to the existing particle swarm optimization (PSO) and to the following algorithms proposed and developed in this work: 'modified MGBO' (M-MGBO) and two PSO variations—one combining PSO and M-MGBO and the other incorporating a local escaping operator (LCEO) with PSO. Metaheuristic- and gradient-based algorithms are both affected by problems associated with locally optimal results and with issues related to enforcing constraints/boundaries on solution values. This work develops the above-mentioned innovations to the MGBO and PSO algorithms for addressing such issues. Rigorous experimentation considering various types of input excitation provides results indicating that hybrid PSO-MGBO and PSO-LCEO outperform traditional PSO, showing improvements of 51% and 94%, respectively, while remaining comparable to M-MGBO. These hybrid approaches effectively estimate Zubieta model parameters. The findings highlight the potential of hybrid optimization strategies in enhancing precision and effectiveness in supercapacitor model parameterization. [ABSTRACT FROM AUTHOR]

The drum water level plays a crucial role in the safety and economy of heat recovery boilers. However, the control of the drum water level faces many challenges, such as external disturbances and system uncertainties. To enhance the control performance of the drum water level, a modified active disturbance rejection control (MADRC) optimized with sensitivity constraint is proposed in this paper. Firstly, the control structure of the three-element control system for the drum water level is introduced and analyzed. Based on the regular active disturbance rejection control (ADRC) structure, the structure of the MADRC is introduced and the convergence of the proposed MADRC is proven. Then a modified whale optimization algorithm (MWOA) with sensitivity constraint is applied to optimize the parameters of the MADRC. With different sensitivity constraints, the parameters of the MADRC and comparative controllers are obtained, and their control performance for tracking and disturbance rejection abilities is compared. Moreover, the ability to handle system uncertainties is analyzed. Simulation results and performance indexes show that the proposed MADRC can obtain the best tracking and disturbance rejection abilities with satisfactory robustness. The satisfactory control performance shows that the proposed MADRC has wide application potential for heat recovery boilers and other industrial processes. [ABSTRACT FROM AUTHOR]

Software-defined networking (SDN) is a network architecture where the control and data plane are separated. As the network size grows, relying on just one controller can lead to various problems. Thus, in highly scalable networks, multiple controllers are needed. This critical issue of determining the number and placement of controllers is known as the controller placement problem (CPP). In this paper, game theory is used to solve CPP by identifying the optimal number of controllers. Two algorithms, golden eagle optimization (GEO) and grey wolf optimization (GWO), are utilized to find the most efficient mapping between switches and controllers. Since CPP is a discrete problem, GEO and GWO have first been discretized and then hybridized to form a new algorithm called GEWO. This algorithm is used to discover the most efficient mapping between switches and controllers. Additionally, simulated annealing is employed for better local search. The effectiveness of this approach is evaluated using different numbers of controllers on four well-known software-defined networks from the Internet Topology Zoo. The results are compared against various existing algorithms in the field, and it is observed that GEWO outperforms the competition. The findings demonstrate that GEWO reduces load imbalance by 24.07%, decreases end-to-end delay by 20.95%, and lowers average energy consumption by 11.65%. [ABSTRACT FROM AUTHOR]

The Internet of Vehicles (IoV) is an Intelligent Transportation System, which in its turn is an application of the Internet of Things. The IoV is a network of connected vehicles that sends/receives messages. However, the moving nature of the vehicles in IoV networks raises a dynamic topology issue. Therefore, establishing effective and dependable communication pathways among vehicular nodes, contingent upon traffic density conditions, presents a growing challenge. As a result, the main contribution of this paper is to propose an efficient network optimization system involving a cluster-based network routing optimizer. The proposed method is a metaheuristic algorithm adapted as a clustering algorithm. For this purpose, the JAYA Algorithm (JAYA) was utilized and integrated with two clustering concepts extracted from K-means Clustering and Automatic Clustering, resulting in proposing JAYA Clustering Algorithm for IoV (JAYACIoV). Subsequently, the performance of the proposed algorithm was investigated utilizing 176 network testing scenarios, and extensive comparative evaluations were conducted against five algorithms from the literature. The results confirmed the superiority of the proposed system with a percentage of 64.82%, where the algorithms were ranked according to the percentage achievement of best results. [ABSTRACT FROM AUTHOR]

Optimization is necessary for solving and improving the solution of various complex problems. Every meta-heuristic algorithm can have a weak point, and multiple mechanisms and methods can be used to overcome these weaknesses. Some algorithms perform well in the discovery phase and some algorithms perform better in the exploitation phase. Hybridizing algorithms can be a good solution to achieve a powerful algorithm, and hybridizing algorithms and mechanisms greedily lead to an increase in computational complexity and execution time. This paper presents a new and intelligent approach by hybridizing meta-heuristic algorithms and using different mechanisms simultaneously without significantly increasing the time complexity. For this purpose, salp swarm optimization (SSO) and the African vulture optimization algorithm (AVOA) have been hybridized to improve the optimization process of the modified choice function and learning automata mechanisms. In addition, two other improving mechanisms, named opposition-based learning (OBL) and β-hill climbing (BHC) technique, have been presented and integrated with the AVOA–SSA algorithm. Fifty-two standard benchmarks were used to test and evaluate the AVOA–SSA algorithm. Finally, an improved version of the extreme learning machine (ELM) classifier has been used with real stock market data for stock market prediction. The obtained results indicate the excellent and acceptable performance of the AVOA–SSA algorithm in 'solving optimization problems and have been able to achieve high-quality solutions. According to the results obtained from the AVOA–SSA algorithm, in comparison to global optimization problems, the AVOA–SSA algorithm has been able to obtain the best results in 21 functions out of 23 standard benchmarks. Also, against CEC2017 problems, it has been able to perform best in 26 out of 29 functions. In addition, the AVOA–SSA algorithm has been able to perform better than other compared algorithms in all five datasets evaluated in the stock market. [ABSTRACT FROM AUTHOR]

This article addresses this challenge and proposes a novel approach based on the modified cuckoo search and chaos theory. This article describes a novel approach for multilevel biomedical image segmentation based on the modified cuckoo search and chaos theory which is the major contribution to the literature. The modified cuckoo search approach helps to model the Lévy flight efficiently and the incorporation of the chaos theory helps to maintain the diversity in the population. The proposed approach helps to determine the optimal threshold values for a given number of thresholds. Four different objective functions are used to get the realistic segmented output which is essential in biomedical image analysis. Moreover, detailed analysis is also helpful in understanding the suitable objective function for biomedical image segmentation. This work also helps to choose suitable chaotic maps with different optimization algorithms. Hybridization of chaos theory and modified cuckoo search helps to overcome the local optima and to find the global optima cost-effectively. The chaos theory is incorporated in this proposed work to replace some solutions with some chaotic sequences to enhance the associated randomness with various phases which is beneficial to overcome the premature convergence and its related issues. The optimum setup is determined by investigating the effect of different chaotic maps along with some standard metaheuristic optimization approaches. Both qualitative and quantitative approaches are used to evaluate and compare the proposed approach. The proposed algorithm is compared with four state-of-the-art approaches. The obtained results clearly show that the proposed approach outperforms some state-of-the-art approaches in terms of both quantitative results and segmented output. On average, the proposed approach can achieve 255.8331 MSE, 24.07047 PSNR, 291.6077 mean, 0.038869 SD, 0.688655 SSIM, and 16.05358 s execution time (all for nine clusters). It can be observed that the proposed approach can determine the optimal set of clusters comparatively faster on most occasions, especially for the higher number of clusters. [ABSTRACT FROM AUTHOR]

This paper presents a method that employs an evolutionary normal distributions transform (NDT) for simultaneous localization and mapping (SLAM) using light detection and ranging (LiDAR) for autonomous mobile robots. An adaptive inertia weight and two genetic operators were employed in the Taguchi-based whale optimization algorithm (WOA) to improve the search diversity and avoid local optima. NDT was used to model the environment of differential-drive mobile robots and WOA was applied to optimize the scan matching for the robotic SLAM problem. The NDT-WOA determines the SLAM pose estimation using sensed data from the physical world. A nonholonomic mobile robot was steered to achieve the NDT-WOA SLAM task with the derived robot kinematics and actuator dynamics. The proposed method was implemented in a TurtleBot3 Burger robotic development kit, which includes a single-board computer and an OpenCR control board. The Robot Operating System (ROS) was utilized to implement the evolutionary NDT-WOA SLAM system due to its flexibility, open source, and client library. Simulation and comparisons were conducted to illustrate the efficiency of the proposed NDT-WOA SLAM method compared to other SLAM paradigms. The experimental results show the effectiveness of the proposed evolutionary NDT-WOA SLAM for autonomous mobile robots. The results could have theoretical and practical significance for robotics research. [ABSTRACT FROM AUTHOR]

Thermoelectric generators (TEGs) are widely employed in microscale applications to generate power from waste-heat energy emitted by nonrenewable energy sources. The energy extracted from TEG is dependent on the temperature gradient across the hot- and cold-ends along with the electrical load applied. Therefore, a maximum power point tracking (MPPT) control is strongly preferred to constantly track the optimal point of TEG under diverse operational conditions. In this study, a new MPPT-based metaheuristic optimizer so-called Honey badger algorithm (HBA) is implemented to maximize the energy efficiency of TEG systems. The proposed technique seeks to optimize the dynamic response and eradicate oscillations near MPP. Various dynamic operating conditions are used to investigate the reliability of the optimized HBA-based MPPT method. The obtained results are compared with other energy harvesting approaches including incremental conductance (INC), hybrid gray wolf optimizer-sine cosine algorithm (HGWOSCA), and marine predators algorithm (MPA). The major findings verify that the employed optimized HBA method achieved highest power tracking efficiency more than 99 % with smallest tracking time up to 120 ms and maintaining a steady-state output at the different studied scenarios. [ABSTRACT FROM AUTHOR]

The index tracking problem consists of constructing a portfolio that has the closest performance of a given index as possible, with fewer assets in its composition. When considering a large number of assets, including all of them on the solution may incur high transaction fees, harming the accumulated returns in the long term. The constraint that limits the portfolio size imposes a combinatorial nature on the problem and the computation of the optimal solution becomes infeasible as the universe of assets grows. To get around this issue, pure and hybrid metaheuristics have been proposed in the literature to achieve good solutions in practical time. Different from pure metaheuristics, hybrid metaheuristics do not need any constraint handling or solution repairing approaches since they often use general-purpose solvers to adjust portfolio weights. This work presents a comparison between pure and hybrid genetic algorithms, which is one of the most popular heuristics applied in the portfolio selection field. We considered linear and nonlinear index tracking models in the experiments, where the GA that obtained the best performance in a single period optimization strategy, was selected to backtest in a dynamic index tracking approach. The results showed that hybrid GAs can compute good or even better solutions than the CPLEX solver and pure GAs, in a shorter time. [ABSTRACT FROM AUTHOR]

Deep learning has been widely used in various research fields. However, researchers have discovered that deep learning models are vulnerable to adversarial attacks. Existing word-level attacks can be seen as a combinatorial optimization problem to effectively conduct textual adversarial attacks, but inappropriate search spaces and search methods may affect attack effectiveness. Sentence-level attacks are successfully used in the field of reading comprehension, but the generated examples sometimes lead to semantic deviation. To address these issues, we propose a hybrid textual adversarial attack method that effectively enhances the performance of textual adversarial attacks. To the best of our knowledge, we are the first to conduct textual adversarial attacks by hybridizing Whale Optimization Algorithm (WOA) with style transfer from multiple sentence and word levels. The WOA is improved by incorporating data characteristics and the Metropolis criterion to escape from local optima and by leveraging the mutation operator to increase population diversity. The improved WOA and style transfer algorithm are fused in a parallel and vertical way. Style transfer can increase population diversity and expand the search space, usually without destroying the semantics and syntax of sentences. The parallel combination improves attack performance by attacking from both word-level and sentence-level perspectives. As a black-box attack model, our method can attack without knowing the internal structure of the model. Compared with the state-of-the-art method, our framework can improve the attack success rate by 6.8%. Additionally, further experiments on grammatical error increase rates, semantic consistency, and transferability demonstrate that our model has excellent performance in many respects. [ABSTRACT FROM AUTHOR]

• A graph neural network is proposed for learning multi-satellite scheduling policy. • It analyzes the differential impact of various constraints in scheduling. • It models the multi-satellite scheduling problem as a heterogeneous graph. • It designs a variant transformer to learn various relations within graph. • It designs a two-stage model to learn a multi-satellite scheduling policy. In this paper, we investigate the multi-satellite scheduling (MSS) problem, a combinatorial optimization problem (COP) that aims to enhance satellite utilization. Numerous scholars have conducted in-depth studies on this matter. Handcrafted policies are commonly employed in various algorithms. Despite the use of graphical representations, designing policies manually becomes increasingly difficult, particularly as the number of satellites and tasks grows. Consequently, we propose a novel approach for automatically summarizing graph structures and learning policies for MSS problem. The proposed approach is developed based on graph neural network, Transformer, and sequence to sequence framework. First, MSS problem is modeled as a heterogeneous graph following various constraints. Next, the encoder, which is based on GNN and Transformer, is designed to summarize crucial information from the aforementioned graph. Finally, a two-stage decoder is proposed taking into account dynamic information in stepwise solution generation. Since obtaining optimal solutions in practical applications is challenging, we train the model using reinforcement learning. The results of the experiment demonstrate that our proposed method performs effectively in various scenarios. The quality of the solutions generated through this method transcends that of conventional construction methods. Additionally, the method generates solutions quickly, which are comparable in quality to those produced by meta-heuristic algorithms. [ABSTRACT FROM AUTHOR]

The standard whale algorithm is prone to suboptimal results and inefficiencies in high-dimensional search spaces. Therefore, examining the whale optimization algorithm components is critical. The computer-generated initial populations often exhibit an uneven distribution in the solution space, leading to low diversity. We propose a fusion of this algorithm with a discrete recombinant evolutionary strategy to enhance initialization diversity. We conduct simulation experiments and compare the proposed algorithm with the original WOA on thirteen benchmark test functions. Simulation experiments on unimodal or multimodal benchmarks verified the better performance of the proposed RESHWOA, such as accuracy, minimum mean, and low standard deviation rate. Furthermore, we performed two data reduction techniques, Bhattacharya distance and signal-to-noise ratio. Support Vector Machine (SVM) excels in dealing with high-dimensional datasets and numerical features. When users optimize the parameters, they can significantly improve the SVM's performance, even though it already works well with its default settings. We applied RESHWOA and WOA methods on six microarray cancer datasets to optimize the SVM parameters. The exhaustive examination and detailed results demonstrate that the new structure has addressed WOA's main shortcomings. We conclude that the proposed RESHWOA performed significantly better than the WOA. [ABSTRACT FROM AUTHOR]

Cybersecurity is critical in today's digitally linked and networked society. There is no way to overestimate the importance of cyber security as technology develops and becomes more pervasive in our daily lives. Cybersecurity is essential to people's protection. One type of cyberattack known as "credential stuffing" involves using previously acquired usernames and passwords by attackers to access user accounts on several websites without authorization. This is feasible as a lot of people use the same passwords and usernames on several different websites. Maintaining the security of online accounts requires defence against credential-stuffing attacks. The problems of credential stuffing attacks, failure detection, and prediction can be handled by the suggested EWOA-ANN model. Here, a novel optimization approach known as Enhanced Whale Optimization Algorithm (EWOA) is put on to train the neural network. The effectiveness of the suggested attack identification model has been demonstrated, and an empirical comparison will be carried out with respect to specific security analysis. [ABSTRACT FROM AUTHOR]

This study presents the K-means clustering-based grey wolf optimizer, a new algorithm intended to improve the optimization capabilities of the conventional grey wolf optimizer in order to address the problem of data clustering. The process that groups similar items within a dataset into non-overlapping groups. Grey wolf hunting behaviour served as the model for grey wolf optimizer, however, it frequently lacks the exploration and exploitation capabilities that are essential for efficient data clustering. This work mainly focuses on enhancing the grey wolf optimizer using a new weight factor and the K-means algorithm concepts in order to increase variety and avoid premature convergence. Using a partitional clustering-inspired fitness function, the K-means clustering-based grey wolf optimizer was extensively evaluated on ten numerical functions and multiple real-world datasets with varying levels of complexity and dimensionality. The methodology is based on incorporating the K-means algorithm concept for the purpose of refining initial solutions and adding a weight factor to increase the diversity of solutions during the optimization phase. The results show that the K-means clustering-based grey wolf optimizer performs much better than the standard grey wolf optimizer in discovering optimal clustering solutions, indicating a higher capacity for effective exploration and exploitation of the solution space. The study found that the K-means clustering-based grey wolf optimizer was able to produce high-quality cluster centres in fewer iterations, demonstrating its efficacy and efficiency on various datasets. Finally, the study demonstrates the robustness and dependability of the K-means clustering-based grey wolf optimizer in resolving data clustering issues, which represents a significant advancement over conventional techniques. In addition to addressing the shortcomings of the initial algorithm, the incorporation of K-means and the innovative weight factor into the grey wolf optimizer establishes a new standard for further study in metaheuristic clustering algorithms. The performance of the K-means clustering-based grey wolf optimizer is around 34% better than the original grey wolf optimizer algorithm for both numerical test problems and data clustering problems. [ABSTRACT FROM AUTHOR]

Understanding air quality requires a comprehensive understanding of its various factors. Most of the association rule techniques focuses on high frequency terms, ignoring the potential importance of low- frequency terms and causing unnecessary storage space waste. Therefore, a dynamic genetic association rule mining algorithm is proposed in this paper, which combines the improved dynamic genetic algorithm with the association rule mining algorithm to realize the importance mining of low- frequency terms. Firstly, in the chromosome coding phase of genetic algorithm, an innovative multi-information coding strategy is proposed, which selectively stores similar values of different levels in one storage unit. It avoids storing all the values at once and facilitates efficient mining of valid rules later. Secondly, by weighting the evaluation indicators such as support, confidence and promotion in association rule mining, a new evaluation index is formed, avoiding the need to set a minimum threshold for high-interest rules. Finally, in order to improve the mining performance of the rules, the dynamic crossover rate and mutation rate are set to improve the search efficiency of the algorithm. In the experimental stage, this paper adopts the 2016 annual air quality data set of Beijing to verify the effectiveness of the unit point multi-information coding strategy in reducing the rule storage air, the effectiveness of mining the rules formed by the low frequency item set, and the effectiveness of combining the rule mining algorithm with the swarm intelligence optimization algorithm in terms of search time and convergence. In the experimental stage, this paper adopts the 2016 annual air quality data set of Beijing to verify the effectiveness of the above three aspects. The unit point multi-information coding strategy reduced the rule space storage consumption by 50%, the new evaluation index can mine more interesting rules whose interest level can be up to 90%, while mining the rules formed by the lower frequency terms, and in terms of search time, we reduced it about 20% compared with some meta-heuristic algorithms, while improving convergence. [ABSTRACT FROM AUTHOR]

In this paper, we propose consensus-based optimization for saddle point problems (CBO-SP), a novel multi-particle metaheuristic derivative-free optimization method capable of provably finding global Nash equilibria. Following the idea of swarm intelligence, the method employs two groups of interacting particles, one which performs a minimization over one variable while the other performs a maximization over the other variable. The two groups constantly exchange information through a suitably weighted average. This paradigm permits a passage to the mean-field limit, which makes the method amenable to theoretical analysis, and it allows to obtain rigorous convergence guarantees under reasonable assumptions about the initialization and the objective function, which most notably include nonconvex-nonconcave objectives. We further provide numerical evidence for the success of the algorithm. [ABSTRACT FROM AUTHOR]

The transient and metaheuristic cost analysis of a MX/G(a, b)/1 retrial queue with random failure during an extended Bernoulli vacation with impatient clients is covered in this study. Any batch that arrives and discovers the server is busy, down, or on vacation joins an orbit. In the alternative, only one new customer from the group joins the service right away, while the others join the orbit. After providing each service, the server either waits to serve the following customer with probability (1 - θ) or goes on vacation with probability θ. It has been found that these systems express steady-state solutions and are dependent on time probability generating functions in consideration of their Laplace transforms. We also discuss a few exceptional and particular instances. After that, the impact of different parameters on the system's effectiveness is evaluated. We are also talking about ANFIS. Additional approaches employed in this study to swiftly determine the system's optimum cost include genetic algorithms (GA), artificial bee colonies (ABC), and particle swarm optimization (PSO). We also examined the graph-based convergence of several optimization algorithms. [ABSTRACT FROM AUTHOR]

The primary objective of present research work is to evaluate and improve the performance and availability of the paint manufacturing plant. Paint manufacturing plant consists of five subsystem naming mixer, grinder, thinner, labelling, and filling unit. Among them labelling and filling unit have two machines in parallel configuration and both are working simultaneously. All failure and repair rates are distributed exponentially. Markov birth-death process is utilized to model the dynamic behavior of the system and its sub-components, enabling a quantitative analysis of system availability. Grey wolf optimization (GWO), a swarm-based optimization technique is used to optimize the availability of the system. Moreover, the research conducts a thorough comparison between the outcomes derived from the Markov birth-death process and the GWO technique. By harnessing the power of GWO, the study aims to further enhance the plant's overall performance. [ABSTRACT FROM AUTHOR]

Metaheuristic algorithms are often preferred for solving constrained engineering design optimization problems. The most important reason for choosing these algorithms is that they guarantee a satisfactory response within a reasonable time. The swarm intelligence-based manta ray foraging optimization algorithm (MRFO) is a metaheuristic algorithm proposed to solve engineering applications. In this study, the performance of MRFO is evaluated on 19 mechanical engineering optimization problems in the CEC2020 real-world constrained optimization problem suite. In order to increase the MRFO performance, three modifications are made to the algorithm; in this way, the enhanced manta ray foraging optimization (EMRFO) algorithm is proposed. The effects of the modifications made are analyzed and interpreted separately. Its performance has been compared with the algorithms in the literature, and it has been shown that EMRFO is a successful and preferable algorithm for this problem suite. [ABSTRACT FROM AUTHOR]

In order to further improve the accuracy of photovoltaic (PV) power prediction and the stability of power system, a short-term PV power prediction model based on hierarchical clustering of K-means++ algorithm and deep learning hybrid model is proposed in this paper. First, hierarchical clustering of the K-means++ algorithm is used to cluster historical data into different weather scenes according to different seasons. Second, a hybrid model combining convolutional neural network (CNN), squeeze-and-excitation attention mechanism (SEAM), and bidirectional long short-term memory (BILSTM) neural network is constructed to capture long-term dependencies in time series, and the improved pelican optimization algorithm (IPOA) is used to optimize the hyperparameters in the prediction model. Finally, an example for modeling analysis is conducted by using the actual output and meteorological data of a PV power station in the Ili region of Xinjiang, China. The effectiveness and accuracy of the proposed model are verified by comparing with LSTM, BILSTM, CNN-BILSTM, and POA-CNN-SEAM-BILSTM models, and the superiority of IPOA is verified by comparing with particle swarm optimization and whale optimization algorithm. The results show that the proposed model can obtain better results under different weather scenes in different seasons, and the prediction accuracy of the model optimized by IPOA is further improved. [ABSTRACT FROM AUTHOR]

As distributed generation (DG) becomes increasingly integrated into the distribution grid, the structure of the distribution network is becoming more complex. To enhance the safety and cost-effectiveness of distribution systems, distribution network reconfiguration is gaining significant importance. Achieving optimal distribution network reconfiguration entails two key considerations: A feasible topology and economic efficiency. This paper addresses these challenges by introducing a novel approach that combines the potential island detection in undirected-graphs and the application of a whale optimization algorithm (WOA) for network reconfiguration optimization. To begin, we identified island categories based on the type of switchable-branches connected to these islands, allowing for the construction of potential island groups. Subsequently, unfeasible topologies were eliminated based on the conditions under which islands form within these potential island groups. Feasible topologies were then used to construct a model for network reconfiguration optimization. The optimal distribution network topology is determined using the WOA. In the final phase, the proposed method's effectiveness was demonstrated through a case study on the IEEE-33 node distribution network under scenarios with and without DG integration. The results showed that the proposed method exhibited better performance than traditional approaches in distribution network reconfiguration. [ABSTRACT FROM AUTHOR]

Segmentation of skin lesions is a significant and demanding task in dermoscopy images. This paper proposes a new skin cancer recognition scheme, with: "Pre-processing, Segmentation, Feature extraction, Optimal Feature Selection and Classification". Here, pre-processing is done with certain processes. The pre-processed images are segmented via the "Otsu Thresholding model". The third phase is feature extraction, where Deviation Relevance-based "Local Binary Pattern (DRLBP), Gray-Level Co-Occurrence Matrix (GLCM) features and Gray Level Run-Length Matrix (GLRM) features" are extracted. From these extracted features, the optimal features are chosen via Particle Updated WOA (PU-WOA) model. Subsequently, classification occurs via Optimized DCNN and NN to classify the skin lesion. To make the classification more precise, the DCNN is optimized by the introduced algorithm. The result has shown a higher accuracy of 0.998737, when compared with other extant models like IPSO, IWOA, PSO+CNN, WOA+CNN and CNN schemes. [ABSTRACT FROM AUTHOR]

Land cover data is very significant for designing the earth system, managing the natural resources, and also for performing conservation planning. Time-series data are captured with their dynamic vegetation behavior using remote sensing technology, which is broadly utilized in land cover mapping. Most of the Vegetation Index (VI) such as the Enhanced Vegetation Index (EVI) and Normalized Difference Vegetation Index (NDVI) comprises commonly employed features that are obtained from the time-series spectral data. But, these VIs are not validated as the optimal techniques for generating the temporal profiles. Recent researches highly depend on optical satellite imagery for performing these above-mentioned tasks. Dynamic Time Warping (DTW) is said to be an effective optimal solution for solving the existing challenges, especially the improved version of DTW named Time-Weighted Dynamic Time Warping (TWDTW) is used for time-series analysis regarding the time-series vegetation classification. Yet, the TWDTW efficiency is not shown with other comparative machine learning approaches owing to the classification of vegetation type in the mountain areas. The major goal of this paper is to research and create a novel approach for distinguishing the kind of vegetation in a farm region near Ujani Dam in Solapur District, Maharashtra using time-series analysis. For time-series analysis employing satellite images, the suggested model offers a unique Adaptive Time-Weighted Dynamic Time Warping (ATWDTW). The farm's satellite images are first pre-processed before being sent to ATWDTW for examination. The TWDTW idea is optimized for classification performance using a new hybrid metaheuristic technique named Adaptive Coyote Crow Search Optimization (ACCSO). From the experimental results, the performance of the suggested ACCSO-ATWDTW correspondingly provides superior performance to the traditional approaches, where the designed model using ACCSO-ATWDTW provides 7.2%, 5.2%, 9.9%, 4.55%, and 2.33% higher MCC than the MFO-ATWDTW, BSA-ATWDTW, MF-BSA-ATWDTW, CSA-ATWDTW, and COA-ATWDTW at the maximum iteration of 200. This proved the robustness and less sensitivity to training samples of the TWDTW method when applied to mountain vegetation-type classifications. [ABSTRACT FROM AUTHOR]

Infrared imagery is extensively used in defense, remote sensing and medical applications. While the infrared images have many advantages over RGB images, the details in these images are usually blurred which in turn leads to some difficulties for human operators. In this paper, a new method based on Laplacian of Gaussian scale-space and local variance is presented to improve the visual quality of the infrared images. At the first step, the Gaussian scale-space is constructed by convolving the original image with different Gaussian kernels. Then, the two-dimensional Laplacian kernels are convolved with the Gaussian scale-space to achieve details with both positive as well as negative contrasts. The weighted details are added to the original image to deblur the dim areas. At the final step, to increase the dynamic range of the image and have better visual quality, the local variance of the image is also added to the output of the previous step. Since finding optimum weighting coefficients is a difficult task empirically, here, we use a population-based meta-heuristic optimization algorithm called particle swarm optimization (PSO) to find the optimum values for weighting coefficient values. Beside qualitative comparison, Structural Similarity (SSIM) and second-derivative-like measure of enhancement (SDME) are used to quantitatively investigate the images quality. The proposed method outperforms the baseline algorithms in both qualitative and quantitative perspectives. [ABSTRACT FROM AUTHOR]

The deregulation of the electricity market has been accompanied by the growing utilization of unpredictable renewable energy sources (RESs) such as solar, wind, and hydropower plants. Additionally, advancements in energy storage technologies and new energy demands have further contributed to this trend. As a result, the planning and operation of power systems are now surrounded by a higher level of uncertainty. In order to ensure the proper operation of power systems integrated with RESs, modern power systems are equipped with specific vital tools such as optimal power flow (OPF), which regulates generation and demand to achieve specific objectives. Hence, this paper conducts a comprehensive review of recently published research articles focusing on various solution strategies to address OPF problems in the presence of stochastic RESs and power demand. The review encompasses diverse solution methodologies, objective functions, constraints, and distinct techniques to simulate the stochastic behavior of RESs and dynamic loads. Additionally, the paper explores fundamental challenges, identifies critical research gaps, and highlights unexplored areas pertaining to optimal power system operation in the future. This review is essential for system operators who need to assess and pre-plan flexibility competency for their power systems to ensure practical and cost-effective operation under high RESs penetration. [ABSTRACT FROM AUTHOR]

Generalized distributions have been studied a lot recently because of their flexibility and reliability in modeling lifetime data. The two-parameter Exponentially-Modified Logistic distribution is a flexible modified distribution that was introduced in 2018. It is regarded as a strong competitor for widely used classical symmetrical and non-symmetrical distributions such as normal, logistic, lognormal, log-logistic, and others. In this study, the unknown parameters of the Exponentially-Modified Logistic distribution are estimated using the maximum likelihood method. Five meta-heuristic algorithms, including the genetic algorithm, particle swarm optimization algorithm, grey wolf optimization algorithm, whale optimization algorithm, and sine cosine algorithm, are applied in order to solve the nonlinear likelihood equations of the study model. The efficiencies of all maximum likelihood estimates for these algorithms are compared via an extensive Monte Carlo simulation study. The performance of the maximum likelihood estimates for the location and scale parameters of the Exponentially-Modified Logistic distribution developed with the genetic algorithm and grey wolf optimization algorithms is the most efficient among others, according to simulation findings. However, the genetic algorithm is two times faster than grey wolf optimization and can be considered better than grey wolf optimization considering the computation time criterion. Six real datasets are analyzed to show the flexibility of this distribution. [ABSTRACT FROM AUTHOR]

BACKGROUND: The coronavirus disease 2019 is a serious and highly contagious disease caused by infection with a newly discovered virus, named severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2). OBJECTIVE: A Computer Aided Diagnosis (CAD) system to assist physicians to diagnose Covid-19 from chest Computed Tomography (CT) slices is modelled and experimented. METHODS: The lung tissues are segmented using Otsu's thresholding method. The Covid-19 lesions have been annotated as the Regions of Interest (ROIs), which is followed by texture and shape extraction. The obtained features are stored as feature vectors and split into 80:20 train and test sets. To choose the optimal features, Whale Optimization Algorithm (WOA) with Support Vector Machine (SVM) classifier's accuracy is employed. A Multi-Layer Perceptron (MLP) classifier is trained to perform classification with the selected features. RESULTS: Comparative experimentations of the proposed system with existing eight benchmark Machine Learning classifiers using real-time dataset demonstrates that the proposed system with 88.94% accuracy outperforms the benchmark classifier's results. Statistical analysis namely, Friedman test, Mann Whitney U test and Kendall's Rank Correlation Coefficient Test has been performed which indicates that the proposed method has a significant impact on the novel dataset considered. CONCLUSION: The MLP classifier's accuracy without feature selection yielded 80.40%, whereas with feature selection using WOA, it yielded 88.94%. [ABSTRACT FROM AUTHOR]

BACKGROUND: This study explores the dynamics of a mathematical model, utilizing ordinary differential equations (ODE), to depict the interplay between cancer cells and effector cells under chemotherapy. The stability of the equilibrium points in the model is analysed using the Jacobian matrix and eigenvalues. Additionally, bifurcation analysis is conducted to determine the optimal values for the control parameters. OBJECTIVE: To evaluate the performance of the model and control strategies, benchmarking simulations are performed using the PlatEMO platform. METHODS: The Pure Multi-objective Optimal Control Problem (PMOCP) and the Hybrid Multi-objective Optimal Control Problem (HMOCP) are two different forms of optimal control problems that are solved using revolutionary metaheuristic optimisation algorithms. The utilization of the Hypervolume (HV) performance indicator allows for the comparison of various metaheuristic optimization algorithms in their efficacy for solving the PMOCP and HMOCP. RESULTS: Results indicate that the MOPSO algorithm excels in solving the HMOCP, with M-MOPSO outperforming for PMOCP in HV analysis. CONCLUSION: Despite not directly addressing immediate clinical concerns, these findings indicates that the stability shifts at critical thresholds may impact treatment efficacy. [ABSTRACT FROM AUTHOR]

Metaheuristics are commonly employed as a means of solving many distinct kinds of optimization problems. Several natural-process-inspired metaheuristic optimizers have been introduced in the recent years. The convergence, computational burden and statistical relevance of metaheuristics should be studied and compared for their potential use in future algorithm design and implementation. In this paper, eight different variants of dragonfly algorithm, i.e. classical dragonfly algorithm (DA), hybrid memory-based dragonfly algorithm with differential evolution (DADE), quantum-behaved and Gaussian mutational dragonfly algorithm (QGDA), memory-based hybrid dragonfly algorithm (MHDA), chaotic dragonfly algorithm (CDA), biogeography-based Mexican hat wavelet dragonfly algorithm (BMDA), hybrid Nelder-Mead algorithm and dragonfly algorithm (INMDA), and hybridization of dragonfly algorithm and artificial bee colony (HDA) are applied to solve four industrial chemical process optimization problems. A fuzzy multi-criteria decision making tool in the form of fuzzy-measurement alternatives and ranking according to compromise solution (MARCOS) is adopted to ascertain the relative rankings of the DA variants with respect to computational time, Friedman's rank based on optimal solutions and convergence rate. Based on the comprehensive testing of the algorithms, it is revealed that DADE, QGDA and classical DA are the top three DA variants in solving the industrial chemical process optimization problems under consideration. [ABSTRACT FROM AUTHOR]

This paper is dedicated to optimizing the functionality of Microgrid-Integrated Charging Stations (MICCS) through the implementation of a new control strategy, specifically the fractional-order proportional-integral (FPI) controller, aided by a hybrid optimization algorithm. The primary goal is to elevate the efficiency and stability of the MICCS-integrated inverter, ensuring its seamless integration into modern energy ecosystems. The MICCS system considered here comprises a PV array as the primary electrical power source, complemented by a proton exchange membrane fuel cell as a supporting power resource. Additionally, it includes a battery system and an electric vehicle charging station. The optimization model is formulated with the objective of minimizing the integral of square errors in both the DC-link voltage and grid current while also reducing total harmonic distortion. To enhance the precision of control parameter estimation, a hybrid of the one-to-one optimizer and sine cosine algorithm (HOOBSCA) is introduced. This hybrid approach improves the exploitation and exploration characteristics of individual algorithms. Different meta-heuristic algorithms are tested against HOOBSCA in different case studies to see how well it tunes FPI settings. Findings demonstrate that the suggested method improves the integrated inverters' transient and steady-state performance, confirming its improved performance in generating high-quality solutions. The best fitness value achieved by the proposed optimizer was 3.9109, outperforming the other algorithms investigated in this paper. The HOOBSCA-based FPI successfully improved the response of the DC-link voltage, with a maximum overshooting not exceeding 8.5% compared to the other algorithms employed in this study. [ABSTRACT FROM AUTHOR]

The Artificial Electric Field Algorithm (AEFA) stands out as a physics-inspired metaheuristic, drawing inspiration from Coulomb's law and electrostatic force; however, while AEFA has demonstrated efficacy, it can face challenges such as convergence issues and suboptimal solutions, especially in high-dimensional problems. To overcome these challenges, this paper introduces a modified version of AEFA, named mAEFA, which leverages the capabilities of Lévy flights, simulated annealing, and the Adaptive s-best Mutation and Natural Survivor Method (NSM) mechanisms. While Lévy flights enhance exploration potential and simulated annealing improves search exploitation, the Adaptive s-best Mutation and Natural Survivor Method (NSM) mechanisms are employed to add more diversity. The integration of these mechanisms in AEFA aims to expand its search space, enhance exploration potential, avoid local optima, and achieve improved performance, robustness, and a more equitable equilibrium between local intensification and global diversification. In this study, a comprehensive assessment of mAEFA is carried out, employing a combination of quantitative and qualitative measures, on a diverse range of 29 intricate CEC'17 constraint benchmarks that exhibit different characteristics. The practical compatibility of the proposed mAEFA is evaluated on five engineering benchmark problems derived from the civil, mechanical, and industrial engineering domains. Results from the mAEFA algorithm are compared with those from seven recently introduced metaheuristic algorithms using widely adopted statistical metrics. The mAEFA algorithm outperforms the LCA algorithm in all 29 CEC'17 test functions with 100% superiority and shows better results than SAO, GOA, CHIO, PSO, GSA, and AEFA in 96.6%, 96.6%, 93.1%, 86.2%, 82.8%, and 58.6% of test cases, respectively. In three out of five engineering design problems, mAEFA outperforms all the compared algorithms, securing second place in the remaining two problems. Results across all optimization problems highlight the effectiveness and robustness of mAEFA compared to baseline metaheuristics. The suggested enhancements in AEFA have proven effective, establishing competitiveness in diverse optimization problems. [ABSTRACT FROM AUTHOR]

This paper introduces the Botox Optimization Algorithm (BOA), a novel metaheuristic inspired by the Botox operation mechanism. The algorithm is designed to address optimization problems, utilizing a human-based approach. Taking cues from Botox procedures, where defects are targeted and treated to enhance beauty, the BOA is formulated and mathematically modeled. Evaluation on the CEC 2017 test suite showcases the BOA's ability to balance exploration and exploitation, delivering competitive solutions. Comparative analysis against twelve well-known metaheuristic algorithms demonstrates the BOA's superior performance across various benchmark functions, with statistically significant advantages. Moreover, application to constrained optimization problems from the CEC 2011 test suite highlights the BOA's effectiveness in real-world optimization tasks. [ABSTRACT FROM AUTHOR]

In numerous scientific disciplines and practical applications, addressing optimization challenges is a common imperative. Nature-inspired optimization algorithms represent a highly valuable and pragmatic approach to tackling these complexities. This paper introduces Dendritic Growth Optimization (DGO), a novel algorithm inspired by natural branching patterns. DGO offers a novel solution for intricate optimization problems and demonstrates its efficiency in exploring diverse solution spaces. The algorithm has been extensively tested with a suite of machine learning algorithms, deep learning algorithms, and metaheuristic algorithms, and the results, both before and after optimization, unequivocally support the proposed algorithm's feasibility, effectiveness, and generalizability. Through empirical validation using established datasets like diabetes and breast cancer, the algorithm consistently enhances model performance across various domains. Beyond its working and experimental analysis, DGO's wide-ranging applications in machine learning, logistics, and engineering for solving real-world problems have been highlighted. The study also considers the challenges and practical implications of implementing DGO in multiple scenarios. As optimization remains crucial in research and industry, DGO emerges as a promising avenue for innovation and problem solving. [ABSTRACT FROM AUTHOR]

The research aims to improve the prediction of drug sensitivity on cancer cell lines using gene expression data and molecular fingerprints of drugs. The proposed study uses a deep learning model, BioMarkerX, trained on the Cancer Cell Line Encyclopedia (CCLE) and Genomics of Drug Sensitivity in Cancer (GDSC) datasets utilizing Particle Swarm Optimization technique to select specific genes as features. The model achieves high prediction accuracy with a Root Mean Square Error (RMSE) of 0.40 ± 0.02 and R2 of 0.83 ± 0.03 on the CCLE dataset, and an RMSE of 0.36 ± 0.05 and R2 of 0.83 ± 0.03 on the GDSC dataset. The approach also used an explainable artificial intelligence model to discover biological markers linked to cancer development. This can provide insights into targeted therapies for improving cancer treatment outcomes. Overall, the study presents an effective approach for identifying important biological markers relevant to cancer disease, aiding in the development of more efficient anticancer medications. [ABSTRACT FROM AUTHOR]

This study addresses the critical challenge of accurately classifying brain tumors using artificial intelligence. Early detection is crucial, as untreated tumors can be fatal. Despite advances in AI, accurately classifying tumors remains a challenging task. To address this challenge, we propose a novel optimization approach called PSCS combined with deep learning for brain tumor classification. PSCS optimizes the classification process by improving Particle Swarm Optimization (PSO) exploitation using Cuckoo search (CS) algorithm. Next, classified gene expression data of brain tumor using Deep Learning (DL) to identify different groups or classes related to a particular tumor along with the PSCS optimization technique. The proposed optimization technique with DL achieves much better classification accuracy than other existing DL and Machine learning models with the different evaluation matrices such as Recall, Precision, F1‐Score, and confusion matrix. This research contributes to AI‐driven brain tumor diagnosis and classification, offering a promising solution for improved patient outcomes. [ABSTRACT FROM AUTHOR]

Network on Chip (NoC) has emerged as a potential substitute for the communication model in modern computer systems with extensive integration. Among the numerous design challenges, application mapping on the NoC system poses one of the most complex and demanding optimization problems. In this research, we propose a hybrid improved whale optimization algorithm with enhanced genetic properties (IWOA-IGA) to optimally map real-time applications onto the 2D NoC Platform. The IWOA-IGA is a novel approach combining an improved whale optimization algorithm with the ability of a refined genetic algorithm to optimally map application tasks. A comprehensive comparison is performed between the proposed method and other state-of-the-art algorithms through rigorous analysis. The evaluation consists of real-time applications, benchmarks, and a collection of arbitrarily scaled and procedurally generated large-task graphs. The proposed IWOA-IGA indicates an average improvement in power reduction, improved energy consumption, and latency over state-of-the-art algorithms. Performance based on the Convergence Factor, which assesses the algorithm's efficiency in achieving better convergence after running for a specific number of iterations over other efficiently developed techniques, is introduced in this research work. These results demonstrate the algorithm's superior convergence performance when applied to real-world and synthetic task graphs. Our research findings spotlight the superior performance of hybrid improved whale optimization integrated with enhanced GA features, emphasizing its potential for application mapping in NoC-based systems. [ABSTRACT FROM AUTHOR]

Predicting carbon prices is crucial for the growth of China's carbon trading industry. This paper proposes a residual correction model that considers multiple influencing factors. First, the best historical data and main external factors input by the model are determined by using the partial autocorrelation function and Spearman correlation analysis, and the carbon price forecasting index system is constructed. Second, the whale optimization algorithm (WOA) is utilized to determine the optimal parameters of the extreme gradient boosting (XGBoost), and the WOA‐XGBoost model is built to perform preliminary carbon price forecasts and obtain the residual series. Finally, the carbon price residual series undergoes decomposition into multiple components utilizing the complete ensemble empirical mode decomposition for subsequent forecasting and the aggregation of outcomes. Experiments are conducted to predict two carbon trading markets in Hubei and Guangzhou, and a feature importance analysis is performed. The results indicate that the proposed hybrid model consistently outperforms the comparative models in terms of prediction accuracy. Furthermore, it is revealed that historical carbon prices and European Union carbon prices are the key factors influencing the prediction of carbon market prices. [ABSTRACT FROM AUTHOR]