Search

Original lidar return signals are covered by high levels of noise that seriously affect the accuracy of subsequent data processing and inversion. Therefore, it is important to separate the effective signal from the returned signal with noise interference. In this paper, an efficient denoising method based on the variational mode decomposition (VMD) algorithm optimized using the global search strategy-based whale algorithm and the total variational stationary wavelet transform (GSWOA-VMD-SWTTV) is proposed, and this method is applied to denoising of lidar return signals. First, the global search strategy-based whale optimization algorithm (GSWOA) is used to acquire the optimal parameters of the VMD algorithm adaptively, and the lidar return signal is then decomposed by global search strategy-based whale optimization algorithm (GSWOA)-VMD. The effective modal components are then determined using the cross-correlation coefficient method from the decomposed modal components, and total variation stationary wavelet denoising is performed on each effective mode. Finally, the effective modes are reconstructed to obtain a clean lidar return signal. Moreover, to provide further verification of the effectiveness of the proposed method, it is compared with the ensemble empirical mode decomposition (EEMD) method, the complete EEMD with adaptive noise (CEEMDAN) method, the singular value decomposition (SVD) method, and the wavelet threshold method under sunny, cloudy, and dusty weather conditions. The experimental results demonstrate the superior noise reduction performance of the proposed algorithm, which can filter out strong noise from the signal while retaining the complete signal details without distortion; additionally, the proposed method has the highest signal-to-noise ratio and lowest mean square error. [ABSTRACT FROM AUTHOR]

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]

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 paper introduces a novel metaheuristic algorithm named the opposition-based cooperation search algorithm with Nelder–Mead (OCSANM). This enhanced algorithm builds upon the cooperation search algorithm (CSA) by incorporating opposition-based learning (OBL) and the Nelder–Mead simplex search method. The primary application of this algorithm is the design of a fractional-order proportional–integral–derivative (FOPID) controller for a buck converter system. A comprehensive evaluation is conducted using statistical boxplot analysis, nonparametric statistical tests and convergence response comparisons to assess the algorithm's performance and confirm its superiority over CSA. Furthermore, the FOPID-controlled buck converter system based on OCSANM is compared with two top-performing algorithms: one using a hybridized approach of Lévy flight distribution with simulated annealing (LFDSA) and the other employing the improved hunger games search (IHGS) algorithm. This comparison encompasses transient and frequency responses, performance indices and robustness analysis. The results reveal the notable advantages of the proposed OCSANM-based system, including 25.8% and 8.7% faster rise times, 26% and 8.8% faster settling times compared with the best-performing approaches, namely LFDSA and IHGS, respectively. In addition, the OCSANM-based system exhibits a 34.7% and 9.6% wider bandwidth than the existing approaches-based systems. Incorporating voltage and current responses of the buck converter's switched circuit with the OCSANM-based FOPID controller further underscores the algorithm's effectiveness. To provide a comprehensive assessment, the paper also compares the proposed approach's time and frequency domain responses with those of 17 other state-of-the-art approaches attempting to control buck converter systems similarly. These findings affirm the effectiveness of the OCSANM in designing FOPID controllers for buck converter systems. [ABSTRACT FROM AUTHOR]

Many companies prefer to use third party logistics firms to deliver their goods and as such planning the return of the vehicles to the depot is not required. This is called open vehicle routing problem (OVRP). In literature, the OVRP is handled with minimum distance as objective function like vehicle routing problem. But in the real world, the objective function achieves minimum many costs like standard routing cost, stopping by cost and the deviation cost. The standard routes are previously defined under free market conditions by third party logistic firms. The deviation from the standard route is required to arrive cities which are not on the standard route. The stop by cost occurs on the delivery points. In this paper mentioned three costs are considered in the objective function while many papers consider only distance related costs in the literature. This paper proposes a new mathematical model for the OVRP. In the constraints, the last points of the routes are researched in detail. The standard route costs are determined by considering the last point of the route. Because of the NP-hard structure of the OVRP, the proposed mathematical model is solved with a hybrid metaheuristic called Civilized Genetic Algorithm (CGA). CGA is developed by hybridizing a modified genetic algorithm and a local search algorithm. The application of this study is implemented for the delivery routing of a combi boiler producer in Turkey. The third party logistic firms may use this proposed model and the solution approach for the real life applications. [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]

How to effectively utilize renewable energy and improve the economic efficiency of microgrid system and its ability to consume renewable energy has become one of the main problems facing China at present. In response to this challenge, this paper establishes a multiobjective capacity optimization model with the minimum levelized cost of energy, the maximum proportion of renewable energy consumption, and the minimum comprehensive system cost. Based on this model, a new improved beluga whale optimization algorithm is proposed to solve the multiobjective optimization problem in the capacity allocation process of wind–solar–storage microgrid system with the goal of ensuring that the microgrid can meet the maximum load demand at different moments throughout the year. In this paper, opposition‐based learning, artificial bee colony, dynamic opposite, and beluga whale optimization are combined to improve the population diversity and convergence accuracy, thereby enhancing the optimization performance of the algorithm. Finally, after finding the optimal Pareto front solution, the Technique for Order Preference by Similarity to an Ideal Solution is used to help decision‐makers select the optimal solution. Using real load data and meteorological data, the results of this paper show that the multiobjective capacity allocation optimization method of grid‐connected scenic storage microgrid system based on the improved beluga whale optimization algorithm can improve the economics of the wind–solar–storage microgrid system and promote the photovoltaic consumption simultaneously, providing a solution for the realization of low‐carbon power and regional economic development. The best‐found levelized cost of energy for the wind–solar–storage microgrid system is 0.192 yuan/kWh. [ABSTRACT FROM AUTHOR]

