Search

Antennas play a crucial role in designing an efficient communication system. However, reducing the maximum sidelobe level (SLL) of the beam pattern is a crucial challenge in antenna arrays. Pattern synthesis in smart antennas is a major area of research because of its widespread application across various radar and communication systems. This paper presents an effective technique to minimize the SLL and thus improve the radiation pattern of the linear antenna array (LAA) using the chaotic inertia-weighted Wild Horse optimization (IERWHO) algorithm. The wild horse optimizer (WHO) is a new metaheuristic algorithm based on the social behavior of wild horses. The IERWHO algorithm is an improved Wild Horse optimization (WHO) algorithm that combines the concepts of chaotic sequence factor, nonlinear factor, and inertia weights factor. In this paper, the method is applied for the first time in antenna array synthesis by optimizing parameters such as inter-element spacing and excitation to minimize the SLL while keeping other constraints within the boundary limits, while ensuring that the performance is not affected. For performance evaluation, the simulation tests include 12 benchmark test functions and 12 test functions to verify the effectiveness of the improvement strategies. According to the encouraging research results in this paper, the IERWHO algorithm proposed has a place in the field of optimization. [ABSTRACT FROM AUTHOR]

The software-defined network paradigm, ensembled with a wireless sensor network, has emerged as a promising phenomenon to enable multi-tasking, re-configuration, and scalability. Termed the software-defined wireless sensor network (SDWSN), it divides the network into two planes: data and control. The data plane consists of software-defined sensor nodes (SDSN) that sense monitoring activity and generate data. On the other hand, the control plane has controller/control Nodes (CN) which collect data from SDSN, perform data aggregation, and then transmit toward the sink node. These CNs consume more amount of energy as compared to SDSNs as they perform multiple tasks. Following this scenario, this paper proposes an energy-efficient multi-objective optimization approach to solve the CNs placement problem through a meta-heuristic algorithm by considering the nodes' location, energy, and load distribution. This paper presents a particle swarm optimization-based controller placement and re-placement (PSO-CPR) algorithm for SDWSN. The PSO-CPR elects SDSNs to become CN based on their distance, residual energy, and capacity in the network. Moreover, the placement of a CN rotates within the cluster to avoid its failure and balance energy consumption. The simulation results show improved CN placement with respect to the state-of-the-art algorithms in terms of average delay by 23.5–37.4%, energy consumption by 18.6–32.6%, and probabilistic load distribution by 17.7–54.1%. Moreover, the comparative study also indicates that PSO-CPR achieve promising result by reducing packet loss by 14.4–27.5% and network re-clustering period by 32.3–68.3% and enhance the network lifetime by 22.6–42.5%. [ABSTRACT FROM AUTHOR]

Feature selection (FS) is a crucial preprocessing step that aims to eliminate irrelevant and redundant features, reduce the dimensionality of the feature space, and enhance clustering efficiency and effectiveness. FS is categorized as NP-Hard due to the high number of existing solutions. Various metaheuristic methods have been developed to address the FS problem, yielding promising results. Particularly, particle swarm optimization (PSO), an evolutionary computing (EC) approach guided by swarm intelligence, has gained widespread adoption owing to its implementation simplicity and potential for global search. This paper analyzes several variants of PSO algorithms and introduces a new FS method called HPSO. The proposed approach utilizes an asynchronously adaptive inertia weight and an improved constriction factor. Additionally, it incorporates a chaotic map and a MAD fitness function with a feature count penalty to tackle the clustering FS problem. The efficiency of the developed method is evaluated against the genetic algorithm (GA) and well-known variants of PSO algorithms, including PSOs with fixed inertia weights, PSOs with improved inertia weights, PSOs with fixed constriction factors, PSOs with improved constriction factors, PSOs with adaptive inertia weights, and PSO's includes advanced learning exemplars and sophisticated structure topologies. This paper assesses two different reference text data sets, Reuters-21578 and Webkb. In comparison with competitive methods, the proposed HPSO method achieves higher clustering precision and selects a more informative feature set. [ABSTRACT FROM AUTHOR]

The sand cat swarm optimization algorithm (SCSO) is a novel metaheuristic algorithm that has been proposed in recent years. The algorithm optimizes the search ability of individuals by mimicking the hunting behavior of sand cat groups in nature, thereby achieving robust optimization performance. It is characterized by few control parameters and simple operation. However, due to the lack of population diversity, SCSO is less efficient in solving complex problems and is prone to fall into local optimization. To address these shortcomings and refine the algorithm's efficacy, an improved multi-strategy sand cat optimization algorithm (IMSCSO) is proposed in this paper. In IMSCSO, a roulette fitness–distance balancing strategy is used to select codes to replace random agents in the exploration phase and enhance the convergence performance of the algorithm. To bolster population diversity, a novel population perturbation strategy is introduced, aiming to facilitate the algorithm's escape from local optima. Finally, a best–worst perturbation strategy is developed. The approach not only maintains diversity throughout the optimization process but also enhances the algorithm's exploitation capabilities. To evaluate the performance of the proposed IMSCSO, we conducted experiments in the CEC 2017 test suite and compared IMSCSO with seven other algorithms. The results show that the IMSCSO proposed in this paper has better optimization performance. [ABSTRACT FROM AUTHOR]

The emergence of microgrids arises from the growing integration of Renewable Energy Resources (RES) and Energy Storage Systems (ESSs) into Distribution Networks (DNs). Effective integration, coordination, and control of Multiple Microgrids (MMGs) whereas navigating the complexities of energy transition within this context poses a significant challenge. The dynamic operation of MMGs is a challenge faced by the traditional distributed hierarchical control techniques. The application of Artificial Intelligence (AI) techniques is a promising way to improve the control and dynamic operation of MMGs in future smart DNs. In this paper, an innovative hybrid optimization technique that originates from Cheetah Optimization (CHO) and Particle Swarm Optimization (PSO) techniques is proposed, known as HYCHOPSO. Extensive benchmark testing validates HYCHOPSO's superiority over CHO and PSO in terms of convergence performance. The objective for this hybridization stems from the complementary strengths of CHO and PSO. CHO demonstrates rapid convergence in local search spaces, while PSO excels in global exploration. By combining these techniques, the aim is to leverage their respective advantages and enhance the algorithm's overall performance in addressing complex optimization problems. The contribution of this paper offering a unique approach to addressing optimization challenges in microgrid systems. Through a comprehensive comparative study, HYCHOPSO is evaluated against various metaheuristic optimization approaches, demonstrating superior performance, particularly in optimizing the design parameters of Proportional-Integral (PI) controllers for hierarchical control systems within microgrids. This contribution expands the repertoire of available optimization methodologies and offers practical solutions to critical challenges in microgrid optimization, enhancing the efficiency, reliability, and sustainability of microgrid operations. HYCHOPSO achieves its optimal score within fewer than 50 iterations, unlike CHO, GWO, PSO, Hybrid-GWO-PSO, and SSIA-PSO, which stabilize after around 200 iterations. Across various benchmark functions, HYCHOPSO consistently demonstrates the lowest mean values, attains scores closer to the optimal values of the benchmark functions, underscoring its robust convergence capabilities.the proposed HYCHOPSO algorithm, paired with a PI controller for distributed hierarchical control, minimizes errors and enhances system reliability during dynamic MMG operations. Using HYCHOPSO framework, an accurate power sharing, voltage/frequency stability, seamless grid-to-island transition, and smooth resynchronization are achieved. This enhances the real application's reliability, flexibility, scalability and robustness. [ABSTRACT FROM AUTHOR]

