Search

Renewable energy is undergoing significant advancements through the utilization of new technologies. Among these technologies, fixed solar panels serve as a fundamental type of solar photovoltaic energy generator. Monitoring and optimizing the performance of these panels is achieved through the implementation of controller algorithms. However, there is a growing emphasis on axis tracking systems for solar panels, as that has the feasible to extract more power compared to fixed panels. In this context, the integration of the Internet of Things (IoT), big data analytics, deep learning, and cloud computing presents a contemporary solution for addressing various challenges associated with monitoring renewable solar energy systems. By employing sensors and actuators grouped within an IoT framework, real-time data can be extracted and stored in a cloud server, allowing remote access from anywhere. Furthermore, the use of meta-heuristic optimization algorithms, such as the Whale Optimization Algorithm, has become commonplace in solving engineering issues. In this proposed system, the performance of horizontal axis trackers is analyzed and compared with fixed panels using the WOA-based axis tracking analysis. Through the application of a control algorithm, optimal values can be obtained under typical weather conditions. The system's simulation and performance are thoroughly assessed and evaluated. [ABSTRACT FROM AUTHOR]

There are two problems in the development of swarm-based metaheuristic. First, there are not any metaheuristic is able to solve all problems superiorly. Second, the cross-dimension mapping between the entity and its reference during performing the directed search is rare to find. Based on these problems, this work introduces a new metaphorfree swarm-based metaheuristic called the triple-shake algorithm (TSA). As its name suggests, TSA consists of three directed searches. The reference in the first search is the balance mixture between the finest entity and the member of permutation set. The reference in the second search is the balance mixture between the finest entity and a randomly chosen entity. The reference in the third search is the finest entity only. But the cross-dimension mapping is performed in this third search with 50 percent probability. In the benchmark assessment, TSA is compared with zebra optimization algorithm (ZOA), walrus optimization algorithm (WaOA), migration algorithm (MA), total interaction algorithm (TIA), and one-toone based optimization (OOBO). The result indicates the dominance of TSA among its comparators. TSA is better than ZOA, WaOA, MA, TIA, and OOBO in 21, 19, 17, 19, and 22 functions consecutively out of 23 functions. [ABSTRACT FROM AUTHOR]

The no-free-lunch (NFL) theory has become the main reason of developing new metaheuristics in decades. Besides, the strict dimension mapping has been implemented in many population-based metaheuristics, especially the swarm-based metaheuristics. Regarding this problem, this paper proposes a new swarm-based metaheuristics called focus and shake algorithm (FSA). FSA has novel approach in the dimension mapping between the agent and its reference during the directed motion. It combines the strict dimension mapping called as focus approach and the randomized dimension mapping called as shake approach to enhance its exploration ability. FSA deploys two directed motions based on two references. The first reference is constructed based on the balance mixture between two finer agents while the second reference is constructed based on the balance mixture of the finest agent and a randomly picked agent. In the competing assessment, FSA competes with five brand new swarm-based metaheuristics: migration algorithm (MA), total interaction algorithm (TIA), lyrebird optimization algorithm (LOA), osprey optimization algorithm (OOA), and kookaburra optimization algorithm (KOA). The result exhibits that FSA is finer than MA, TIA, LOA, OOA, and KOA in 19, 21, 21, 19, and 20 functions out of 23 functions respectively. The result also shows that the superiority of FSA takes place in both unimodal and multimodal problems. In the future, the cross-dimension mapping can be more explored to develop finer swarm-based metaheuristics. [ABSTRACT FROM AUTHOR]

This paper introduces a novel metaheuristic named the stochastic shaking algorithm (SSA), which is rooted in swarm intelligence principles. The innovation lies in its unique utilization of iteration for selecting references during guided searches through a stochastic approach. The optimization process involves two sequential steps: the primary reference in the first step is the finest swarm member, while in the second step, it is the mean of all finer swarm members plus the finest one. This primary reference is then combined with a randomly chosen solution within the space, serving as the secondary reference. SSA undergoes evaluation in two contexts. The first involves assessing its performance using a set of 23 classic functions as a theoretical use case. The second involves tackling the economic load dispatch problem (ELD), a practical use case featuring a system with 13 generators of various energy resources. The study compares SSA against five other metaheuristics--One to One Based Optimization (OOBO), Kookaburra Optimization Algorithm (KOA), Language Education Optimization (LEO), Total Interaction Algorithm (TIA), and Walrus Optimization Algorithm (WaOA). Results indicate SSA's superiority over OOBO, KOA, LEO, TIA, and WaOA in 21, 13, 11, 16, and 14 functions out of 23 functions, respectively. Additionally, the evaluation of the economic load dispatch problem reveals intense competition among the six metaheuristics. [ABSTRACT FROM AUTHOR]

Time‐delayed systems frequently appear, especially in sectors such as fluid flow processes, chemical procedures, and the food industry. This paper addresses the optimization of parameters for a fractional order PID (FOPID) controller, which is used to control a time‐delayed system, using five distinct algorithms inspired by nature. These algorithms are NewBAT, Cuckoo search (CS), Firefly (FF), Gray Wolf Optimizer (GWO), and Whale optimization algorithm (WOA). The FOPID controller parameters, namely KP, KI, KD, λ and μ, have been optimized using these algorithms. During the optimization process, the integral of the time absolute error (ITAE) was considered as the primary measurement criterion. In addition to this value, the maximum overshoot, settling time, time to reach the maximum value, and error values were examined. Simulations conducted with the obtained parameters tested the system's resilience to disturbances introduced at the output, and the controller responses were also evaluated during these tests. The reactions of the determined parameters to different reference inputs were analyzed, and the results are presented in graphs and tables. The efficiency and reliability of the optimization algorithms were substantiated by comprehensive statistical analyses. These analyses play a critical role in algorithm selection and objective evaluation of the results. Simulation studies were conducted in the Matlab and Simulink environments. The FOMCON Toolbox was used for fractional‐order processes. [ABSTRACT FROM AUTHOR]

Let N = {n1, n2, ..., nk} be a finite set of positive numbers. The problem of finding the minimal number of additions required to compute all elements of N starting from 1 (called the addition sequence problem) is NP-complete. It is equivalent to finding the minimum number of multiplications needed to compute a group exponentiation gn1, gn2, ..., gnk, where g is an element in a group. This paper aims to propose a new metaheuristic algorithm using a simulated annealing strategy to generate a short addition sequence. The performance of the proposed algorithm is measured by considering two parameters: The size of N and the domain of ni,1 ≤ i ≤ k. The proposed algorithm is a new trade-off between the length of the generated addition sequence and the average running time of generating addition sequences. It sometimes produces longer addition sequences than exact algorithms that are slower, and it is slower than suboptimal algorithms that produce longer addition sequences. [ABSTRACT FROM AUTHOR]