Medical image segmentation is crucial in using digital images for disease diagnosis, particularly in post-processing tasks such as analysis and disease identification. Segmentation of magnetic resonance imaging (MRI) and computed tomography images pose distinctive challenges attributed to factors such as inadequate illumination during the image acquisition process. Multilevel thresholding is a widely adopted method for image segmentation due to its effectiveness and ease of implementation. However, the primary challenge lies in selecting the optimal set of thresholds to achieve accurate segmentation. While Otsu's between-class variance and Kapur's entropy assist in identifying optimal thresholds, their application to cases requiring more than two thresholds can be computationally intensive. Meta-heuristic algorithms are commonly employed in literature to calculate the threshold values; however, they have limitations such as a lack of precise convergence and a tendency to become stuck in local optimum solutions. In this paper, we introduce an improved chameleon swarm algorithm (ICSA) to address these limitations. ICSA is designed for image segmentation and global optimization tasks, aiming to improve the precision and efficiency of threshold selection in medical image segmentation. ICSA introduces the concept of the "best random mutation strategy" to enhance the search capabilities of the standard chameleon swarm algorithm (CSA). This strategy leverages three distribution functions—Levy, Gaussian, and Cauchy—for mutating search individuals. These diverse distributions contribute to improved solution quality and help prevent premature convergence. We conduct comprehensive experiments using the IEEE CEC'20 complex optimization benchmark test suite to evaluate ICSA's performance. Additionally, we employ ICSA in image segmentation, utilizing Otsu's approach and Kapur's entropy as fitness functions to determine optimal threshold values for a set of MRI images. Comparative analysis reveals that ICSA outperforms well-known metaheuristic algorithms when applied to the CEC'20 test suite and significantly improves image segmentation performance, proving its ability to avoid local optima and overcome the original algorithm's drawbacks. Medical image segmentation is essential for employing digital images for disease diagnosis, particularly for post-processing activities such as analysis and disease identification. Due to poor illumination and other acquisition-related difficulties, radiologists are especially concerned about the optimal segmentation of brain magnetic resonance imaging (MRI). Multilevel thresholding is the most widely used image segmentation method due to its efficacy and simplicity of implementation. The issue, however, is selecting the optimum set of criteria to effectively segment each image. Although methods like Otsu's between-class variance and Kapur's entropy help locate the optimal thresholds, using them for more than two thresholds requires a significant amount of processing resources. Meta-heuristic algorithms are commonly employed in literature to calculate the threshold values; however, they have limitations such as a lack of precise convergence and a tendency to become stuck in local optimum solutions. Due to the aforementioned, we present an improved chameleon swarm algorithm (ICSA) in this paper for image segmentation and global optimization tasks to be able to address these weaknesses. In the ICSA method, the best random mutation strategy has been introduced to improve the searchability of the standard CSA. The best random strategy utilizes three different types of distribution: Levy, Gaussian, and Cauchy to mutate the search individuals. These distributions have different functions, which help enhance the quality of the solutions and avoid premature convergence. Using the IEEE CEC'20 test suite as a recent complex optimization benchmark, a comprehensive set of experiments is carried out in order to evaluate the ICSA method and demonstrate the impact of combining the best random mutation strategy with the original CSA in improving both the performance of the solutions and the rate at which they converge. Furthermore, utilizing the Otsu approach and Kapur's entropy as a fitness function, ICSA is used as an image segmentation method to select the ideal threshold values for segmenting a set of MRI images. Within the experiments, the ICSA findings are compared with well-known metaheuristic algorithms. The comparative findings showed that ICSA performs better than other competitors in solving the CEC'20 test suite and has a significant performance boost in image segmentation. [ABSTRACT FROM AUTHOR]

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

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]

Mobile object detection and tracking is an important application of wireless sensor network. However, longevity of such application is a challenge as sensor nodes in wireless sensor network operates on battery power. Therefore, there is the requirement for increasing the lifetime of this application by optimal usage of energy while tracking. Of course, while optimizing the energy usage, tracking accuracy should not be compromised. A number of research works are carried out in the past to enhance the wireless sensor network lifetime but no work resolved the problem completely. This paper studies the issue of data routing to sink in energy constrained wireless sensor network based application where tracking information collected from different sensor nodes are processed to determine the object's presence in the monitoring area. This paper proposes an energy efficient hybrid artificial bee colony-modified Dijkstra (HABC-MD) algorithm for cluster based network for optimum usage of energy during routing of packet. The objective of this algorithm is to save the energy of the network by optimizing the number of node-to-node transmission while tracking. It uses metaheuristic approach based artificial bee colony algorithm for selection of cluster head in each round and heuristic approach-based Dijkstra algorithm for selection of optimum route between source node and sink for packet transmission. Modified Dijkstra algorithm considers both distance between source and destination and energy of the source node for determination of optimum route to sink. The performance of HABC-MD is compared with existing hybrid LEACH-Dijkstra algorithm and is found that performance of our algorithm is better in comparison to later algorithm. [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]