The popularity of the average current mode (ACM) controlled boost type power factor correction (PFC) topologies is increasing due to their suitability for power quality problems. Proportional-Integral (PI) controller method is generally used in ACM controlled boost PFC circuits which include two controllers. However, the most important complexity of ACM controlled PFC circuits is tuning the coefficients of the PI controllers optimally. Therefore, this paper proposes the optimal tuning of PI coefficients used in ACM controlled boost PFC circuits using different meta-heuristics algorithms. First, the proposed ACM controller-based boost PFC topology is analyzed in MATLAB/Simulink software by using variable loads. Then the simulation results of the Cuckoo Optimization Algorithm (COA) based ACM controlled boost PFC converter are compared with the results determined via Ziegler-Nichols (ZN), Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Imperialistic Competitive Algorithm (ICA), and Invasive Weed Optimization (IWO). Finally, the experimental verification of the topology has been done using a 600 W prototype and eZdsp F28335. As COA showed better results among other evolutionary algorithms used in this paper, we used COA parameters to observe the performance of the proposed tuning method. The experimental studies have been done under different load variations similar to the simulation studies. [ABSTRACT FROM AUTHOR]

This paper addresses optimization problems subject to an objective function's evaluation‐number constraint arbitrarily given in advance. These problems are practical for black‐box objective functions which cost much money and/or time per evaluation because money and/or time constraints are typically applicable in real‐world projects. This paper suggests a new solution strategy that can be used to adapt metaheuristics to evaluation‐number constraints arbitrarily given in advance. The proposed strategy updates the setting parameters of a target metaheuristic algorithm for every generation by solving a fixed small‐size optimization problem related to the evaluation‐number constraint. It has the advantage of being insensitive to the effects of dimensionality increases in principle. The effectiveness of the proposed strategy is confirmed by numerical experiments with two well‐known metaheuristics, i.e., the particle swarm optimization algorithm and the differential evolution algorithm. © 2024 Institute of Electrical Engineer of Japan and Wiley Periodicals LLC. [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]

The prospect of the energy transition is exciting and sure to benefit multiple aspects of daily life. However, various challenges, such as planning, business models, and energy access are still being tackled. Energy Communities have been gaining traction in the energy transition, as they promote increased integration of Renewable Energy Sources (RESs) and more active participation from the consumers. However, optimization becomes crucial to support decision making and the quality of service for the effective functioning of Energy Communities. Optimization in the context of Energy Communities has been explored in the literature, with increasing attention to metaheuristic approaches. This paper contributes to the ongoing body of work by presenting the results of a benchmark between three classical metaheuristic methods—Differential Evolution (DE), the Genetic Algorithm (GA), and Particle Swarm Optimization (PSO)—and three more recent approaches—the Mountain Gazelle Optimizer (MGO), the Dandelion Optimizer (DO), and the Hybrid Adaptive Differential Evolution with Decay Function (HyDE-DF). Our results show that newer methods, especially the Dandelion Optimizer (DO) and the Hybrid Adaptive Differential Evolution with Decay Function (HyDE-DF), tend to be more competitive in terms of minimizing the objective function. In particular, the Hybrid Adaptive Differential Evolution with Decay Function (HyDE-DF) demonstrated the capacity to obtain extremely competitive results, being on average 3% better than the second-best method while boasting between around 2× and 10× the speed of other methods. These insights become highly valuable in time-sensitive areas, where obtaining results in a shorter amount of time is crucial for maintaining system operational capabilities. [ABSTRACT FROM AUTHOR]

The growth optimizer (GO) is a novel metaheuristic algorithm designed to tackle complex optimization problems. Despite its advantages of simplicity and high efficiency, GO often encounters localized stagnation when dealing with discretized, high-dimensional, and multi-constraint problems. To address these issues, this paper proposes an enhanced version of GO called CODGBGO. This algorithm incorporates three strategies to enhance its performance. Firstly, the Circle-OBL initialization strategy is employed to enhance the quality of the initial population. Secondly, an exploration strategy is implemented to improve population diversity and the algorithm's ability to escape local optimum traps. Finally, the exploitation strategy is utilized to enhance the convergence speed and accuracy of the algorithm. To validate the performance of CODGBGO, it is applied to solve the CEC2017, CEC2020, 18 feature selection problems, and 4 real engineering optimization problems. The experiments demonstrate that the novel CODGBGO algorithm effectively addresses the challenges posed by complex optimization problems, offering a promising approach. [ABSTRACT FROM AUTHOR]

For large-scale constructed wind farms, reducing wake loss and improving the overall output power are the main objectives for their optimal operation. Therefore, a wind farm power maximization method based on a multi-strategy improved sparrow search algorithm (MS-ISSA) is proposed in this paper. Integrating the wake propagation mechanism of wind turbines and the characteristics of the classic Jensen wake model, the Jensen-Gaussian wake model and wake superposition model were constructed to accurately calculate the wind farm wake distribution. The constructed Jensen-Gaussian wake model and wake superposition model can accurately describe the non-uniform distribution characteristics of wake velocity. The Sin chaotic model, Cauchy distribution, and hyperparameter adaptive adjustment strategy were used to improve the sparrow search algorithm (SSA), and the optimization ability, convergence speed, and stability of the SSA were improved. Accordingly, considering the maximum output power of the wind farm as the optimization target and axial induction factor as the optimization variable, a coordinated optimization model for wind turbines based on MS-ISSA was proposed to realize the coordinated optimal operation of wind turbines with reduced wake loss. Considering the Danish Horns Rev wind farm as the research object, the results of optimization using particle swarm optimization algorithm, whale optimization algorithm, basic sparrow search algorithm, and MS-ISSA were calculated and analyzed. The calculation results revealed that under different incoming wind conditions, the MS-ISSA exhibited better optimization results than the other optimization algorithms. [ABSTRACT FROM AUTHOR]

The gazelle optimization algorithm (GOA) is an iterative optimization method inspired by the agile movements of gazelles, employing adaptive step sizes and velocity adjustments for rapid convergence in continuous search spaces. However, GOA tends to lack diversity, leading to issues like local minima trapping and premature convergence. This paper addresses these limitations by introducing dynamic opposition-based learning (OBL) and incorporating a balanced sine-control-logistic chaotic mapping system, resulting in the improved GOA (IGOA). Dynamic OBL accelerates the search process, improving learning and selecting superior candidate solutions, while chaotic mapping in chaotic local search widens ranges for exploration and local optima escape. Evaluating IGOA against seven algorithms, including GOA and others, across 31 general test functions, the results consistently showcase IGOA's superior efficiency in achieving solutions closest to optima, early convergence, and hit rate when compared to alternative algorithms. [ABSTRACT FROM AUTHOR]