Meta-heuristic algorithms have great role in solving problems related to optimization. Meta-heuristic method cannot solve problems related to optimization due to No Free Lunch theory. Hence different optimization methods are proposed by various researchers each year in order to solve optimization problems. Forest Optimization Algorithm (FOA) is an evolutionary optimization algorithm that is appropriate for continuous nonlinear optimization problems. The algorithm drawbacks include entrapment in local optimum and failure in achieving global optimum. The paper proposes hybrid algorithm called FOAGSA, in which the Gravitational Search Algorithm (GSA) is employed to improve the FOA performance in order to solve nonlinear continuous problems. The FOAGSA was evaluated through 39 benchmark optimization functions and two engineering problems. The experimental results proved that the FOAGSA exhibited acceptable results compared to state-of-art and well-known Meta-heuristic algorithms. Friedman ranking algorithm was utilized to compare FOAGSA with existing methods. The FOAGSA was ranked first on that basis. [ABSTRACT FROM AUTHOR]

Supply Chain (SC) Optimization is a key activity in today's industry with the goal of increasing operational efficiency, reducing costs, and improving customer satisfaction. Traditional optimization methods often struggle to effectively use resources while handling complex and dynamic Supply chain networks. This paper introduces a novel biomimetic metaheuristic algorithm called the Wombat Optimization Algorithm (WOA) for supply chain optimization. This algorithm replicates the natural behaviors observed in wombats living in the wild, particularly focusing on their foraging tactics and evasive maneuvers towards predators. The theory of WOA is described and then mathematically modeled in two phases: (i) exploration based on the simulation of wombat movements during foraging and trying to find food and (ii) exploitation based on simulating wombat movements when diving towards nearby tunnels to defend against its predators. The effectiveness of WOA in addressing optimization challenges is assessed by handling the CEC 2017 test suite across various problem dimensions, including 10, 30, 50, and 100. The findings of the optimization indicate that WOA demonstrates a strong ability to effectively manage exploration and exploitation, and maintains a balance between them throughout the search phase to deliver optimal solutions for optimization problems. A total of twelve well-known metaheuristic algorithms are called upon to test their performance against WOA in the optimization process. The outcomes of the simulations reveal that WOA outperforms the other algorithms, achieving superior results across most benchmark functions and securing the top ranking as the most efficient optimizer. Using a Wilcoxon rank sum test statistical analysis, it has been proven that WOA outperforms other algorithms significantly. WOA is put to the test with twenty-two constrained optimization problems from the CEC 2011 test suite and four engineering design problems to showcase its ability to solve real-world optimization problems. The results of the simulations demonstrate that WOA excels in real-world applications by delivering superior solutions and outperforming its competitors. [ABSTRACT FROM AUTHOR]

Structural engineering is a field with several optimization approaches. Concordantly, the goal in optimum design is the generation of the lightest, cheapest, or most sustainable engineering design for any type of structure or structural member. In this study, some optimization approaches were presented for structures including 25 and 72-bar space trusses. To find the smallest weights were ensured for both structures. Optimization approaches related to metaheuristics and modifications of them were developed by inspired by features of nature, abilities of lives and mechanisms of chemical/physical processes. The employed three techniques that are flower pollination algorithm, Jaya algorithm and the hybrid algorithm developed via them were compared to each other through some parameters by calculating different statistical expressions containing the best, average and standard deviation of the objective function. Also, the performance of whole metaheuristic versions is evaluated with some literature researches to find the most effective one to minimize the structural weights. These results have observed that the all versions of proposed metaheuristic algorithms are generally successful, and effective to minimize the objective function comparison to algorithms used in previous studies. Moreover, the best values of objective functions can be decreased at the 0.02–0.06 rates as minimum and maximum compared to the previous studies and algorithms, respectively. [ABSTRACT FROM AUTHOR]

In recent years, a few studies have been working on the optimization of 3D reinforced concrete structures. The number of research on this subject is increasing day by day. However, in these studies, the real world-structure is generally not used; moreover, only regular structures are used, and RC shear walls do not continue on all floors. Therefore, 3D evaluation of the optimization of real-world RC structures is possible for a small number of building types. There is a need for 3D optimization studies that can be used for all building types. In this study, 3D optimization of a real-world reinforced concrete structure is carried out. The sample structure used in the paper is not only a regular reinforced concrete-framed structure, unlike other studies, but also a RC framed structure with RC shear walls continuing on each floor. In the numerical example, the effect of the RC shear walls continuing on each floor is applied in the analysis, and the design processes of the construction projects on a real-world building and the quantity-cost analysis are made together. All optimization processes are directed automatically using the ACDOS programming, which is developed by the authors. ACDOS can take into account the commercial program named Etabs to make design of construction and the metaheuristic algorithms to reduce the total cost of construction. The results obtained from this study showed that the cost (concrete-rebar-formwork) of the 7-story public dormitory building was reduced by 9.18% when compared with its real-world application. [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]

Excessive time-consuming has been a great problem when applying metaheuristic algorithms to the optimization of structures using direct analyses, including steel truss structures. In this work, a robust optimization method was proposed to solve this issue. In the proposed method, an efficient variant of the differential evolution algorithm (DE), which was proved to be powerful in searching optimum designs and converged quickly, was employed as the optimizer. An effective framework based on LightGBM classification models was developed to save lots of time-consuming direct analyses required for evaluating constraints. To enhance the performance of LightGBM models, an adaptive parameter, which can reflect the convergence speed of the population, was proposed to prevent the imbalanced classification problem in the training data. Two truss optimizations with continuous design variables were studied, including a 47-bar power line and a 113-bar planar bridge. The results proved that the proposed method yielded better optimum designs than DE/best/1 and EpDE. It also saved more than 60% of time-computing compared to DE/best/1, EpDE, and 2EpDE. Besides that, the proposed framework for using LightGBM models was compatible with metaheuristics having different convergence rates, including DE/best/1, EpDE, and 2EpDE. [ABSTRACT FROM AUTHOR]