With the continuous expansion of urban scale in China, the increase of passenger flow has brought great pressure to the urban public transport system. An accurate and timely prediction of the short-term passenger flow at each metro station is extremely important for the metro intelligent control system to make a timely decision. In this paper, based on the measured passenger flow data of Zijingshan station of Zhengzhou Metro Line 1, an improved whale optimization algorithm is proposed to predict the passenger flow on different time scales. The results show that the method has higher accuracy than the traditional least squares support vector machines algorithm. The paper opens a new window for nowcasting warning in the rush hour and long-period optimization of the public transport. [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]

Non-speech emotion recognition involves identifying emotions conveyed through non-verbal vocalizations such as laughter, crying, and other sound signals, which play a crucial role in emotional expression and transmission. This paper employs a nine-category discrete emotion model encompassing happy, sad, angry, peaceful, fearful, loving, hateful, brave, and neutral. A proprietary non-speech dataset comprising 2337 instances was utilized, with 384-dimensional feature vectors extracted. The traditional Backpropagation Neural Network (BPNN) algorithm achieved a recognition rate of 87.7% on the non-speech dataset. In contrast, the proposed Whale Optimization Algorithm - Backpropagation Neural Network (WOA-BPNN) algorithm, applied to a self-made non-speech dataset, demonstrated a remarkable accuracy of 98.6%. Notably, even without facial emotional cues, non-speech sounds effectively convey dynamic information, and the proposed algorithm excels in their recognition. The study underscores the importance of non-speech emotional signals in communication, especially with the continuous advancement of artificial intelligence technology. The abstract thus encapsulates the paper's focus on leveraging AI algorithms for high-precision non-speech emotion recognition. [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]

Harris Hawks Optimization (HHO) is a novel meta-heuristic optimization algorithm. The algorithm is inspired by the behavior of Harris Hawks collaborating with each other to pursue prey in nature. The algorithm has the advantages of simple structure, fewer parameters, easy implementation, and excellent performance on high-dimensional problems. However, the algorithm also suffers from the inability to strike a good balance between exploration and exploitation, low convergence accuracy, and slow convergence speed in the early stage. In response to these defects, this paper will introduce three strategies to the HHO: a non-negative stochastic shrinkage exponential energy function, a Cauchy-Gaussian-based dynamic variance reduction selection strategy, and a greedy-difference-based selection strategy. The improved algorithm TSHHO is analyzed on the well-established 28 benchmark test functions, and four industrial engineering design problems. The experimental results show that the TSHHO algorithm proposed in this paper can achieve a better balance in the exploration and development stages,the strategies significantly improve the search efficiency, convergence accuracy, and robustness of the algorithm. [ABSTRACT FROM AUTHOR]

To achieve high precision and robust control of switched reluctance machines (SRMs), this paper proposes a novel rotor position estimation method based on gain-optimized sliding mode observer (SMO) with neural networks and whale optimization algorithm. For the SMO, this paper uses the easily measured phase current to constitute the error function of the SMO, which requires less pre-stored data. Using the neural networks' powerful nonlinear mapping capability, the relationship between the sliding mode gains and speed estimation error and the position estimation error is obtained, and then the whale optimization algorithm is used to find the optimal sliding mode gains in the restricted range. The simulation and experiment results show that the accuracy of the SMO control system is significantly improved. [ABSTRACT FROM AUTHOR]

This paper deals with the design, simulation, and practical modeling of metamaterial-based multiband conformal bandpass filter (BPF) for various wireless communication applications with improved quality factors. The novel metamaterial in the form of a split ring resonator is loaded on the ground plane face of the proposed BPF. The overall dimension of the designed BPF is only 2 8 × 2 8 mm 2 . The proposed BPF is tuned initially for quality factor enhancement based on the thickness of the substrate, physical parameters of the f transmission line, ground plane, externally loaded elements, and the gap in the metamaterial loading. The suggested filter operates at triple band covering the frequency bands from 1.4 to 2.2, 3.6 to 3.9, and 4.8 to 5.9 GHz, which are suitable for sub-6 GHz 5G and other wireless applications. The insertion loss is observed as 1 dB, which is suitable for the proposed BPF. The conformal behavior of the filter is judged through bending deformation analysis at various bending positions like (15 ∘ , 30 ∘ , 45 ∘ , 60 ∘ , and 90 ∘ ). The proposed BPF retains triple pass band characteristics at various bending deformations, which makes it suitable to be used in curved structures or flexible circuitry. The theory of equivalent circuits and quality factor (Q) of the designed BPF is discussed in this paper. The results are analyzed experimentally through ANRITSU-MS2037C combinational analyzer. The proposed BPF is suitable for sub-6 GHz 5G, WLAN, and Wi-Max applications. [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]

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]

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]

This paper aims to solve the Chinese Postman Problem (CPP) using an Ant Colony Optimization (ACO) algorithm. In graph theory, the CPP looks for the shortest closed path that visits every edge of a connected undirected graph. This problem has many applications, including route optimization, interactive system analysis, and flow design. Although numerous algorithms aimed at solving CPP are present in the literature, very few meta-heuristic algorithms are proposed, and no ACO applications have been proposed to solve them. This paper tries to fill this gap by presenting an ACO algorithm that solves CPP (ACO-CPP). To prove its consistency and effectiveness, ACO-CPP is compared with a Genetic Algorithm (GA) and a recursive algorithm throughout three experiments: (1) recursive-ACO-GA comparisons over randomly generated graphs for the attainment of the global optimum; (2) ACO-GA statistical comparisons over specifically generated graphs; (3) recursive-ACO-GA comparisons by changing ACO hyperparameters over randomly generated graphs for the attainment of the global optimum. The experiments prove that the ACO-CPP algorithm is efficient and exhibits a consistency similar to GA when the number of possible solutions to explore is relatively low. However, when that number greatly exceeds those explored, ACO outperforms GA. This suggests that ACO is more suitable for solving problems with a CPP structure. [ABSTRACT FROM AUTHOR]