The Snake Optimizer (SO) is an advanced metaheuristic algorithm for solving complicated real-world optimization problems. However, despite its advantages, the SO faces certain challenges, such as susceptibility to local optima and suboptimal convergence performance in cases involving discretized, high-dimensional, and multi-constraint problems. To address these problems, this paper presents an improved version of the SO, known as the Snake Optimizer using Sobol sequential nonlinear factors and different learning strategies (SNDSO). Firstly, using Sobol sequences to generate better distributed initial populations helps to locate the global optimum solution faster. Secondly, the use of nonlinear factors based on the inverse tangent function to control the exploration and exploitation phases effectively improves the exploitation capability of the algorithm. Finally, introducing learning strategies improves the population diversity and reduces the probability of the algorithm falling into the local optimum trap. The effectiveness of the proposed SNDSO in solving discretized, high-dimensional, and multi-constraint problems is validated through a series of experiments. The performance of the SNDSO in tackling high-dimensional numerical optimization problems is first confirmed by using the Congress on Evolutionary Computation (CEC) 2015 and CEC2017 test sets. Then, twelve feature selection problems are used to evaluate the effectiveness of the SNDSO in discretized scenarios. Finally, five real-world technical multi-constraint optimization problems are employed to evaluate the performance of the SNDSO in high-dimensional and multi-constraint domains. The experiments show that the SNDSO effectively overcomes the challenges of discretization, high dimensionality, and multi-constraint problems and outperforms superior algorithms. [ABSTRACT FROM AUTHOR]

Studies indicate cardiac arrhythmia is one of the leading causes of death in the world. The risk of a stroke may be reduced when an irregular and fast heart rate is diagnosed. Since it is non-invasive, electrocardiograms are often used to detect arrhythmias. Human data input may be error-prone and time-consuming because of these limitations. For early detection of heart rhythm problems, it is best to use deep learning models. In this paper, a hybrid bio-inspired algorithm has been proposed by combining whale optimization (WOA) with adaptive particle swarm optimization (APSO). The WOA is a recently developed meta-heuristic algorithm. APSO is used to increase convergence speed. When compared to conventional optimization methods, the two techniques work better together. MIT-BIH dataset has been utilized for training, testing and validating this model. The recall, accuracy, and specificity are used to measure efficiency of the proposed method. The efficiency of the proposed method is compared with state-of-art methods and produced 98.25 % of accuracy. [ABSTRACT FROM AUTHOR]

Taking a lot of time to solve optimization problems has become a challenge for metaheuristic algorithms. Due to independence of the metaheuristics components, parallel processing is a good option to reduce the computational time and to find high quality solutions that are close to the optimum with an acceptable cost. One of these metaheuristic algorithms is the Sailfish Optimizer (SFO) which is inspired by a group of hunting sailfish. The SFO algorithm uses a simple method to provide a dynamic balance between exploration and exploitation phases, creates a swarm diversity, avoids local optima, and guarantees high convergence speed. It has been shown that the SFO algorithm outperforms various state-of-art metaheuristic algorithms for multimodal and high dimensional benchmark functions and complicated real-world optimization problems in terms of accuracy and speed by CPU and GPU implementation. In this paper, to speedup this algorithm and increase its performance we propose a reconfigurable hardware version of SFO implemented on Field Programmable Gate Array (FPGA). The FPGA-based SFO can be a very good option in many applications with massive calculations. Due to the inherent parallelism and high computing capabilities of FPGA, the SFO algorithm gains optimum computational time despite the complexity of optimization problems. We have compared the performance of the proposed FPGA-based SFO with its CPU and GPU implementation and some other metaheuristic algorithms. The results show the FPGA implementation is considerably faster than the CPU and GPU implementation. Also, it outperforms other compared FPGA-based metaheuristic algorithms in terms of execution time and convergence speed. [ABSTRACT FROM AUTHOR]

The dung beetle optimization (DBO) algorithm, a swarm intelligence-based metaheuristic, is renowned for its robust optimization capability and fast convergence speed. However, it also suffers from low population diversity, susceptibility to local optima solutions, and unsatisfactory convergence speed when facing complex optimization problems. In response, this paper proposes the multi-strategy improved dung beetle optimization algorithm (MDBO). The core improvements include using Latin hypercube sampling for better population initialization and the introduction of a novel differential variation strategy, termed "Mean Differential Variation", to enhance the algorithm's ability to evade local optima. Moreover, a strategy combining lens imaging reverse learning and dimension-by-dimension optimization was proposed and applied to the current optimal solution. Through comprehensive performance testing on standard benchmark functions from CEC2017 and CEC2020, MDBO demonstrates superior performance in terms of optimization accuracy, stability, and convergence speed compared with other classical metaheuristic optimization algorithms. Additionally, the efficacy of MDBO in addressing complex real-world engineering problems is validated through three representative engineering application scenarios namely extension/compression spring design problems, reducer design problems, and welded beam design problems. [ABSTRACT FROM AUTHOR]

Arithmetic optimization algorithm (AOA) is a meta-heuristic optimization method based on mathematical operators proposed in recent years. Although it has good performance, it can also lead to insufficient local search ability and falling into local optima when solving complex optimization problems. In order to make up for the above shortcomings, the optimization performance of AOA is further improved. This paper proposes a hybrid algorithm based on AOA and particle swarm optimization (PSO) called HAOAPSO. Firstly, a compound opposition-based learning (COBL) strategy is introduced to broaden the scope of finding optimal solutions to help the algorithm better jump out of local optima. Secondly, PSO is combined with AOA that integrates COBL to improve the algorithm's local search ability, so as to improve the overall search efficiency of the algorithm. In addition, experiments are performed on 23 classical benchmark functions with different characteristics and five engineering design optimization problems, and the experimental results of HAOAPSO are compared with those of other well-known optimization algorithms to comprehensively evaluate the performance of the proposed algorithm. The simulation results show that HAOAPSO can provide better solutions in most cases when solving global optimization problems such as engineering, with better convergence speed and accuracy. [ABSTRACT FROM AUTHOR]

This paper presents an improved arithmetic optimization algorithm that incorporates hybrid elite pool strategies to address the limitations of the arithmetic optimization algorithm (AOA). In AOA, the linear mathematical optimization acceleration (MOA) function cannot balance global exploitation and local exploration well. Therefore, the accuracy and convergence speed of the algorithm cannot be guaranteed. To improve the performance of AOA, this paper reconstructed a nonlinear MOA function, which is expected to balance the exploitation and the exploration of AOA. Furthermore, four hybrid elite pool strategies are integrated to enhance the ability to escape local optima. The proposed algorithm inherits the fast convergence of AOA and develops the performance of escaping local optima. Numerical experiment results on benchmark functions and engineering problems show that the proposed algorithm outperforms other compared meta-heuristic algorithms in terms of convergence speed and accuracy. [ABSTRACT FROM AUTHOR]