A new swarm-based metaheuristic that is also enriched with the crossover technique called swarm flip-crossover algorithm (SFCA) is introduced in this work. SFCA uses swarm intelligence as its primary technique and the crossover as its secondary one. It consists of three searches in every iteration. The swarm member walks toward the best member as the first search. The central point of the swarm becomes the target in the second search. There are two walks in the second search. The first walk is getting closer to the target, while the second is avoiding the target. The better result between these two walks becomes the candidate for the replacement. In the third search, the swarm member performs balance arithmetic crossover with the central point of the space or jumps to the opposite location within the area (flipping). The assessment is taken by confronting SFCA with five new metaheuristics: slime mold algorithm (SMA), golden search optimization (GSO), osprey optimization algorithm (OOA), coati optimization algorithm (COA), and walrus optimization algorithm (WaOA) in handling the set of 23 functions. The result shows that SFCA performs consecutively better than SMA, GSO, OOA, COA, and WaOA in 20, 23, 17, 17, and 17 functions. [ABSTRACT FROM AUTHOR]

Nowadays, the speed of solving optimization problems by increasing various issues and the number of variables is critical. The Harris Hawk optimization method is a brand-new, intelligent system that resolves optimization issues by mathematically simulating the natural behavior of hawks. In this study, the Harris Hawks optimization method and the Laplace crossover operator are merged, and a new enhanced Harris Hawks algorithm (LX-HHO) based on the Laplace optimization algorithm is suggested. The purpose of improving this algorithm is to increase the convergence speed while maintaining good accuracy in achieving the optimal solution. The results of the proposed method on the test functions demonstrate that the algorithm has achieved faster convergence than the original version of the Harris Hawks algorithm and other meta-heuristic algorithms. This is due to the algorithm's accuracy in obtaining the best answer in these functions and to a reduction in the evaluation of the optimization function. Also, comparing and evaluating the proposed algorithm with other algorithms by Friedman and MAE test shows the superiority of the LX-HHO algorithm. [ABSTRACT FROM AUTHOR]

The automotive sector is experiencing rapid evolution, with the next-generation emphasizing clean energy sources such as fuel-cell hybrid electric vehicles (FCHEVs) due to their energy efficiency, eco-friendliness, and extended driving distance. Implementing effective energy management strategies play a critical role in optimizing power flow and electrical efficiency in these vehicles. This study proposes an optimized energy management strategy (EMS) for FCHEVs. The suggested EMS introduces a hybridization between the equivalent consumption minimization strategy (ECMS) and the Artificial Hummingbird Algorithm (AHA). The Federal Test Procedure for Urban Driving (FTP-75) is employed to evaluate the performance of the proposed EMS. The results are assessed and validated through comparison with outcomes obtained by other algorithms. The findings demonstrate that the proposed EMS surpasses other optimizers in reducing fuel consumption, potentially achieving a 48.62% reduction. Moreover, the suggested EMS also yields a 15.45% increase in overall system efficiency. [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]

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

The role of information and communication technology infrastructure is very crucial and perhaps most important during and post disaster (DPD) scenarios where thousands of lives are at risk. Communication services are expected to operate effectively in such demanding situations with restricted resources while fulfilling their core functionalities. The absence of coordinated cell planning taking the vulnerability of the geographical zone into account is a drawback that inhibits system operations and rescue efforts of public protection and disaster relief (PPDR) units. In this paper, the major issues of cell planning are encountered, and new algorithms for optimum LTE cell planning based on the hybrid dragonfly algorithm with differential evolution (DADE) are proposed under user coverage, user association, and capacity constraints. Thereafter, the feasibility of deployment and operation of an operator-independent emergency system (ES) integrated with balloon-based lightweight LTE eNodeB is analyzed to mitigate the DPD communication challenges. Then evaluate the optimal location for the deployment of ESs to cater to the users under the aforementioned constraint. Finally, optimum cell planning considering the vulnerability of the zone is discussed. The comparative comprehensive analysis of the results shows that the proposed algorithm offers superior convergence characteristics as well as time complexity as compared to the other state-of-the-art algorithms. Comparative results of normalized sum utility depict that the proposed algorithm outperforms the grey wolf optimizer (GWO), salp swarm algorithm (SSA), differential evolution (DE), whale optimization algorithm (WOA), and particle swarm optimization (PSO) based hybrid algorithms, respectively, by 0.5%, 4.3%, 6.5%, 8.6%, and 11.8%. [ABSTRACT FROM AUTHOR]

Sewer systems are a component of city infrastructure that requires large investment in construction and operation. Metaheuristic optimization methods have been used to solve sewer optimization problems. The aim of this study is to investigate the effects of network size on metaheuristic optimization algorithms. Cuckoo Search (CS) and four versions of Grey Wolf Optimization (GWO) were utilized for the hydraulic optimization of sewer networks. The purpose of using different algorithms is to investigate whether the results obtained differ depending on the algorithm. In addition, to eliminate the parameter effect, the relevant algorithms were run with different parameters, such as population size. These algorithms were performed on three different-sized networks, namely small-sized, medium-sized, and large-sized networks. Friedman and Wilcoxon tests were utilized to statistically analyze the results. The results were also evaluated in terms of the optimality gap criterion. According to the results based on the optimality gap, the performance of each algorithm decreases as the network size increases. [ABSTRACT FROM AUTHOR]

Introduction: This study focuses on broadening the applicability of the metaheuristic L1-norm fitted and penalized (L1L1) optimization method in finding a current pattern for multichannel transcranial electrical stimulation (tES). The metaheuristic L1L1 optimization framework defines the tES montage via linear programming by maximizing or minimizing an objective function with respect to a pair of hyperparameters. Methods: In this study, we explore the computational performance and reliability of different optimization packages, algorithms, and search methods in combination with the L1L1 method. The solvers from Matlab R2020b, MOSEK 9.0, Gurobi Optimizer, CVX's SeDuMi 1.3.5, and SDPT3 4.0 were employed to produce feasible results through different linear programming techniques, including Interior-Point (IP), Primal-Simplex (PS), and Dual-Simplex (DS) methods. To solve the metaheuristic optimization task of L1L1, we implement an exhaustive and recursive search along with a well-known heuristic direct search as a reference algorithm. Results: Based on our results, and the given optimization task, Gurobi's IP was, overall, the preferable choice among Interior-Point while MOSEK's PS and DS packages were in the case of Simplex methods. These methods provided substantial computational time efficiency for solving the L1L1 method regardless of the applied search method. Discussion: While the best-performing solvers show that the L1L1 method is suitable for maximizing either focality and intensity, a few of these solvers could not find a bipolar configuration. Part of the discrepancies between these methods can be explained by a different sensitivity with respect to parameter variation or the resolution of the lattice provided. [ABSTRACT FROM AUTHOR]

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

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