This review aims to exploit a study on different benchmark test functions used to evaluate the performance of Meta-Heuristic (MH) optimization techniques. The performance of the MH optimization techniques is evaluated with the different sets of mathematical benchmark test functions and various real-world engineering design problems. These benchmark test functions can help to identify the strengths and weaknesses of newly proposed MH optimization techniques. This review paper presents 215 mathematical test functions, including mathematical equations, characteristics, search space and global minima of the objective function and 57 real-world engineering design problems, including mathematical equations, constraints, and boundary conditions of the objective functions carried out from the literature. The MATLAB code references for mathematical benchmark test functions and real-world design problems, including the Congress of Evolutionary Computation (CEC) and Genetic and Evolutionary Computation Conference (GECCO) test suite, are presented in this paper. Also, the winners of CEC are highlighted with their reference papers. This paper also comprehensively reviews the literature related to benchmark test functions and real-world engineering design challenges using a bibliometric approach. This bibliometric analysis aims to analyze the number of publications, prolific authors, academic institutions, and country contributions to assess the field's growth and development. This paper will inspire researchers to innovate effective approaches for handling inequality and equality constraints. [ABSTRACT FROM AUTHOR]

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

Purpose: Metaheuristic algorithms based on biology, evolutionary theory and physical principles, have been widely developed for complex global optimization. This paper aims to present a new hybrid optimization algorithm that combines the characteristics of biogeography-based optimization (BBO), invasive weed optimization (IWO) and genetic algorithms (GAs). Design/methodology/approach: The significant difference between the new algorithm and original optimizers is a periodic selection scheme for offspring. The selection criterion is a function of cyclic discharge and the fitness of populations. It differs from traditional optimization methods where the elite always gains advantages. With this method, fitter populations may still be rejected, while poorer ones might be likely retained. The selection scheme is applied to help escape from local optima and maintain solution diversity. Findings: The efficiency of the proposed method is tested on 13 high-dimensional, nonlinear benchmark functions and a homogenous slope stability problem. The results of the benchmark function show that the new method performs well in terms of accuracy and solution diversity. The algorithm converges with a magnitude of 10-4, compared to 102 in BBO and 10-2 in IWO. In the slope stability problem, the safety factor acquired by the analogy of slope erosion (ASE) is closer to the recommended value. Originality/value: This paper introduces a periodic selection strategy and constructs a hybrid optimizer, which enhances the global exploration capacity of metaheuristic algorithms. [ABSTRACT FROM AUTHOR]

This paper proposes a novel nature-inspired meta-heuristic algorithm, named Snow Geese Algorithm. It is inspired by the migratory behavior of snow geese and emulates the distinctive "Herringbone" and "Straight Line" shaped flight patterns observed during their migration. The algorithm is structured into three main phases for benchmark testing. In the first phase, the Snow Geese Algorithm's numerical results are compared with those of several classical meta-heuristic algorithms using the same test functions and original data from these algorithms. In the second phase, in order to minimize potential variations during the comparison, all algorithms undergo evaluation on a standardized testing platform. In the third phase, this paper applies the Snow Geese Algorithm to solve four widely recognized engineering optimization problems: the tubular column design, piston lever optimization design, reinforced concrete beam design and car side impact design. These real-world engineering problems serve as test cases to assess Snow Geese Algorithm problem-solving capabilities. The primary objective of the Snow Geese Algorithm is to provide an alternative perspective for tackling complex optimization problems. Please note that the complete source code for the Snow Geese Algorithm is publicly available at https://github.com/stones3421/SGA-project. • Snow Geese Algorithm: A novel meta-heuristic approach inspired by snow geese flight behavior, tackling optimization problems. • Two-stage Strategy: Mimics snow geese exploration and exploitation patterns, setting it apart from traditional methods. • Performance Evaluation: Multiple algorithms are assessed on different problems. • Algorithm Features: Experimental results validate the effectiveness of the Snow Geese Algorithm. • Practical Applications: Snow Geese Algorithm shows potential in engineering optimization, aiding accurate decision-making. [ABSTRACT FROM AUTHOR]

As a new network architecture, Software Defined Network (SDN) has been widely used in recent years. The continuous increase of network scale makes centralized SDN unable to meet network requirements, so distributed SDN comes into being. The application of the optimization algorithm to solve the Controller Placement Problem (CPP) can improve the performance of distributed SDN. The meta-heuristic algorithm has been widely concerned because it is not easy to fall into the local optimal solution. Based on the advantages of meta-heuristic algorithm, this paper uses the multi-point replacement method and the two-point replacement method which have low complexity to discretization African Vultures Optimization Algorithm (AVOA) in the search and development stages respectively to solve CPP in SDN. In addition, the performance of the improved optimization algorithm is compared with other algorithms on three real SDN topologies of different scales. The research results show that compared with other six latest meta-heuristic algorithms, the improved optimization algorithm in this paper can obtain the lowest average delay between the controller and switch in the shortest time. Compared with PHCPA with the best performance, IAVOA proposed in this paper improves the convergence speed of 38.16%. [ABSTRACT FROM AUTHOR]