The techniques for solving complex optimization problems using nature inspired metaheuristic algorithms are widely accepted. Nature inspired methods use nature derived approaches to offer an efficient solution within polynomial time. This paper presents analytics of some of the significant nature inspired metaheuristic algorithms. It elaborates on the principles and concepts that are used in these algorithms representing their similarities, variations, and exceptions. The taxonomical classification and analytics presented in this paper list the nature derived phenomenon used to develop a wide variety of nature-inspired techniques. The algorithms are classified as per the type of agents used, search techniques, sub-optimization methods, type of constraints, and nature of problems. The survey comprehends the use of control parameters like exploration and convergence applicable to these algorithms and their domain specifications. The sources of nature inspiration are also presented with their variants. It establishes the analytics required to choose a specific nature-inspired heuristic algorithm for smart farming and related applications. Metaheuristic algorithms like Particle Swarm optimization, Ant colony optimization, Whale optimization, Firefly optimization, etc. have contributed significantly in assisting smart farming methods for better productivity of crops. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) is constantly evolving. The variety of IoT applications has caused new demands to emerge on users' part and competition between computing service providers. On the one hand, an IoT application may exhibit several important criteria, such as deadline and runtime simultaneously, and it is confronted with resource limitations and high energy consumption on the other hand. This has turned to adopting a computing environment and scheduling as a fundamental challenge. To resolve the issue, IoT applications are considered in this paper as a workflow composed of a series of interdependent tasks. The tasks in the same workflow (at the same level) are subject to priorities and deadlines for execution, making the problem far more complex and closer to the real world. In this paper, a hybrid Particle Swarm Optimization and Simulated Annealing algorithm (PSO–SA) is used for prioritizing tasks and improving fitness function. Our proposed method managed the task allocation and optimized energy consumption and makespan at the fog-cloud environment nodes. The simulation results indicated that the PSO–SA enhanced energy and makespan by 5% and 9% respectively on average compared with the baseline algorithm (IKH-EFT). [ABSTRACT FROM AUTHOR]

Conventionally, researchers have favored the model-based control scheme for controlling gantry crane systems. However, this method necessitates a substantial investment of time and resources in order to develop an accurate mathematical model of the complex crane system. Recognizing this challenge, the current paper introduces a novel data-driven control scheme that relies exclusively on input and output data. Undertaking a couple of modifications to the conventional marine predators algorithm (MPA), random average marine predators algorithm (RAMPA) with tunable adaptive coefficient to control the step size (CF) has been proposed in this paper as an enhanced alternative towards fine-tuning data-driven multiple-node hormone regulation neuroendocrine-PID (MnHR-NEPID) controller parameters for the multi-input–multi-output (MIMO) gantry crane system. First modification involved a random average location calculation within the algorithm's updating mechanism to solve the local optima issue. The second modification then introduced tunable CF that enhanced search capacity by enabling users' resilience towards attaining an offsetting level of exploration and exploitation phases. Effectiveness of the proposed method is evaluated based on the convergence curve and statistical analysis of the fitness function, the total norms of error and input, Wilcoxon's rank test, time response analysis, and robustness analysis under the influence of external disturbance. Comparative findings alongside other existing metaheuristic-based algorithms confirmed excellence of the proposed method through its superior performance against the conventional MPA, particle swarm optimization (PSO), grey wolf optimizer (GWO), moth-flame optimization (MFO), multi-verse optimizer (MVO), sine-cosine algorithm (SCA), salp-swarm algorithm (SSA), slime mould algorithm (SMA), flow direction algorithm (FDA), and the formally published adaptive safe experimentation dynamics (ASED)-based methods. [ABSTRACT FROM AUTHOR]

In this paper, we have proposed a hybrid bio-inspired algorithm which takes the merits of whale optimization algorithm (WOA) and adaptive particle swarm optimization (APSO). The proposed algorithm is referred as the hybrid WOA_APSO algorithm. We utilize a convolutional neural network (CNN) for classification purposes. Extensive experiments are performed to evaluate the performance of the proposed model. Here, pre-processing and segmentation are performed on 120 lung CT images for obtaining the segmented tumored and non-tumored region nodule. The statistical, texture, geometrical and structural features are extracted from the processed image using different techniques. The optimized feature selection plays a crucial role in determining the accuracy of the classification algorithm. The novel variant of whale optimization algorithm and adaptive particle swarm optimization, hybrid bio-inspired WOA_APSO, is proposed for selecting optimized features. The feature selection grouping is applied by embedding linear discriminant analysis which helps in determining the reduced dimensions of subsets. Twofold performance comparisons are done. First, we compare the performance against the different classification techniques such as support vector machine, artificial neural network (ANN) and CNN. Second, the computational cost of the hybrid WOA_APSO is compared with the standard WOA and APSO algorithms. The experimental result reveals that the proposed algorithm is capable of automatic lung tumor detection and it outperforms the other state-of-the-art methods on standard quality measures such as accuracy (97.18%), sensitivity (97%) and specificity (98.66%). The results reported in this paper are encouraging; hence, these results will motivate other researchers to explore more in this direction. [ABSTRACT FROM AUTHOR]

More and more distributed energy resources (DERs) are being added to the mediumvoltage (MV) or low-voltage (LV) radial distribution networks (RDNs). These distributed power sources will cause the redistribution of power flow and fault current, bringing new challenges to the coordination of power system protection. An adaptive protection coordination strategy is proposed in this paper. It will trace the connectivity of the system structure to determine the set of relay numbers as a tracking path. According to the topology of the system structure, the tracking path can be divided into two categories: the main feeder path and the branch path. The time multiplier setting (TMS) of each relay can be used to evaluate the operation time of the over-current relay (OCR), and the operation time of the relay can be used to evaluate the fitness of the TMS setting combination. Furthermore, the relay protection coordination problem can be modeled to minimize the accumulated summation of all primary and backup relay operation time (OT) subject to the coordination time interval (CTI) limitation. A modified particle swarm optimization (MPSO) algorithm with adaptive self-cognition and society operation scheme (ASSOS) was proposed and utilized to determine TMS for each relay on the tracking path. A 16-bus test MV system with distributed generators (DGs) will be applied to test the adaptive protection coordination approach proposed in this paper. The results show that the proposed MPSO algorithm reduces the overall OT and relieves the impact on protection coordination settings after DG joins the system. The paper also tests and compares the proposed MPSO with other metaheuristic intelligence-based random search algorithms to prove that MPSO possesses with increased efficiency and performance. [ABSTRACT FROM AUTHOR]