In recent years, the Internet of Things (IoT) has grown at an exponential rate, transforming the healthcare business and perhaps leading to the creation of healthcare big data. As a result, there is a requirement to safeguard data from being attacked in order to ensure secure data transfer through the network. Cryptography has been discovered to be a simple and efficient method for safeguarding healthcare big data. At the same time, in cryptography, the best key generation process is viewed as an optimization issue that may be addressed with meta-heuristic algorithms. As a result, the main focus of this research is on the investigation of health care data security in IoT using the ASS-JFO-DHEA model, which combines an innovative hybrid Artificial Shuffle Shepherd Integrated Jellyfish optimization (ASS-JFO) algorithm with Digital Homomorphism Elgamal Algorithm (DHEA) encryption for data security. MATLAB software is used to carry out the execution and experiments for this research. On different benchmark images from a healthcare dataset, the ASS-JFO-DHEA model is experimentally validated. The peak signal to noise ratio, root mean square error, encryption time, mean square error, and other metrics are used to assess the findings.The findings are compared and contrasted as a consequence of this execution, and a variety of encryption algorithms with their optimization techniques from the literature are recognized as having the most intense PSNR values, i.e., 74 dB, generated by the suggested approach. [ABSTRACT FROM AUTHOR]

The potential adverse effects of maize leaf diseases on agricultural productivity highlight the significance of precise disease diagnosis using effective leaf segmentation techniques. In order to improve maize leaf segmentation, especially for maize leaf disease detection, a hybrid optimization method is proposed in this paper. The proposed method provides better segmentation accuracy and outperforms traditional approaches by combining enhanced Particle Swarm Optimisation (PSO) with Firefly algorithm (FFA). Extensive tests on images of maize leaves taken from the Plant Village dataset are used to show the algorithm's superiority. Experimental results show a considerable decrease in Hausdorff distances, indicating better segmentation accuracy than conventional methods. The proposed method also performs better than expected in terms of Jaccard and Dice coefficients, which measure the overlap and similarity between segmented sections. The proposed hybrid optimization method significantly contributes to agricultural research and indicates that the method may be helpful in real scenarios. The performance of proposed method is compared with existing techniques like K-Mean, OTSU, Canny, FuzzyOTSU, PSO and Firefly. The overall performance of the proposed method is satisfactory. [ABSTRACT FROM AUTHOR]

Whenever a new supervised machine learning (ML) algorithm or solution is developed, it is imperative to evaluate the predictive performance it attains for diverse datasets. This is done in order to stress test the strengths and weaknesses of the novel algorithms and provide evidence for situations in which they are most useful. A common practice is to gather some datasets from public benchmark repositories for such an evaluation. But little or no specific criteria are used in the selection of these datasets, which is often ad-hoc. In this paper, the importance of gathering a diverse benchmark of datasets in order to properly evaluate ML models and really understand their capabilities is investigated. Leveraging from meta-learning studies evaluating the diversity of public repositories of datasets, this paper introduces an optimization method to choose varied classification and regression datasets from a pool of candidate datasets. The method is based on maximum coverage, circular packing, and the meta-heuristic Lichtenberg Algorithm for ensuring that diverse datasets able to challenge the ML algorithms more broadly are chosen. The selections were compared experimentally with a random selection of datasets and with clustering by k-medoids and proved to be more effective regarding the diversity of the chosen benchmarks and the ability to challenge the ML algorithms at different levels. [ABSTRACT FROM AUTHOR]

Many recent swarm-based metaheuristics are trapped in the exploitation of the highest quality as the main or the only reference and the neighbourhood search with the reduction of local search space during the iteration. Regarding to this issue, this paper introduces a novel metaheuristic called swarm space hopping algorithm (SSHA). SSHA consists of three searches. First, a directed search toward the highest quality is performed. Second, the directed search toward the resultant of better agents or away from the other agent is performed. Third, the arithmetic crossover between the agent and a randomized solution in the first half or second half of space is performed. In this work, three evaluations are performed to assess the performance of SSHA. The first evaluation is the benchmark evaluation to compare the performance of SSHA with other recent metaheuristics: northern goshawk optimization (NGO), zebra optimization algorithm (ZOA), clouded leopard optimization (CLO), osprey optimization algorithm (OOA), and total interaction algorithm (TIA). The result exhibits that SSHA is better than NGO, ZOA, CLO, OOA, and TIA in 21, 20, 17, 17, and 21 functions. In the second evaluation, the individual search evaluation to compare the contribution between the first and second searches is performed, with the result that the second search outperforms the first search. The third evaluation is performed to assess the contribution of the third search in the optimization process, and the result shows that the contribution of the third search is significant only in three functions. [ABSTRACT FROM AUTHOR]

This paper presents a new metaphor-free metaheuristic search called the swarm bipolar algorithm (SBA). SBA is developed mainly based on the non-free-lunch (NFL) doctrine, which mentions the non-existence of any general optimizer appropriate to answer all varieties of problems. The construction of SBA is based on splitting the swarm into two equal-sized swarms to diversify the searching process while performing intensification within the subswarms. There are two types of finest swarm members: the finest swarm member for the whole swarm and the finest swarm member in every sub-swarm. There are four directed searches performed in every iteration: (1) search toward the finest swarm member, (2) search toward the finest sub-swarm member, (3) search toward the middle between two finest sub-swarm members, and (4) search relative to the randomly picked swarm member from another sub-swarm. The performance of SBA is assessed through two assessments with a set of 23 functions representing the optimization problem. In the benchmark assessment, SBA is contended with five metaheuristics: northern goshawk optimization (NGO), language education optimization (LEO), coati optimization algorithm (COA), fully informed search algorithm (FISA), and total interaction algorithm (TIA). The result presents the superiority of SBA among its contenders by being better than NGO, LEO, COA, FISA, and TIA in 21, 16, 16, 21, and 18 functions. The single search assessment is performed to evaluate each strategy involved in SBA. The result shows that the search toward the middle between the two finest sub-swarm members is the best among the four searches in SBA. [ABSTRACT FROM AUTHOR]