The DC circuit breaker is a crucial equipment for eliminating faults in DC transmission lines. The electromagnetic release functions as a critical component that restricts the circuit breaker's lifespan. It is essential to prioritize its safety and reliability during usage and predicting its remaining useful life (RUL) is paramount. This paper proposes a new prediction technique based on particle filtering (PF) and the whale optimization algorithm (WOA) for the remaining useful life of electromagnetic release. The particle filtering algorithm is a commonly used technique in practical engineering fields such as target tracking and RUL prediction. It is a mainstream method for solving the parameter estimation of non-linear non-Gaussian systems. The WOA is introduced to improve the PF algorithm in order to ensure the diversity of particles and lessen the effect of particle degradation. The WOA replaces the traditional resampling process, and after each computation is finished, the weights of the particles in the particle set are reassigned in order to improve the particle distribution and increase algorithm accuracy. The rate of loss of the spring reaction force and the striker counterforce are chosen as the degradation characteristics after the degradation factors of electromagnetic release are analyzed. The degradation curves at different temperatures of electromagnetic release are obtained using the accelerated life test, and the full-life data during normal operation are derived using the Arrhenius equation. Finally, the RUL is predicted by comparing this paper's method with the conventional PF method. The experimental results demonstrate that the method presented in this paper can more accurately predict the RUL of the electromagnetic release and has a higher prediction accuracy. [ABSTRACT FROM AUTHOR]

The transformer is a fundamental piece of equipment for power grids. The analysis and optimization of their life-cycle costs are of great importance to reinforce the economic efficiency of electrical networks. This paper constructs a comprehensive transformer life-cycle cost (LCC) model by fusing life-cycle cost theory with relevant transformer expenditure. It proceeds to examine the life-cycle cost aspects of the transformer, delving into its cost dynamics under various influencing factors, establishing interconnections between these factors and analyzing the cost relationship. By employing MATLAB software (Matlab 2021a) along with the whale optimization algorithm (WOA) this paper optimizes the objective function. Through this, it establishes the LCC model for 20 power transformers, obtaining the optimal objective function curve and the maximum value for LCC optimization of the transformer. Unlike previous research, this study adds a detailed analysis of several factors that influence LCC. At the same time, it develops a more complete, scientific and rational LCC optimization model. An illustrative example validates the model and the superiority of the whale optimization algorithm. The algorithm not only shows its scientific basis and superiority, but also serves as a guiding mechanism for LCC management in transformer engineering practices. Ultimately, it emerges as a fundamental tool to improve the efficiency of power grid asset management. [ABSTRACT FROM AUTHOR]

This document discusses the challenges of achieving high-power quality in modern power grids with a large share of distributed power production, particularly due to the integration of renewable energy sources (RES). The variable nature of RES can lead to disturbances and power quality degradation. The document highlights the importance of voltage source converters and control systems in enabling the flexible operation of RES. It also mentions the concept of microgrids, which are closely connected to power quality and other factors such as the Internet of Things and cyber security. The document includes eight research papers covering various topics related to power quality analysis and control of renewable energy sources in power grids. These topics include power factor correction, supercapacitor parameters identification, pulse width modulation, disturbance analysis, vibration analysis of motors, control of converters, phasor measurement units, and optimization of controller parameters. The document concludes by expressing gratitude to the authors, staff, and reviewers involved in the research papers. [Extracted from the article]

The necessity of employing renewable energy sources within microgrid-based Power-to-X (P2X) systems has been emphasized by the imperatives of reducing global warming and fossil fuel consumption. Due to their numerous advantages, solar and wind energy have acquired prominence in contemporary power systems. However, their intermittent nature presents challenges. To overcome these challenges, energy storage devices are utilized. Batteries, however, are plagued by issues such as high maintenance needs, self-discharge, and diminishing storage capacity with age. Consequently, investigating alternatives such as hydrogen storage has become a financially viable option, especially for high-power applications. However, the intrinsically slow dynamics of hydrogen production from electricity contrast with the rapid responses of contemporary power electronic devices. This paper presents a versatile technique for optimizing hydrogen production in the presence of stochastic fluctuations in solar irradiance and wind speed. The proposed method combines a modified version of the Symbiotic Differential Whale Optimization Algorithm (m-SDWOA) with power converters to maximize production from renewable sources and electrolyzers. Using extensive simulations to demonstrate the efficacy of the proposed method by comparing its performance to that of the Whale Optimization Algorithm (WOA) and Particle Swarm Optimization (PSO). The results demonstrate the superior performance of the m-SDWOA-integrated method and pave the way for improved hydrogen generation in microgrid-based P2X systems. • Innovative control framework coordinates WT, PV, BESS, and HESS. • Maximizes hydrogen production while maintaining power quality. • Efficient controllers stabilize DC-bus voltage amidst WT/PV variability. • Ensures consistent, reliable power supply in microgrid. • Efficient energy management via m-SDWOA for resource optimization. [ABSTRACT FROM AUTHOR]