Photovoltaic panels (PVs) are solar panels that turn sunlight into electricity. Tracking the maximum power point (MPP) of PVs is especially important for economic issues. The most popular maximum power point tracking techniques are perturb and observation, hill climbing, constant voltage, parasitic capacitance, and incremental conductance (INC). However, these techniques give oscillated results about the MPP that causes low accuracy, especially in partial shading conditions. This paper is discussing the enhancement of photovoltaic energy system performance using several metaheuristic optimization algorithms. Using MATLAB SIMULINK, a comparative analysis of several algorithms for tracking MPP of PV systems under partially shadowed conditions was conducted. The metaheuristic optimization algorithms that are used in this paper are particle swarm optimization (PSO), cuckoo search algorithm (CSA), grey wolf optimization (GWO), and whale optimization algorithm (WOA). The results show that using WOA and GWO achieved the best efficiency in tracking MPP, whereas, using PSO and CSA achieved lower efficiency in tracking MPP. The MPP of the PV system was not tracked by INC under the partial shaded conditions. [ABSTRACT FROM AUTHOR]

A multi-modal search space can be defined as having multiple attraction basins - each basin has a single local optimum which is reached from all points in that basin when greedy local search is used. Optimization in multi-modal search spaces can then be viewed as a two-phase process. The first phase is exploration in which the most promising attraction basin is identified. The second phase is exploitation in which the best solution (i.e. the local optimum) within the previously identified attraction basin is attained. The goal of thresheld convergence is to improve the performance of search techniques during the first phase of exploration. The effectiveness of thresheld convergence has been demonstrated through applications to existing metaheuristics such as particle swarm optimization and differential evolution, and through the development of novel metaheuristics such as minimum population search and leaders and followers. [ABSTRACT FROM AUTHOR]

To overcome the disadvantages of premature convergence and easy trapping into local optimum solutions, this paper proposes an improved particle swarm optimization algorithm (named NDWPSO algorithm) based on multiple hybrid strategies. Firstly, the elite opposition-based learning method is utilized to initialize the particle position matrix. Secondly, the dynamic inertial weight parameters are given to improve the global search speed in the early iterative phase. Thirdly, a new local optimal jump-out strategy is proposed to overcome the "premature" problem. Finally, the algorithm applies the spiral shrinkage search strategy from the whale optimization algorithm (WOA) and the Differential Evolution (DE) mutation strategy in the later iteration to accelerate the convergence speed. The NDWPSO is further compared with other 8 well-known nature-inspired algorithms (3 PSO variants and 5 other intelligent algorithms) on 23 benchmark test functions and three practical engineering problems. Simulation results prove that the NDWPSO algorithm obtains better results for all 49 sets of data than the other 3 PSO variants. Compared with 5 other intelligent algorithms, the NDWPSO obtains 69.2%, 84.6%, and 84.6% of the best results for the benchmark function ( f 1 - f 13 ) with 3 kinds of dimensional spaces (Dim = 30,50,100) and 80% of the best optimal solutions for 10 fixed-multimodal benchmark functions. Also, the best design solutions are obtained by NDWPSO for all 3 classical practical engineering problems. [ABSTRACT FROM AUTHOR]

In this research paper, the intelligent learning abilities of the gray wolf optimization (GWO), multi-verse optimization (MVO), moth fly optimization, particle swarm optimization (PSO), and whale optimization algorithm (WOA) metaheuristic techniques and the response surface methodology (RSM) has been studied in the prediction of the mechanical properties of self-healing concrete. Bio-concrete technology stimulated by the concentration of bacteria has been utilized as a sustainable structural concrete for the future of the built environment. This is due to the recovery tendency of the concrete structures after noticeable structural failures. However, it requires a somewhat expensive exercise and technology to create the medium for the growth of the bacteria needed for this self-healing ability. The method of data gathering, analysis and intelligent prediction has been adopted to propose parametric relationships between the bacteria usage and the concrete performance in terms of strength and durability. This makes is cheaper to design self-healing concrete structures based on the optimized mathematical relationships and models proposed from this exercise. The performance of the models was tested by using the coefficient of determination (R2), root mean squared errors, mean absolute errors, mean squared errors, variance accounted for and the coefficient of error. At the end of the prediction protocol and model performance evaluation, it was found that the classified metaheuristic techniques outclassed the RSM due their ability to mimic human and animal genetics of mutation. Furthermore, it can be finally remarked that the GWO outclassed the other methods in predicting the concrete slump (Sl) with R2 of 0.998 and 0.989 for the train and test, respectively, the PSO outclassed the rest in predicting the flexural strength with R2 of 0.989 and 0.937 for train and test, respectively and the MVO outclassed the others in predicting the compressive strength with R2 of 0.998 and 0.958 for train and test, respectively. [ABSTRACT FROM AUTHOR]

To overcome the disadvantages of premature convergence and easy trapping into local optimum solutions, this paper proposes an improved particle swarm optimization algorithm (named NDWPSO algorithm) based on multiple hybrid strategies. Firstly, the elite opposition-based learning method is utilized to initialize the particle position matrix. Secondly, the dynamic inertial weight parameters are given to improve the global search speed in the early iterative phase. Thirdly, a new local optimal jump-out strategy is proposed to overcome the "premature" problem. Finally, the algorithm applies the spiral shrinkage search strategy from the whale optimization algorithm (WOA) and the Differential Evolution (DE) mutation strategy in the later iteration to accelerate the convergence speed. The NDWPSO is further compared with other 8 well-known nature-inspired algorithms (3 PSO variants and 5 other intelligent algorithms) on 23 benchmark test functions and three practical engineering problems. Simulation results prove that the NDWPSO algorithm obtains better results for all 49 sets of data than the other 3 PSO variants. Compared with 5 other intelligent algorithms, the NDWPSO obtains 69.2%, 84.6%, and 84.6% of the best results for the benchmark function ( f 1 - f 13 ) with 3 kinds of dimensional spaces (Dim = 30,50,100) and 80% of the best optimal solutions for 10 fixed-multimodal benchmark functions. Also, the best design solutions are obtained by NDWPSO for all 3 classical practical engineering problems. [ABSTRACT FROM AUTHOR]

In this paper, an improved constant current step based on the grey wolf optimization (CCS-GWO) algorithm for photovoltaic systems is investigated. The development of grey wolf optimization has been widely spread over photovoltaic applications. This method is one of the metaheuristic swarm optimization algorithm groups inspired by an optimum means of chasing prey by grey wolves. The proposed technique applies constant current steps to the pack of wolves (alpha, beta, and omega) by monitoring the average of the internal current step and external current step in order to target the leader alpha wolf position. Moreover, the proposed technique solves the convergence process issues, low convergence speed, and premature local optima problems of the traditional GWO algorithm. This CCS-GWO algorithm accurately tracks the maximum power point from the photovoltaic systems for load charging in different partial shading conditions (PSCs). A number of standard benchmark functions are presented with low average cost functions and their corresponding standard deviation values. The simulation results revealed that the proposed CCS-GWO approach outperforms the existing GWO and GA algorithms in terms of efficiency (98.55%) and tracking time (0.3 s). [ABSTRACT FROM AUTHOR]