Localization or positioning scheme in Wireless sensor networks (WSNs) is one of the most challenging and fundamental operations in various monitoring or tracking applications because the network deploys a large area and allocates the acquired location information to unknown devices. The metaheuristic approach is one of the most advantageous ways to deal with this challenging issue and overcome the disadvantages of the traditional methods that often suffer from computational time problems and small network deployment scale. This study proposes an enhanced whale optimization algorithm that is an advanced metaheuristic algorithm based on the siege mechanism(SWOA) for node localization in WSN. The objective function is modeled while communicating on localized nodes, considering variables like delay, path loss, energy, and received signal strength. The localization approach also assigns the discovered location data to unidentified devices with the modeled objective function by applying the SWOA algorithm. The experimental analysis is carried out to demonstrate the efficiency of the designed localization scheme in terms of various metrics, e.g., localization errors rate, converges rate, and executed time. Compared experimental-result shows that the SWOA offers the applicability of the developed model for WSN to perform the localization scheme with excellent quality. Significantly, the error and convergence values achieved by the SWOA are less location error, faster in convergence and executed time than the others compared to at least a reduced 1.5% to 4.7% error rate, and quicker by at least 4% and 2% in convergence and executed time, respectively for the experimental scenarios. [ABSTRACT FROM AUTHOR]

Bu çalışmada ilk olarak, betonarme sürekli kirişlerin detaylı tasarımlarının minimum maliyetle yapılabileceği bir süreç tasarlanmıştır. Ardından bu problem üzerinde FDB-TLABC, TLABC, TLBO ve ABC algoritmalarının performansları değerlendirilmiştir. Bu amaçlarla öncelikle Türk betonarme standardı ve deprem yönetmeliği dikkate alınarak optimizasyon problemi oluşturulmuştur. Bir, iki ve üç açıklıklı kiriş örneklerinden oluşan bir problem takımı hazırlanmıştır. Bu problem takımı üzerinde yapılan testlerden algoritmaların optimum sonuca ulaşma performansları ile belirlenen makul çözümlere ulaşma süreleri ve başarıları belirlenmiştir. Optimum sonuca ulaşmada, TLABC ve FDB-TLABC algoritmalarının en başarılı algoritmalar olduğu görülmüştür. Kararlılık analizinden, TLABC algoritmasının en yüksek kararlılığa ve hıza sahip olduğu görülmüştür.

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

This work proposes a novel technique to conduct back‐analysis of lateral displacement of deep cement mixing (DCM) columns in deep excavation construction. For the first time, we propose a process to investigate both soil and underground structure end‐to‐end automatically. The novel technique is a complex combination of three crucial factors: (1) a nature‐inspired optimization algorithm (O), (2) a three‐dimensional PLAXIS Geotechnical Engineering software (P) and (3) a modern Python language programming (P), hereinafter called the a nature‐inspired optimization algorithm (O), a three‐dimensional PLAXIS Geotechnical Engineering software (P) and a modern Python language programming (P) (OPP) technique. The novel meta‐heuristic algorithm simulated the co‐evolved partnership behavior of shrimps and goby fishes, termed Shrimp and Goby Association (SGA), which plays an important role in complex analyses. A series of exams to determine the SGA's performance is conducted on 38 benchmark test functions (IEEE Congress on Evolutionary Computation 2017 and 2019) and three real‐world engineering design problems to showcase its applicability. The metaheuristic and PLAXIS 3D analysis work well together, which makes the back‐analysis technique powerfully to determinate stiffness parameters instead of the traditional approaches. Based on the optimized parameters, the lateral deflection of DCM and soil are well predicted for excavation. This study proposes a technique to estimate efficiently the stiffness parameter for very soft soil. As a consequence of the optimization process, an equation to determine the stiffness parameter of DCM columns from laboratory test is also proposed. Based on the obtained results, this research provides a comprehensive methodology for predicting risk, enhancing safety, saving time and money, and effectively designing and constructing underground structures. [ABSTRACT FROM AUTHOR]

Many new metaheuristic algorithms prioritize their search strategy phase, often neglecting equally critical stages like initialization. Latin hypercube sampling (LHS) is one technique that stands out in this context. LHS selects representative samples through permutations in a multidimensional space, effectively preventing the clustering of points in specific areas. However, its limitations become apparent in high-dimensional problems, as it fails to provide crucial search space information and struggles to determine samples across all dimensions. Addressing these challenges, this paper introduces an innovative population initialization approach, combining the strengths of LHS with evolutionary behaviors. This technique is divided into two main sections: spatial and quality. The spatial section divides the search space into equal intervals across each dimension to establish initial solutions. Meanwhile, the quality section employs evolutionary strategies like mutation and crossover. These strategies serve a dual purpose: they explore the search space thoroughly and refine solutions, bringing them closer to the objective function. To validate the effectiveness of this method, these principles have been integrated it into the classic Differential Evolution algorithm. We conducted extensive tests using 30 representative benchmark functions to assess its performance. The experimental results are encouraging; our methodology not only speeds up convergence but also enhances solution quality, outperforming other similar techniques. [ABSTRACT FROM AUTHOR]

The micro-channel fabrication in carbon fiber-reinforced polymer (CFRP) composite through electrical discharge machining (EDM) process followed by the comprehensive study of dimensional deviation in the conceived micro-channels are presented in this work. The factors namely, voltage (V), tool rotational speed (TRS), and feed rate (FR) were considered for assessing their impact on channel width deviation (CWD). In addition to the variance analysis,, two potential metaheuristic optimizers, the Butterfly optimization algorithm (BOA) and the Spotted Hyena optimization algorithm (SHO) were used to identify the optimal operating parameters of the aforementioned process. The BOA revealed that the optimal process variables were FR = 5.99 µm/s, V = 150 volt, and TRS = 577.08 rpm for a CWD = 74.96 µm. In contrary, SHO revealed that FR = 5.99 µm/s, V = 150 volt, TRS = 542.96 rpm, and CWD = 74.53 µm were the corresponding optimal values. Overcuts were observed in the fabricated micro-channels and a detailed illustration of the mechanism of overcut formation was provided. [ABSTRACT FROM AUTHOR]

Reconfiguration of a distribution network is one of the main approaches to control and enhance distribution network indices, such as voltage profile and power losses. Distribution network operators perform reconfiguration for long-term or short-term periods based on network equipment and intended objectives. Long-term or static reconfiguration is suitable for traditional and modern networks with conventional switches. On the other hand, modern distribution networks that are equipped with one or more remote control switches can perform reconfigurations within short-term periods, to maximize predefined objectives. This paper presents a comprehensive review of recent literature on network reconfiguration. Reconfiguration methodologies are classified into five groups: classical methods, heuristic methods, metaheuristic methods, hybrid methods, and methods based on machine learning. The paper provides a general definition and comparison of the categories and discusses their application in dynamic and static reconfiguration. The paper introduces dynamic reconfiguration as the future challenges in smart and modern distribution networks and for the first time categorizes various methodologies in dynamic reconfiguration. The paper serves as a guide to assist engineers and researchers in selecting the most suitable methodology based on their system equipment and objectives.