Harris Hawks optimization (HHO) algorithm was a powerful metaheuristic algorithm for solving complex problems. However, HHO could easily fall within the local minimum. In this paper, we proposed an improved Harris Hawks optimization (IHHO) algorithm for solving different engineering tasks. The proposed algorithm focused on random location-based habitats during the exploration phase and on strategies 1, 3, and 4 during the exploitation phase. The proposed modified Harris hawks in the wild would change their perch strategy and chasing pattern according to updates in both the exploration and exploitation phases. To avoid being stuck in a local solution, random values were generated using logarithms and exponentials to explore new regions more quickly and locations. To evaluate the performance of the proposed algorithm, IHHO was compared to other five recent algorithms [grey wolf optimization, BAT algorithm, teaching–learning-based optimization, moth-flame optimization, and whale optimization algorithm] as well as three other modifications of HHO (BHHO, LogHHO, and MHHO). These optimizers had been applied to different benchmarks, namely standard benchmarks, CEC2017, CEC2019, CEC2020, and other 52 standard benchmark functions. Moreover, six classical real-world engineering problems were tested against the IHHO to prove the efficiency of the proposed algorithm. The numerical results showed the superiority of the proposed algorithm IHHO against other algorithms, which was proved visually using different convergence curves. Friedman's mean rank statistical test was also inducted to calculate the rank of IHHO against other algorithms. The results of the Friedman test indicated that the proposed algorithm was ranked first as compared to the other algorithms as well as three other modifications of HHO. [ABSTRACT FROM AUTHOR]

Swarm intelligence (SI) algorithms represent a class of Artificial Intelligence (AI) optimization metaheuristics used for solving complex optimization problems. However, a key challenge in solving complex problems is maintaining the balance between exploration and exploitation to find the optimal global solution and avoid local minima. This paper proposes an innovative Swarm Intelligence (SI) algorithm called the Four Vector Intelligent Metaheuristic (FVIM) to address the aforementioned problem. FVIM's search strategy is guided by four top-performing leaders within a swarm, ensuring a balanced exploration-exploitation trade-off in the search space, avoiding local minima, and mitigating low convergence issues. The efficacy of FVIM is evaluated through extensive experiments conducted over two datasets, incorporating both qualitative and quantitative statistical measurements. One dataset contains twenty-three well-known single-objective optimization functions, such as fixed-dimensional and multi-modal functions, while the other dataset comprises the CEC2017 functions. Additionally, the Wilcoxon test was computed to validate the result's significance. The results illustrate FVIM's effectiveness in addressing diverse optimization challenges. Moreover, FVIM has been successfully applied to tackle engineering design problems, such as weld beam and truss engineering design. [ABSTRACT FROM AUTHOR]

The optimal foraging algorithm (OFA) is a swarm-based algorithm motivated by animal behavioral ecology theory. When solving complex optimization problems characterized by multiple peaks, OFA is easy to get trapped in local minima and encounters slow convergence. Therefore, this paper presents an improved optimal foraging algorithm with social behavior based on quasi-opposition (QOS-OFA) to address these problems. First, quasi-opposition-based learning (QOBL) is introduced to improve the overall quality of the population in the initialization phase. Second, an efficient cosine-based scale factor is designed to accelerate the exploration of the search space. Third, a new search strategy with social behavior is designed to enhance local exploitation. The cosine-based scale factor is used as a regulator to achieve a balance between global exploration and local exploitation. The proposed QOS-OFA is compared with seven meta-heuristic algorithms on a CEC benchmark test suite and three real-world optimization problems. The experimental results show that QOS-OFA is better than other competitors on most of the test problems. [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]

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 purpose of this paper is to test the performance of the recently proposed weighted superposition attraction-repulsion algorithms (WSA and WSAR) on unconstrained continuous optimization test problems and constrained optimization problems. WSAR is a successor of weighted superposition attraction algorithm (WSA). WSAR is established upon the superposition principle from physics and mimics attractive and repulsive movements of solution agents (vectors). Differently from the WSA, WSAR also considers repulsive movements with updated solution move equations. WSAR requires very few algorithm-specific parameters to be set and has good convergence and searching capability. Through extensive computational tests on many benchmark problems including CEC’2015 and CEC’2020 performance of the WSAR is compared against WSA and other metaheuristic algorithms. It is statistically shown that the WSAR algorithm is able to produce good and competitive results in comparison to its predecessor WSA and other metaheuristic algorithms. [ABSTRACT FROM AUTHOR]

Deep learning, a subset of machine learning that utilizes neural networks, has seen significant advancements in recent years. These advancements have led to breakthroughs in a wide range of fields, from natural language processing to computer vision, and have the potential to revolutionize many industries or organizations. They have also demonstrated exceptional performance in the identification and mapping of seagrass images. However, these deep learning models, particularly the popular Convolutional Neural Networks (CNNs) require architectural engineering and hyperparameter tuning. This paper proposes a Deep Neuroevolutionary (DNE) model that can automate the architectural engineering and hyperparameter tuning of CNNs models by developing and using a novel metaheuristic algorithm, named 'Boosted Atomic Orbital Search (BAOS)'. The proposed BAOS is an improved version of the recently proposed Atomic Orbital Search (AOS) algorithm which is based on the principle of atomic model and quantum mechanics. The proposed algorithm leverages the power of the Lévy flight technique to boost the performance of the AOS algorithm. The proposed DNE algorithm (BAOS-CNN) is trained, evaluated and compared with six popular optimisation algorithms on a patch-based multi-species seagrass dataset. This proposed BAOS-CNN model achieves the highest overall accuracy (97.48%) among the seven evolutionary-based CNN models. The proposed model also achieves the state-of-the-art overall accuracy of 92.30% and 93.5% on the publicly available four classes and five classes version of the 'DeepSeagrass' dataset, respectively. This multi-species seagrass dataset is available at: https://ro.ecu.edu.au/datasets/141/. [ABSTRACT FROM AUTHOR]