In recent years, there is massive development of new metaheuristics as stochastic methods. Meanwhile, there is not any metaheuristics is powerful to handle all problems as stated in the no-free-lunch (NFL) theory. Based on this circumstance, this paper introduces a new swarm-based metaheuristics with the main strategy moving toward the resultant of better swarm members and avoiding the resultant of worse swarm members called group better-worse algorithm (GBWA). It consists of five searches: moving toward the best swarm member, moving toward the resultant of better swarm members, moving away from the resultant of worse swarm members, searching locally, and jumping to the opposite area. GBWA is then evaluated in three ways. The first evaluation is a comparative evaluation where GBWA is compared to five recent metaheuristics: coati optimization algorithm (COA), average and subtraction-based optimization (ASBO), clouded leopard optimization (CLO), total interaction algorithm (TIA), and osprey optimization algorithm (OOA). The second evaluation is the individual search evaluation. The third evaluation is hyperparameter test. The collection of 23 classic functions is chosen as the use case in all evaluations. The result of the first evaluation shows that GBWA is better than COA, ASBO, CLO, TIA, and OOA in 20, 21, 20, 21, and 21 functions consecutively. Meanwhile, the result of the second evaluation shows the equal contribution between the motion toward the best swarm member and the motion toward the resultant of better swarm members. [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]

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]

Document classification is becoming increasingly essential for the vast number of documents available in digital libraries, emails, the Internet, etc. Textual records frequently contain non-discriminative (noisy and irrelevant) terms that are also high-dimensional, resulting in higher computing costs and poorer learning performance in Text Classification (TC). Feature selection (FS), which tries to discover discriminate terms or features from the textual data, is one of the most effective tasks for this issue. This paper introduces a novel multi-stage term-weighting scheme-based FS model designed for the single-label TC system to obtain the optimal set of features. We have also developed a hybrid deep learning fine-tuning network based on Bidirectional Long Short-Term Memory (BiLSTM) and Convolutional Neural Network (CNN) for the classification stage. The FS approach is worked on two-stage criteria. The filter model is used in the first stage, and the multi-objective wrapper model, an upgraded version of the Whale Optimization Algorithm (WOA) with Particle Swarm Optimization (PSO), is used in the second stage. The objective function in the above wrapper model is based on a tri-objective principle. It uses the Pareto front technique to discover the optimal set of features. Here in the wrapper model, a novel selection strategy has been introduced to select the whale instead of the random whale. The proposed work is evaluated on four popular benchmark text corpora, of which two are binary class, and two are multi-class. The suggested FS technique is compared against classic Machine Learning (ML) and deep learning classifiers. The results of the experiments reveal that the recommended FS technique is more effective in obtaining better results than the other results. [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]

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]

In this paper, a novel model of an energy management system (EMS) for a microgrid (MG) under uncertain conditions is proposed. The MG consists of renewable photovoltaic and wind sources along with electric vehicle parking lots. Hence, the model incorporates the uncertainties of renewable DGs, parking lots, and also load. In this study, the MG operation cost and voltage stability index are considered objective functions. A novel combined algorithm (hMOPSO-HS) is proposed for microgrid energy management. The hMOPSO-HS algorithm is a combination of the mutant multiobjective particle swarm optimization (MOPSO) algorithm and the harmony search (HS) algorithm. The simulations are performed in two parts, with and without considering the uncertainty. The comparative analysis involves evaluating the optimization outcomes achieved by the hMOPSO-HS algorithm in contrast to various other metaheuristic algorithms for multiobjective optimization. The simulation findings validate the superior efficacy of the hMOPSO-HS algorithm compared to other approaches. Also, the simulation results showed that in the conditions of uncertainty, the operating cost is 6.1% higher and the microgrid stability index is 6.8% lower. Also, considering the uncertainty has caused the penalty for energy not supplied (ENS) and demand response program (DRP) costs to increase by 3% and 4%, respectively. [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]

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]

Today, cloud computing technology has attracted the attention of many researchers. According to the needs of users to quickly execute requests and provide quality services, optimal allocation of resources and timing of task execution between virtual machines in cloud computing are of great importance. One of the important challenges that cloud service providers face is the effective management of resources by physical infrastructure. Therefore, in this paper, an autonomous system based on the Clipped Double Deep Q-Learning (CDDQL) Algorithm and the meta-heuristic Particle Swarm Optimization (PSO) for resource allocation is proposed in the Fog-cloud computing infrastructure. The PSO algorithm is used to prioritize the tasks and CDDQL is used as the core of the autonomous system (Auto-CDDQL) to allocate the desired VM resources to the tasks. The proposed Auto-CDDQL is implemented in the Fog and performs this process autonomously. By evaluating the results, it was observed that the amount of Make Span, response time, task completion, resource utilization, and energy consumption rate in the proposed AutoCDDQL on the c-hilo dataset, compared to the FCFS, RR, and PBTS methods, are significantly improved. [ABSTRACT FROM AUTHOR]

Cloud computing has experienced extraordinary development across a wide range of industries by giving customers the flexibility to employ computing resources as needed. The task scheduling problem is one of several major challenges in cloud computing, and it should be scheduled effectively to minimize makespan and maximize resource utilization. Therefore, this paper put forward an improved scheduling efficiency algorithm called Enhanced Marine Predator Algorithm (EMPA). Firstly, task scheduling model with makespan and resource utilization is constructed. Secondly, each individual represents a result of task scheduling, and the purpose of algorithms is to find the optimal scheduling result, therefore the operator of WOA, nonlinear inertia weight coefficient and golden sine strategy are introduced into Marine Predator Algorithm. In the simulation experiment, EMPA is compared with Grey Wolf Optimizer (GWO), Sine Cosine Algorithm (SCA), Particle Swarm Optimization (PSO), and Whale Optimization Algorithm (WOA) under different number of tasks in synthetic datasets and GoCJ datasets.The experimental results show that the EMPA algorithm has more advantages in terms of makespan, degree of imbalance, and resource utilization. [ABSTRACT FROM AUTHOR]

The Whale Optimization Algorithm (WOA) is an efficient meta-heuristic algorithm inspired by the feeding behavior of whales. Although it has successfully solved many optimization problems, it still suffers from premature convergence and poor accuracy when solving complex problems. To address these issues, this paper proposes an improved whale optimization algorithm called EIWOA to improve the search efficiency and accuracy. First, we introduce a new global search mechanism and encircling prey strategy in EIWOA, which utilizes differential evolution, and sine-cosine search strategy to improve the global search efficiency and avoid premature convergence. Second, we use a lévy flight-based spiral update position strategy to improve the local search efficiency of the algorithm, thus improving the convergence speed and accuracy. Again, we introduce a balancing factor with fluctuating decay properties into EIWOA to better balance exploration and exploitation. Finally, we introduce a dynamic opposite learning-based whale-fall strategy in EIWOA to equip the algorithm with the ability to jump out of the local optimum. The qualitative analysis of the algorithm shows that the EIWOA algorithm converges quickly, is highly accurate, and has the ability to jump out of the local optimum. In order to validate the performance of the proposed EIWOA algorithm, we evaluated the algorithm on CEC2017 benchmark function and four real world engineering problems. We also conduct a comparative study of the EIWOA algorithm with EWOA, an excellent variant of WOA, as well as some excellent meta-heuristics developed recently. The results of numerical experiments demonstrate the superiority of the proposed EIWOA, which is further confirmed statistically by the results of Friedman's test and Wilcoxon signed rank test. The proposed EIWOA algorithm is significantly better than WOA and other competing algorithms in terms of convergence speed, accuracy and optimization ability in dealing with complex optimization problems. [ABSTRACT FROM AUTHOR]