Parkinson's disease (PD) is a progressively debilitating neurodegenerative disorder that primarily affects the dopaminergic system in the basal ganglia, impacting millions of individuals globally. The clinical manifestations of the disease include resting tremors, muscle rigidity, bradykinesia, and postural instability. Diagnosis relies mainly on clinical evaluation, lacking reliable diagnostic tests and being inherently imprecise and subjective. Early detection of PD is crucial for initiating treatments that, while unable to cure the chronic condition, can enhance the life quality of patients and alleviate symptoms. This study explores the potential of utilizing long-short term memory neural networks (LSTM) with attention mechanisms to detect Parkinson's disease based on dual-task walking test data. Given that the performance of networks is significantly inductance by architecture and training parameter choices, a modified version of the recently introduced crayfish optimization algorithm (COA) is proposed, specifically tailored to the requirements of this investigation. The proposed optimizer is assessed on a publicly accessible real-world clinical gait in Parkinson's disease dataset, and the results demonstrate its promise, achieving an accuracy of 87.4187 % for the best-constructed models. [ABSTRACT FROM AUTHOR]

In software engineering, the planning and budgeting stages of a software project are of great importance to all stakeholders, including project managers as well as clients. The estimated costs and scheduling time needed to develop any software project before and/or during startup form the basis of a project's success. The main objective of soft- ware estimation techniques is to determine the actual effort and/or time required for project development. The use of machine learning methods to address the estimation problem has, in general, proven remarkably successful for many engineering problems. In this study, a fully connected neural network (FCNN) model and a metaheuristic, gray wolf optimizer (GWO), called GWO-FC, is proposed to tackle the software development effort estimation (SEE) problem. The GWO is integrated with FCNN to optimize the FCNN parameters in order to enhance the accuracy of the obtained results by improving the FCNN's ability to explore the parameter search field and avoid falling into local optima. The proposed technique was evaluated utilizing various benchmark SEE datasets. Furthermore, various recent algorithms from the literature were employed to verify the GWO-FC performance. In terms of accuracy, comparative outcomes reveal that the GWO-FC performs better than other methods in most datasets and evaluation criteria. Experimental outcomes reveal the strong potential of the GWO-FC method to achieve reliable estimation results. [ABSTRACT FROM AUTHOR]

Image enhancement is an essential step in image analysis and processing as it helps people to recognize and understand images because their perception is greatly influenced by image quality. Incomplete beta function (IBF) is a broadly employed transformation function for image contrast enhancement (ICE). However, IBF has low parameter selection efficiency, a limited range of mutable parameters to stretch areas with high or low gray levels, and image enhancement with stretching at both ends is almost ineffectual. In this paper, a hybrid whale optimization algorithm (WOA) with the Chameleon Swarm algorithm (CSA), referred to as HWOA, is presented to adaptively determine the optimal parameters of IBF for ICE. Then, bilateral gamma correction (BGC) is utilized to produce better contrast and brightness while preserving edge detail. The proposed HWOA algorithm follows a multi-phased process of strategies. Many improvements were made to the mathematical model of WOA followed by its hybridization with CSA for further exploration and exploitation aspects. The proposed HWOA is tested over some standard images along with well-known available Kodak image dataset and assessed using several standard measures. The experimental results showed that the proposed algorithm can satisfactorily surpass many other algorithms that used the same image enhancement approach as well as other traditional image enhancement methods deemed here for comparison. Specifically, the findings on ten color images revealed that the performance of HWOA in terms of average peak signal-to-noise ratio, average structural similarity index, and average values of entropy results are more than 33.0, 96.6%, and 7.3, respectively, and these results are much better than all other comparative methods in the corresponding evaluation criteria. [ABSTRACT FROM AUTHOR]

The exploration of premium and new locations is regarded as a fundamental function of every evolutionary algorithm. This is achieved using the crossover and mutation stages of the differential evolution (DE) method. A best-and-worst position-guided novel exploration approach for the DE algorithm is provided in this study. The proposed version, known as "Improved DE with Best and Worst positions (IDEBW)", offers a more advantageous alternative for exploring new locations, either proceeding directly towards the best location or evacuating the worst location. The performance of the proposed IDEBW is investigated and compared with other DE variants and meta-heuristics algorithms based on 42 benchmark functions, including 13 classical and 29 non-traditional IEEE CEC-2017 test functions and 3 real-life applications of the IEEE CEC-2011 test suite. The results prove that the proposed approach successfully completes its task and makes the DE algorithm more efficient. [ABSTRACT FROM AUTHOR]

Population-based metaheuristics can be seen as a set of agents that smartly explore the space of solutions of a given optimization problem. These agents are commonly governed by movement operators that decide how the exploration is driven. Although metaheuristics have successfully been used for more than 20 years, performing rapid and high-quality parameter control is still a main concern. For instance, deciding the proper population size yielding a good balance between quality of results and computing time is constantly a hard task, even more so in the presence of an unexplored optimization problem. In this paper, we propose a self-adaptive strategy based on the on-line population balance, which aims for improvements in the performance and search process on population-based algorithms. The design behind the proposed approach relies on three different components. Firstly, an optimization-based component which defines all metaheuristic tasks related to carry out the resolution of the optimization problems. Secondly, a learning-based component focused on transforming dynamic data into knowledge in order to influence the search in the solution space. Thirdly, a probabilistic-based selector component is designed to dynamically adjust the population. We illustrate an extensive experimental process on large instance sets from three well-known discrete optimization problems: Manufacturing Cell Design Problem, Set covering Problem, and Multidimensional Knapsack Problem. The proposed approach is able to compete against classic, autonomous, as well as IRace-tuned metaheuristics, yielding interesting results and potential future work regarding dynamically adjusting the number of solutions interacting on different times within the search process. [ABSTRACT FROM AUTHOR]