This paper presents a novel hybrid optimization method to solve the resource allocation problem for multi-target multi-sensor tracking of drones. This hybrid approach, the Improved Prairie Dog Optimization Algorithm (IPDOA) with the Genetic Algorithm (GA), utilizes the strengths of both algorithms to improve the overall optimization performance. The goal is to select a set of sensors based on norms of weighted distances cost function. The norms are the Euclidean distance and the Mahalanobis distance between the drone location and the sensors. The second one depends on the predicted covariance of the tracker. The Extended Kalman Filter (EKF) is used for state estimation with proper clutter and detection models. Since we use Multi-objects to track, the Joint Probability Distribution Function (JPDA) estimates the best measurement values with a preset gating threshold. The goal is to find a sensor or minimum set of sensors that would be enough to generate high-quality tracking based on optimum resource allocation. In the experimentation simulated with Stone Soup, one radar among five radars is selected at every time step of 50-time steps for 200 tracks distributed over 20 different ground truths. The proposed IPDOA provided optimum solutions for this complex problem. The obtained solution is an optimum offline solution that is used to select one or more sensors for any future flights within the vicinity of the 5 radars. Environment and conditions are assumed to be similar in future drone flights within the radars' defined zone. The IPDOA performance was compared with the other 8 metaheuristic optimization algorithms and the testing showed its superiority over those techniques for solving this complex problem. The proposed simulated model can find the most relevant sensor(s) capable of generating the best quality tracks based on weighted distance criteria (Euclidean and Mahalanobis). That would cut down the cost of operating extra sensors and then it would be possible to move them to other vicinity. [ABSTRACT FROM AUTHOR]

The growing use of hydrogen as an energy carrier in the context of a renewed energy landscape is showing very promising potential. Most notably, polymer electrolyte membrane fuel cells (PEMFCs) are at the heart of the energy revolution and provide an efficient alternative to fossil fuels. The need for accurate modeling to analyze and develop the performance of PEMFCs has prompted many researchers to make major efforts in this area. This paper proposes a new approach based on an enhanced version of the bio-inspired metaheuristic salp swarm algorithm (ESSA) to identify the unknown parameters of the PEMFC model. This innovative approach was implemented by the combination of the merits of four approaches, namely the opposition-based learning, the new category of salps, referred to as exploration salps, the crossover and mutation operators, and the survival of the fittest mechanism. The newly introduced mechanisms succeed to overcome the problem of low population diversity of the SSA algorithm, accelerate its speed of convergence, strengthen the salp exploration capabilities, and improve its convergence accuracy. The performance of this technique has been tested and validated experimentally on the voltage–current characteristic on two commercial PEMFC stacks, such as 250 W and BCS500 W. The found results are compared to those of the original SSA and six recently published competitive metaheuristic algorithms simulated in various conditions as well as nine other well-cited methods from the literature. The performance comparison involved the calculation of the sum of squared errors (SSE), Standard Deviation (STD), computational speed, and statistical measurements. In this context, the best SSE and STD values obtained for Case I range 2 were 0.60132 and 1.0597 E − 14 , while those of Case II were 0.01167 and 1.1127E−15, respectively. Based on the results, the ESSA-based approach demonstrates superior performance in determining PEMFC parameters from experimental measurements, offering enhanced stability, faster convergence speed, and greater accuracy. This method thus emerges as a highly promising avenue for PEMFC parameter estimation, providing a valuable tool for optimizing fuel cell performance and design. • Modeling and parameter extraction methods for PEMFC models are investigated. • A new ESSA is proposed to tackle the parameterization problem of PEMFC. • ESSA uses OBL, exploration salps, crossover and mutation operators, and survival of the fittest mechanism. • Experimental tests show ESSA's best accuracy, convergence speed, and stability for 250 W and BCS500 W PEMFC. • ESSA is useful to develop precise simulators, and master PEMFC design and control. [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]

Maintaining stability in modern power systems is challenging due to complex structures, rising power demand, and load disturbances. The integration of renewable energy sources further threatens stability by causing imbalances between generation and demand. Conventional load frequency stabilization methods fall short in such scenarios. This paper proposes an optimal fractional‐order proportional‐integral‐derivative‐acceleration (FOPIDA) controller, enhanced by a robust adaptive neuro‐fuzzy inference system (ANFIS), to improve load frequency control and reliability in power systems with wind and solar generators. First, the dynamical model of a multi‐area interconnected power system, including a thermal power plant, wind turbine, and solar photovoltaic generators, is developed. A decentralized ANFIS‐FOPIDA controller is then designed for load frequency control objectives. The gains of this controller are optimized using the whale optimization algorithm (WOA), focusing on frequency deviation and tie‐line power exchange. Simulations on a New England IEEE 10‐generator 39‐bus power system demonstrate the approach's effectiveness under various disturbances, including random load‐generation disturbances and nonlinear generation behaviors. Comparisons with other strategies, such as fractional order (FO) beetle swarm optimization algorithm (FOBSOA)‐FOPIDA, WOA‐PIDA, and WOA‐ANFIS‐PIDA, and recent control approaches highlight the superior performance of the WOA‐ANFIS‐FOPIDA method in enhancing power system stability. [ABSTRACT FROM AUTHOR]

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