This paper introduces an innovative approach that significantly enhances the reliability indices of the radial distribution system, thereby effectively upgrading its overall performance. The optimal location and number of isolators in the electrical distribution network are determined using a metaheuristic algorithm, such as the genetic algorithm and particle swarm optimization approaches. The product of the system's annual outage length and the total number of consumers affected is used to frame the problem within the restrictions of the ideal number of switches and the need for a power supply that can meet consumer requests. The cost of energy not served (CENS) and system average interruption duration index (SAIDI) are reliability indicators that have been used to identify the root of the issue. The method has been put to the test on 59 and 34 load point systems, and the results demonstrate that the suggested method in the study is accepted. The GA and PSO are compared on 34 and 59 bus radial network and found that GA provide better result. The ENS and profit have been compared, and it is found GA provides superb result in both cases. It is also observed that the optimal number of isolators required in 59 bus system is 31 and 42 for GA and PSO, respectively. The application of the suggested technique for isolator placement in 59 bus radial network provides a reduction in SAIDI 45.6% and 43.97% from GA and PSO, respectively, it is also observed that reduction in ENS is 59.9% and 58.45% from GA and PSO, respectively. Diminution in ENS indicates that the final group of clients is happy with the quality of the service being rendered in their location. [ABSTRACT FROM AUTHOR]

This paper proposed a multi-objective-based Generation Expansion Planning (GEP) for the real-word power generation system of Tamil Nadu, an Indian state. GEP aims to solve numerous conflicting problems for constructing new power plants. The proposed approaches are Multi-Objective Comprehensive Learning Particle Swarm Optimization (MOCLPSO) and Circle Search algorithm. The key objectives of the proposed method is to reduce budget, to maximize reliability and to minimize the pollutant discharge. Therefore, the apt formulations are modeled and solved to establish the conflicting facets of GEP problem. This paper implements MOCLPSO algorithm to solve Multi-Objective GEP (MOGEP) problem for 7-year and 14-year planning horizon. By then, the proposed model is implemented at MATLAB/Simulink platform and the implementation is calculated. The proposed method shows better results in all approaches like Seagull Optimization Algorithm (SOA), Particle Swarm Optimization (PSO) and Cuckoo Search algorithm. The outcomes establish the competence of MOCLPSO and Circle Search Algorithm to offer good-ranged Pareto optimal non-dominated solutions. [ABSTRACT FROM AUTHOR]

Efficient energy extraction in photovoltaic (PV) systems relies on the effective implementation of Maximum Power Point Tracking (MPPT) techniques. Conventional MPPT techniques often suffer from slow convergence speeds and suboptimal tracking performance, particularly under dynamic variations of environmental conditions. Smart optimization algorithms (SOA) using metaheuristic optimization algorithms can avoid these limitations inherent in conventional MPPT methods. The problem of slow convergence of the SOA is avoided in this paper using a novel strategy called Swarm Size Reduction (SSR) utilized with a Particle Swarm Optimization (PSO) algorithm, specifically designed to achieve short convergence time (CT) while maintaining exceptional tracking accuracy. The novelty of the proposed MPPT method introduced in this paper is the dynamic reduction of the swarm size of the PSO for improved performance of the MPPT of the PV systems. This adaptive reduction approach allows the algorithm to efficiently explore the solution space of PV systems and rapidly exploit it to identify the global maximum power point (GMPP) even under fast fluctuations of uneven solar irradiance and temperature. This pioneering ultra-fast MPPT method represents a significant advancement in PV system efficiency and promotes the wider adoption of solar energy as a reliable and sustainable power source. The results obtained from this proposed strategy are compared with several optimization algorithms to validate its superiority. This study aimed to use SSR with different swarm sizes and then find the optimum swarm size for the MPPT system to find the lowest CT. The output accentuates the exceptional performance of this innovative method, achieving a time reduction of as much as 75% when compared with the conventional PSO technique, with the optimal swarm size determined to be six. [ABSTRACT FROM AUTHOR]

With the rapid development of the geometric modeling industry and computer technology, the design and shape optimization of complex curve shapes have now become a very important research topic in CAGD. In this paper, the Hybrid Artificial Hummingbird Algorithm (HAHA) is used to optimize complex composite shape-adjustable generalized cubic Ball (CSGC–Ball, for short) curves. Firstly, the Artificial Hummingbird algorithm (AHA), as a newly proposed meta-heuristic algorithm, has the advantages of simple structure and easy implementation and can quickly find the global optimal solution. However, there are still limitations, such as low convergence accuracy and the tendency to fall into local optimization. Therefore, this paper proposes the HAHA based on the original AHA, combined with the elite opposition-based learning strategy, PSO, and Cauchy mutation, to increase the population diversity of the original algorithm, avoid falling into local optimization, and thus improve the accuracy and rate of convergence of the original AHA. Twenty-five benchmark test functions and the CEC 2022 test suite are used to evaluate the overall performance of HAHA, and the experimental results are statistically analyzed using Friedman and Wilkerson rank sum tests. The experimental results show that, compared with other advanced algorithms, HAHA has good competitiveness and practicality. Secondly, in order to better realize the modeling of complex curves in engineering, the CSGC–Ball curves with global and local shape parameters are constructed based on SGC–Ball basis functions. By changing the shape parameters, the whole or local shape of the curves can be adjusted more flexibly. Finally, in order to make the constructed curve have a more ideal shape, the CSGC–Ball curve-shape optimization model is established based on the minimum curve energy value, and the proposed HAHA is used to solve the established shape optimization model. Two representative numerical examples comprehensively verify the effectiveness and superiority of HAHA in solving CSGC–Ball curve-shape optimization problems. [ABSTRACT FROM AUTHOR]

Metaheuristic optimization algorithms (MHA) play a significant role in obtaining the best (optimal) values of the system's parameters to improve its performance. This role is significantly apparent when dealing with systems where the classical analytical methods fail. Fractional-order (FO) systems have not yet shown an easy procedure to deal with the determination of their optimal parameters through traditional methods. In this paper, a recent, systematic. And comprehensive review is presented to highlight the role of MHA in obtaining the best set of gains and orders for FO controllers. The systematic review starts by exploring the most relevant publications related to the MHA and the FO controllers. The study is focused on the most popular controllers such as the FO-PI, FO-PID, FO Type-1 fuzzy-PID, and FO Type-2 fuzzy-PID. The time domain is restricted in the articles published through the last decade (2014:2023) in the most reputed databases such as Scopus, Web of Science, Science Direct, and Google Scholar. The identified number of papers, from the entire databases, has reached 850 articles. A Preferred Reporting Items for Systematic Reviews and Meta-Analyses (PRISMA) methodology was applied to the initial set of articles to be screened and filtered to end up with a final list that contains 82 articles. Then, a thorough and comprehensive study was applied to the final list. The results showed that Particle Swarm Optimization (PSO) is the most attractive optimizer to the researchers to be used in the optimal parameters identification of the FO controllers as it attains about 25% of the published papers. In addition, the papers that used PSO as an optimizer have gained a high citation number despite the fact that the Chaotic Atom Search Optimization (ChASO) is the highest one, but it is used only once. Furthermore, the Integral of the Time-Weighted Absolute Error (ITAE) is the best nominated cost function. Based on our comprehensive literature review, this appears to be the first review paper that systematically and comprehensively addresses the optimization of the parameters of the fractional-order PI, PID, Type-1, and Type-2 fuzzy controllers with the use of MHAs. Therefore, the work in this paper can be used as a guide for researchers who are interested in working in this field. [ABSTRACT FROM AUTHOR]