A new bio-inspired metaheuristic algorithm named the Pufferfish Optimization Algorithm (POA), that imitates the natural behavior of pufferfish in nature, is introduced in this paper. The fundamental inspiration of POA is adapted from the defense mechanism of pufferfish against predators. In this defense mechanism, by filling its elastic stomach with water, the pufferfish becomes a spherical ball with pointed spines, and as a result, the hungry predator escapes from this threat. The POA theory is stated and then mathematically modeled in two phases: (i) exploration based on the simulation of a predator's attack on a pufferfish and (ii) exploitation based on the simulation of a predator's escape from spiny spherical pufferfish. The performance of POA is evaluated in handling the CEC 2017 test suite for problem dimensions equal to 10, 30, 50, and 100. The optimization results show that POA has achieved an effective solution with the appropriate ability in exploration, exploitation, and the balance between them during the search process. The quality of POA in the optimization process is compared with the performance of twelve well-known metaheuristic algorithms. The simulation results show that POA provides superior performance by achieving better results in most of the benchmark functions in order to solve the CEC 2017 test suite compared to competitor algorithms. Also, the effectiveness of POA to handle optimization tasks in real-world applications is evaluated on twenty-two constrained optimization problems from the CEC 2011 test suite and four engineering design problems. Simulation results show that POA provides effective performance in handling real-world applications by achieving better solutions compared to competitor algorithms. [ABSTRACT FROM AUTHOR]

The Harris Hawks Optimization algorithm (HHO) is a sophisticated metaheuristic technique that draws inspiration from the hunting process of Harris hawks, which has gained attention in recent years. However, despite its promising features, the algorithm exhibits certain limitations, including the tendency to converge to local optima and a relatively slow convergence speed. In this paper, we propose the multi-strategy improved HHO algorithm (MSI-HHO) as an enhancement to the standard HHO algorithm, which adopts three strategies to improve its performance, namely, inverted S-shaped escape energy, a stochastic learning mechanism based on Gaussian mutation, and refracted opposition-based learning. At the same time, we conduct a comprehensive comparison between our proposed MSI-HHO algorithm with the standard HHO algorithm and five other well-known metaheuristic optimization algorithms. Extensive simulation experiments are conducted on both the 23 classical benchmark functions and the IEEE CEC 2020 benchmark functions. Then, the results of the non-parametric tests indicate that the MSI-HHO algorithm outperforms six other comparative algorithms at a significance level of 0.05 or greater. Additionally, the visualization analysis demonstrates the superior convergence speed and accuracy of the MSI-HHO algorithm, providing evidence of its robust performance. [ABSTRACT FROM AUTHOR]

A new swarm-based metaheuristic, namely the enriched coati osprey algorithm (ECOA), is proposed in this paper. As its name suggests, ECOA hybridizes two new metaheuristics, the coati optimization algorithm (COA) and the osprey optimization algorithm (OOA). ECOA is constructed by five searches performed sequentially by the swarm members. The first three are directed searches, while the last two are neighborhood searches. All three directed searches are adopted from COA and OOA. Meanwhile, the four-bordered neighborhood search is developed based on a new approach. During the assessment, ECOA was challenged to overcome the set of 23 functions and contended with five new metaheuristics: total interaction algorithm (TIA), golden search optimization (GSO), average and subtraction-based optimization (ASBO), COA, and OOA. The result shows that ECOA outperforms TIA, GSO, ASBO, COA, and OOA in 16, 23, 18, 21, and 21 functions. Meanwhile, the individual search test result shows that the directed searches perform better than the neighborhood searches. Moreover, the directed search toward the best member becomes the most dominant search. [ABSTRACT FROM AUTHOR]

Developing a photovoltaic system that successfully harvests the sun's power is one of the most difficult aspects of boosting power generation. Consequently, our study focuses on the development of a hybrid intelligent maximum power point tracking (MPPT) regulator that combines an innovative optimization approach based on the fireworks algorithm (FWA) and an artificial neural network (ANN) model. The proposed approach is examined in the first part of this study for various ANN configuration scenarios to identify the appropriate hyperparameters values and training algorithm required to converge toward the ideal objective function. After the optimization and training processes are completed, the selected FWA–ANN model is simulated as an MPPT controller using MATLAB/Simulink software and compared to the most commonly used MPPT techniques to demonstrate its effectiveness under various partial shading conditions. The results show that our proposed FWA–ANN technique using the BR and four neurons in the hidden layer reaches an excellent mean-squared error value equal to 0.1159 in the optimization process and 2.74e - 13 in the training phase. In addition, our suggested model is compared to the most widely used MPPT techniques notably, perturb and observe, particle swarm optimization, grey wolf optimization, whale optimization algorithm, and fuzzy logic controller. The obtained outcomes prove that the FWA–ANN overpasses the applied techniques by tracking the maximum power point faster with a response time between 0.0048 and 0.0261 s, a power efficiency higher than 99.5749%, that can up to 99.9977%, and an extreme reduction of oscillations in the transient and steady states for all tested cases. [ABSTRACT FROM AUTHOR]

Background: In this study, a tuned mass damper (TMD) was implemented on 3D irregular structures to reduce structural responses including the increased displacements of structures at corners due to torsional rotation. Method: A novel metaheuristic-based optimization methodology is presented for obtaining the optimum design of TMD. The methodology employs a metaheuristic algorithm called Jaya Algorithm and the codes of this algorithm were combined with dynamic analysis of TMD-included. To reduce torsional effects, the position of TMD on the plan is also a design variable additional to TMD parameters. Results: The method is tested on a single-story irregular structure as a theoretical study. Then, the application feasibility of the method was proved via a ten-story real-size structure. The optimum TMD is effective to reduce the maximum displacement by 25.71 and 22.69% for the single-story and ten-story structures, respectively. [ABSTRACT FROM AUTHOR]

The ball and balancer system is a popular research platform for studying underactuated mechanical systems and developing control algorithms. It is a well-known two-dimensional balancing problem that has been addressed by a variety of controllers. This research work proposes two controllers that are proportional integral derivative-second derivative-proportional integrator ( PIDD 2 -PI) controller and tilt integral derivative with filter (TID-F) controller in a multivariate, electromechanical, and nonlinear under-actuated ball and balancer system. Integral Time Absolute Error (ITAE) is an objective function used for designing controllers because of its ability to be more sensitive to overshooting as well as reduced settling time and steady-state error. As part of the analysis, four metaheuristic optimization algorithms are compared in the optimization of proposed control strategies for cascaded control of the ball and balancer system. The algorithms are the Grey Wolf optimization algorithm (GWO), Cuckoo Search algorithm (CSA), Gradient Base Optimization (GBO), and Whale Optimization Algorithm (WOA). The effectiveness of proposed controllers PIDD 2 -PI and TID-F is investigated to be better in terms of transient time response than proportional integral derivative (PID), proportional integral-derivative (PI-D), proportional integral-proportional derivative (PI-PD) and proportional integral derivative-second derivative-proportional derivative ( PIDD 2 -PD). Moreover, these two proposed controllers have also been compared with recently published work. During the analysis, it is shown that the proposed control strategies exhibit significantly greater robustness and dynamic responsiveness compared to other structural controllers. The proposed controller WOA- PIDD 2 -PI reduced the 73.38% settling time and 88.16% rise time compared to classical PID. The other proposed controller GWO-TID-F reduced 58.06% the settling time and 26.96% rise time compared to classical PID. These results show that proposed controllers are particularly distinguished in terms of rise time, settling time, maximum overshoot, and set-point tracking. [ABSTRACT FROM AUTHOR]