In order to adapt to the changing and personalized market demand, the traditional single-type mass production manufacturing mode is gradually changing to multi-species small batch personalized custom production, flexible manufacturing in machinery manufacturing occupies an increasingly important position. However, complexity, uncertainty, multi-objective and multi-constraints are the problems faced by production scheduling in flexible manufacturing workshop, which restricts the intelligent transformation of enterprises. This paper takes an assembly shop as the research object, and carries out research on assembly line balancing and multi-automatic guided vehicle (AGV) scheduling problems in shop production. Firstly, for the multi-objective assembly line balancing problem with fluctuating demand, the relevant assembly line model is established by changing only the number of workstations and replanning the boundary, and an improved multi-objective whale optimization algorithm is proposed to reduce the rebalancing cost of the assembly line. Secondly, the multi-AGV dynamic scheduling problem with corresponding scheduling objective weights according to the current number of AGVs is analyzed, and a mathematical model is established to maximize the value of the objective function by considering a variety of factors under the premise of meeting the production requirements of the assembly line. Then, a scheduling rule selection method based on neural network and knowledge base is proposed to determine the optimal combination of scheduling rules for different system states. Finally, a simulation analysis of an assembly workshop example is carried out to verify the feasibility and effectiveness of the proposed method in solving the assembly line balancing problem and the multi-AGV scheduling problem, which improves the manufacturing efficiency and the resilience of the workshop. [ABSTRACT FROM AUTHOR]

Over the last decade, dual active bridge (DAB) converters have become critical components in high-frequency power conversion systems. Recently, intensive efforts have been directed at optimizing DAB converter design and control. In particular, several strategies have been proposed to improve the performance of DAB control systems. For example, fractional-order (FO) control methods have proven potential in several applications since they offer improved controllability, flexibility, and robustness. However, the FO controller design process is critical for industrializing their use. Conventional FO control design methods use frequency domain-based design schemes, which result in complex and impractical designs. In addition, several nonlinear equations need to be solved to determine the optimum parameters. Currently, metaheuristic algorithms are used to design FO controllers due to their effectiveness in improving system performance and their ability to simultaneously tune possible design parameters. Moreover, metaheuristic algorithms do not require precise and detailed knowledge of the controlled system model. In this paper, a hybrid algorithm based on the chaotic artificial ecosystem-based optimization (AEO) and manta-ray foraging optimization (MRFO) algorithms is proposed with the aim of combining the best features of each. Unlike the conventional MRFO method, the newly proposed hybrid AEO-CMRFO algorithm enables the use of chaotic maps and weighting factors. Moreover, the AEO and CMRFO hybridization process enables better convergence performance and the avoidance of local optima. Therefore, superior FO controller performance was achieved compared to traditional control design methods and other studied metaheuristic algorithms. An exhaustive study is provided, and the proposed control method was compared with traditional control methods to verify its advantages and superiority. [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]

Diabetes is a chronic disease that is usually caused when the pancreas fails to produce sufficient insulin or when the body is unable to effectively utilize the insulin produced by the pancreas. Early detection of diabetes enables the implementation of a suitable treatment method, which can lead to a healthy lifestyle. A necessity arises for an automated system capable of diagnosing diabetes using clinical and physical data in cases when the conventional approach to detecting diabetes proves to be arduous. In this paper, a new diabetes classification model based on optimized long short-term memory (LSTM) is presented and evaluated on the Pima Indians Diabetes Database (PIDD). To improve the LSTM model, a novel hybrid waterwheel plant and stochastic fractal search (WWPASFS) is proposed for optimizing its parameters. To confirm the performance superiority of the proposed WWPASFS + LSTM model, it is compared to various machine learning models and metaheuristic optimization methods. In addition, the binary WWPASFS is proposed to extract the relevant features in the PIDD dataset, with the aim of improving the accurate classification of diabetes patients. The WWPASFS + LSTM model attained the highest accuracy of 98.2% in classifying diabetes patients on the dataset in hand. The WWPASFS + LSTM model exhibited superior performance compared to the other five models, namely decision tree, K-nearest neighbors, neural networks, random forest, and support vector machines. On the other hand, the statistical analysis of the proposed approach is studied and the results prove its difference and significance. [ABSTRACT FROM AUTHOR]

Cloud data centers face various challenges, such as high energy consumption, environmental impact, and quality of service (QoS) requirements. Dynamic virtual machine (VM) consolidation is an effective approach to address these challenges, but it is a complex optimization problem that involves trade-offs between energy efficiency and QoS satisfaction. Moreover, the workload patterns in cloud data centers are often non-stationary and unpredictable, which makes it difficult to model them. In this paper, we propose a new method for dynamic VM consolidation that optimizes both energy efficiency and QoS objectives. Our approach is based on Markov chains and the artificial feeding birds (AFB) algorithm. Markov chains are used to model the resource utilization of each individual VM and PM based on the changes that happen in workload data. AFB algorithm is a metaheuristic optimization technique that mimics the behavior of birds in nature. We modify the AFB algorithm to suit the characteristics of the VM placement problem and to provide QoS-aware and energy-efficient solutions. Our approach also employs an online step detection method to capture variations in workload patterns. Furthermore, we introduce a new policy for VM selection from overloaded hosts, which considers the abrupt changes in the utilization processes of the VMs. The proposed algorithms are evaluated extensively using the CloudSim Toolkit with real workload data. The proposed system outperforms evaluation policies in multiple metrics, including energy consumption, SLA violations, and other essential metrics. [ABSTRACT FROM AUTHOR]