With the development of science and technology, many optimization problems in real life have developed into high-dimensional optimization problems. The meta-heuristic optimization algorithm is regarded as an effective method to solve high-dimensional optimization problems. However, considering that traditional meta-heuristic optimization algorithms generally have problems such as low solution accuracy and slow convergence speed when solving high-dimensional optimization problems, an adaptive dual-population collaborative chicken swarm optimization (ADPCCSO) algorithm is proposed in this paper, which provides a new idea for solving high-dimensional optimization problems. First, in order to balance the algorithm's search abilities in terms of breadth and depth, the value of parameter G is given by an adaptive dynamic adjustment method. Second, in this paper, a foraging-behavior-improvement strategy is utilized to improve the algorithm's solution accuracy and depth-optimization ability. Third, the artificial fish swarm algorithm (AFSA) is introduced to construct a dual-population collaborative optimization strategy based on chicken swarms and artificial fish swarms, so as to improve the algorithm's ability to jump out of local extrema. The simulation experiments on the 17 benchmark functions preliminarily show that the ADPCCSO algorithm is superior to some swarm-intelligence algorithms such as the artificial fish swarm algorithm (AFSA), the artificial bee colony (ABC) algorithm, and the particle swarm optimization (PSO) algorithm in terms of solution accuracy and convergence performance. In addition, the APDCCSO algorithm is also utilized in the parameter estimation problem of the Richards model to further verify its performance. [ABSTRACT FROM AUTHOR]

In this paper, the learning process of multilayer perceptron (MLP) neural network is boosted using hybrid metaheuristic optimization algorithms. Normally, the learning process in MLP requires suitable settings of its weight and bias parameters. In the original version of MLP, the gradient descent algorithm is used as a learner in MLP which suffers from two chronic problems: local minima and slow convergence. In this paper, six versions of memetic algorithms (MAs) are proposed to replace gradient descent learning mechanism of MLP where adaptive β -hill climbing (A β HC) as a local search algorithm is hybridized with six population-based metaheuristics which are hybrid flower pollination algorithm, hybrid salp swarm algorithm, hybrid crow search algorithm, hybrid grey wolf optimization (HGWO), hybrid particle swarm optimization, and hybrid JAYA algorithm. This is to show the effect of the proposed MA versions on the performance of MLP. To evaluate the proposed MA versions for MLP, 15 classification benchmark problems with different size and complexity are used. The A β HC algorithm is invoked in the improvement loop of any MA version with a probability of B r parameter, which is investigated to monitor its effect on the behavior of the proposed MA versions. The B r setting which obtains the most promising results is then used to set the hybrid MA. The results show that the proposed MA versions excel the original algorithms. Moreover, HGWO outperforms all other MA versions in almost all the datasets. In a nutshell, MAs are a good choice for training MLP to produce results with high accuracy. [ABSTRACT FROM AUTHOR]

Summary: Unmanned aerial vehicle (UAV) path planning can be treated as a nondeterministic polynomial (NP) hard concern or an optimization problem. The conventional approaches are unable to effectively handle these issues due to discontinuity, non‐linearity, multi‐modality, and inseparability. On the other hand, meta‐heuristic algorithms are effective at tackling these issues because they are simple, adaptable, and derivation free. To enhance the performance in a variety of challenging circumstances, this paper proposes a novel Q‐learning‐based multi‐objective sheep flock optimizer with a Cauchy operator (Q‐MOSFO‐CA) to solve the constrained UAV path planning issues. The multi‐objective functions considered here are costs and constraints (threat, terrain, turning, climbing, and gliding constraints) to determine the feasible and optimal path. To avoid the probability of falling into the local optimum and to address the shortcoming of unbalanced convergence and also to maintain the exploitation and exploration capability, the Cauchy operator (CA) is integrated with the sheep flock optimization (SFO) algorithm. The Q‐learning model is introduced to balance both the global and local searches. Here, the exploration model performs the global search whereas the exploitation model performs the local search to attain an optimal solution. In the simulation scenario, the statistical analysis is conducted under two scenarios, and some essential measures such as the number of iterations at convergence (NIC), evaluation time (ET), energy consumption, and convergence analysis are determined. The proposed method obtains NIC of 1305 and 1436, ET of 12.8 and 15.2 s, and energy consumption of 20,600 and 21,465 J for both Scenarios 1 and 2, respectively. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) edge is an emerging technology of sensors and devices that communicate real-time data to a network. IoT edge computing was introduced to handle the latency concerns related to cloud computing data management, as the data are processed closer to their point of origin. Clustering and scheduling tasks on IoT edge computing are considered a challenging problem due to the diverse nature of task and resource characteristics. Metaheuristics and optimization methods are widely used in IoT edge task clustering and scheduling. This paper introduced a new task clustering and scheduling mechanism using differential evolution optimization on IoT edge computing. The proposed mechanism aims to optimize task clustering and scheduling to find optimal execution times for submitted tasks. The proposed mechanism for task clustering is based on the degree of similarity of task characteristics. The proposed mechanisms use an evolutionary mechanism to distribute system tasks across suitable IoT edge resources. The clustering tasks process categorizes tasks with similar requirements and then maps them to appropriate resources. To evaluate the proposed differential evolution mechanism for IoT edge task clustering and scheduling, this study conducted several simulation experiments against two established mechanisms: the Firefly Algorithm (FA) and Particle Swarm Optimization (PSO). The simulation configuration was carefully created to mimic real-world IoT edge computing settings to ensure the proposed mechanism's applicability and the simulation results' relevance. In the heavyweight workload scenario, the proposed DE mechanism started with an execution time of 916.61 milliseconds, compared to FA's 1092 milliseconds and PSO's 1026.09 milliseconds. By the 50th iteration, the proposed DE mechanism had reduced its execution time significantly to around 821.27 milliseconds, whereas FA and PSO showed lesser improvements, with FA at approximately 1053.06 milliseconds and PSO stabilizing at 956.12 milliseconds. The simulation results revealed that the proposed differential evolution mechanism for edge task clustering and scheduling outperforms FA and PSO regarding system efficiency and stability, significantly reducing execution time and having minimal variation across simulation iterations. [ABSTRACT FROM AUTHOR]