Hackers nowadays employ botnets to undertake cyberattacks towards the Internet of Things (IoT) by illegally exploiting the scattered network's resources of computing devices. Several Machine Learning (ML) and Deep Learning (DL) methods for detecting botnet (BN) assaults in IoT networks have recently been proposed. However, in the training set, severely imbalanced network traffic data degrades the classification performances of state-of-the-art ML as well as DL algorithm, particularly in classes with very few samples. The Convolutional Neural Network -Pelican Optimization System (CNN-POA) is a DL relied botnet attack detection algorithm developed in this research. Meanwhile, typical evaluation markers are used to compare the overall performance of the proposed CNN-POA and additional frequently employed algorithms. The simulation results suggest that the CNN-POA method is effective and dependable for detecting IoT network intrusion attacks. Experiments revealed that the suggested CNN-POA approach outperformed a number of current metaheuristic algorithms, with an accuracy of 99.5%. [ABSTRACT FROM AUTHOR]

Summary: The efficiency of metaheuristic algorithms depends significantly on the number of fitness value evaluations performed on candidate solutions. In addition to various intelligent techniques used to obtain better results, parallelization of calculations can substantially improve the solutions in cases where the problem is NP‐hard and requires many evaluations. This study proposes a new parallel tabu search method for solving the Maximum Vertex Weight Clique Problem (MVWCP) on the Non‐Uniform Memory Access (NUMA) architectures using the OpenMP parallel programming paradigm. Achieving scalability in the NUMA architectures presents significant challenges due to the high complexity of their memory systems, which can lead to performance loss. However, our proposed Tabu‐NUMA algorithm provides up to 18×$$ 18\times $$ speed‐up with 64 cores for ten basic problem instances in DIMACS‐W and BHOSLIB‐W benchmarks. And it improves the performance of the serial Multi Neighborhood Tabu Search (MN/TS) algorithm for 38 problem instances in DIMACS‐W and BHOSLIB‐W benchmarks. We further evaluate our algorithm on larger datasets with thousands of edges and vertices from Network Data Repository benchmark problem instances, and we report significant improvements in terms of speed up. Our results confirm that the Tabu‐NUMA algorithm is among the best recent algorithms for solving MVWCP on the NUMA architectures. [ABSTRACT FROM AUTHOR]

In this study, operating parameters of a semi-empirical mathematical model of a proton-exchange membrane fuel cell (PEMFC) are extracted and compared using various metaheuristic algorithms to analyze its behavior in a fast and economical manner before setting it up for application. Sum-squared error is employed as the objective function to find the values of seven unknown modeling parameters. The parameter extraction is carried out by using the polarization curve data of a 1000 W commercial PEMFC. Three different multi-attribute decision-making methods are used to rank the metaheuristic algorithms in terms of performance. The findings indicate that Moth Flame Algorithm is ranked first considering the sum-squared error (0.4389) and runtime (1054 s); whereas Grey Wolf Optimizer gives the best objective function efficiency (98.6034%) and lowest error rate (0.1096). It was also found that JAYA and Cuckoo Search are not convenient for parameter extraction of the specified fuel cell. Overall, the distinctive features of the study provide valuable insights and advancements in the field of fuel cell modeling and optimization. • Fuel cell modeling parameters are compared using various algorithms for H-1000XP. • Moth Flame Algorithm gives the best performance among the studied algorithms. • Improved Grey Wolf Optimizer yields the best objective function efficiency by 98.60%. • JAYA and Cuckoo Search are not suitable for parameter extraction from the fuel cell. [ABSTRACT FROM AUTHOR]

In this study, an improved bald eagle search optimization algorithm (IBES) is utilized to develop home energy management systems for smart homes. This research is crucial for energy field researchers who are interested in optimizing energy consumption. The primary objective is to optimally manage load demand, reduce the average peak ratio, lower electricity bills, and enhance user comfort. To accomplish this goal, the load conversion strategy is used to coordinate household appliances and manage the home power system effectively. This approach aims to minimize peak–average ratios and electricity costs while ensuring consumer convenience. To minimize electricity bills, the study schedules the consumer's daily activities based on actual time and next day's energy demand. Furthermore, a fitness criterion is used to balance the load between off-peak and on-peak hours. The scheduler is designed to achieve an optimal device on/off state that minimizes device waiting time by coordinating household appliances in real time. To address the background problem of real-time rescheduling, dynamic programming is employed. The study evaluates the modified algorithm's performance using three pricing strategies: critical peak pricing, real-time pricing, and time of use. The modified IBES technique is utilized to achieve the specified objectives of minimizing the electricity bill, reducing the peak–average ratio, and enhancing user convenience. [ABSTRACT FROM AUTHOR]

Access points (APs) are used to define coordinates in an indoor positioning system with Wi-Fi. These systems utilize existing infrastructure and Wi-Fi APs to find out the exact location of a device based on its RSSI and MAC address. The accuracy of these devices usually depends on the number of APs located nearby and the environment in which they are deployed. Therefore, the ideal selection of these points increases the discernibility of the localization technique. The rapid development of metaheuristic algorithms in recent years has demonstrated their effectiveness in resolving challenging optimization issues. The primary research goal is to investigate how to enhance indoor localization accuracy with metaheuristic algorithms and to assess the efficacy of positioning using these methods. In this paper, we propose a novel optimization algorithm called the Improved Pathfinder Algorithm (IPFA) using metaheuristic hybridization, where our contribution is twofold. The IPFA's superiority in optimization is used to choose the important APs. Subsequently, to maintain the generality of the localization performance, we created a feature-based classification model for the chosen AP subsets. Two prominent benchmark datasets, UJIIndoorLoc and JUIndoorLoc, were used to test the proposed framework. The proposed Indoor Localization framework attained an accuracy of 98.26% with a mean absolute error (MAE) of approximately 0.79 m. The results demonstrate that the IPFA method is capable of accurately locating the position with minimal positioning errors. [ABSTRACT FROM AUTHOR]