Search

Diffuse horizontal irradiance (DHI) forecasts are critical for adopting solar photovoltaic technology. Yet, they can lack reliability given the limited and uncertain meteorological data available for desert areas. This research develops a new sine cosine dipper throated optimization (SCDTO) technique, targeting DHI prediction even given such data constraints. SCDTO uniquely hybridizes sine cosine metaheuristics, adept at exploration, with dipper throat optimization, providing focused exploitation. This hybridization aims to create a robust ensemble model capable of delivering reliable DHI predictions despite climatic uncertainty. The ensemble model, employing various input combinations, was rigorously evaluated across multiple meteorological stations. The SCDTO algorithm exhibited remarkable performance improvements, yielding substantial reductions exceeding 93% in root mean squared error and 98% in mean absolute error at key stations in Morocco, including Tan-Tan, Zagora, Erfoud, and Oujda. Comparative analyses against established optimization algorithms consistently underscored the superior predictive capabilities of SCDTO. Visualizations, including box plots and histograms, demonstrated SCDTO's efficacy in minimizing prediction errors, particularly for Tan-Tan, Zagora, and Erfoud stations. Also, statistical validation through one-way analysis of variance (ANOVA) further affirmed the significance of the proposed SCDTO method. Therefore, this hybrid metaheuristic optimization enables more accurate DHI predictions from limited meteorological data. [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]

This paper proposes the Love Evolution Algorithm (LEA), a novel evolutionary algorithm inspired by the stimulus–value–role theory. The optimization process of the LEA includes three phases: stimulus, value, and role. Both partners evolve through these phases and benefit from them regardless of the outcome of the relationship. This inspiration is abstracted into mathematical models for global optimization. The efficiency of the LEA is validated through numerical experiments with CEC2017 benchmark functions, outperforming seven metaheuristic algorithms as evidenced by the Wilcoxon signed-rank test and the Friedman test. Further tests using the CEC2022 benchmark functions confirm the competitiveness of the LEA compared to seven state-of-the-art metaheuristics. Lastly, the study extends to real-world problems, demonstrating the performance of the LEA across eight diverse engineering problems. Source codes of the LEA are publicly available at https://ww2.mathworks.cn/matlabcentral/fileexchange/159101-love-evolution-algorithm. [ABSTRACT FROM AUTHOR]

Electric vehicles (EVs) have been heavily used to minimize the worldwide pollution. Battery storage system is the most important and expensive system in these vehicles. An accurate battery management system (BMS) must be applied to monitor and control the battery states. From these measurements, the residual useful life (RUL) is estimated to avoid any further safety issue which can destroy the battery system or vehicle, or harm the passengers. Many features are required to be measured to estimate the battery states and then estimate the RUL such as battery voltage, current, and temperature according to the time. These measurements are taken using embedded system, and the measured data are stored in data files. Artificial neural networks (ANNs), long short-term memory (LSTM), support vector regressors (SVRs), random forest (RF), and boosting methods have been implemented to estimate the battery RUL. Moreover, many optimization algorithms such as particle swarm optimizer (PSO) and whale optimization algorithm (WOA) are integrated with the extreme learning machine (ELM) to estimate the battery RUL. The root mean square error (RMSE) is considered the main factor that has been used to judge which algorithm is more accurate than the other. It is found that both PSO-ELM and WOA-ELM supersede the machine learning tools, where the RMSE values are 1.46% and 1.51%, respectively. These values are 2.24%, 2.25%, 2.74%, 2.84%, and 3.56% LightGBM, random forest, AdaBoost, XGBoost, and CatBoost algorithms, respectively. [ABSTRACT FROM AUTHOR]

Music genre classification is significant to users and digital platforms. To enhance the classification accuracy, this study proposes a hybrid model based on VMD-IWOA-XGBOOST for music genre classification. First, the audio signals are transformed into numerical or symbolic data, and the crucial features are selected using the maximal information coefficient (MIC) method. Second, an improved whale optimization algorithm (IWOA) is proposed for parameter optimization. Third, the inner patterns of these selected features are extracted by IWOA-optimized variational mode decomposition (VMD). Lastly, all features are put into the IWOA-optimized extreme gradient boosting (XGBOOST) classifier. To verify the effectiveness of the proposed model, two open music datasets are used, i.e., GTZAN and Bangla. The experimental results illustrate that the proposed hybrid model achieves better performance than the other models in terms of five evaluation criteria. [ABSTRACT FROM AUTHOR]

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]

The set-covering problem aims to find the smallest possible set of subsets that cover all the elements of a larger set. The difficulty of solving the set-covering problem increases as the number of elements and sets grows, making it a complex problem for which traditional integer programming solutions may become inefficient in real-life instances. Given this complexity, various metaheuristics have been successfully applied to solve the set-covering problem and related issues. This study introduces, implements, and analyzes a novel metaheuristic inspired by the well-established Growth Optimizer algorithm. Drawing insights from human behavioral patterns, this approach has shown promise in optimizing complex problems in continuous domains, where experimental results demonstrate the effectiveness and competitiveness of the metaheuristic compared to other strategies. The Growth Optimizer algorithm is modified and adapted to the realm of binary optimization for solving the set-covering problem, resulting in the creation of the Binary Growth Optimizer algorithm. Upon the implementation and analysis of its outcomes, the findings illustrate its capability to achieve competitive and efficient solutions in terms of resolution time and result quality. [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]

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]

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]

K-Means clustering is commonly used for data clustering, but it suffers from limitations such as being prone to local optima and slow convergence, particularly when handling large medical files. The literature recommends employing metaheuristic algorithms in clustering studies to address these issues. This study aims to accurately diagnose diseases in four medical datasets (Dermatology, Diabetes, Parkinson's, and Thyroid) and increase the rate of correct diagnosis of diseases. We utilized optimization algorithms to assign weights to input parameters determining diseases in these datasets, thereby improving clustering performance. Our proposed model incorporates the Crow Search Algorithm, Tree Seed Algorithm, and Harris Hawks Optimization algorithms in a hybrid structure with K-Means. We conducted statistical evaluations using performance metrics. The study demonstrated that the hybrid Harris Hawks Optimization algorithm achieved the highest accuracy rate (97.19%) among the tested algorithms on the Dermatology dataset. The hybrid Crow Search Algorithm obtained a 96.29% accuracy rate on the Thyroid dataset, while the hybrid Tree Seed Algorithm achieved a 95.32% accuracy rate on the Dermatology dataset. This study offers significant benefits, including reduced staff workload, lower test costs, improved accuracy rates, and faster test results for detecting various diseases in medical datasets. [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]

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]

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]

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]

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]

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]

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]

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]

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]

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]

One of the most significant financial benefits of a shared mobility mode such as ridesharing is cost savings. For this reason, a lot of studies focus on the maximization of cost savings in shared mobility systems. Cost savings provide an incentive for riders to adopt ridesharing. However, if cost savings are not properly allocated to riders or the financial benefit of cost savings is not sufficient to attract riders to use a ridesharing mode, riders will not accept a ridesharing mode even if the overall cost savings is significant. In a recent study, the concept of discount-guaranteed ridesharing has been proposed to provide an incentive for riders to accept ridesharing services through ensuring a minimal discount for drivers and passengers. In this study, an algorithm is proposed to improve the performance of the discount-guaranteed ridesharing systems. Our approach combines a success rate-based self-adaptation scheme with an evolutionary computation approach. We propose a new self-adaptive metaheuristic algorithm based on success rate and differential evolution for the Discount-Guaranteed Ridesharing Problem (DGRP). We illustrate effectiveness of the proposed algorithm by comparing the results obtained using our proposed algorithm with other competitive algorithms developed for this problem. Preliminary results indicate that the proposed algorithm outperforms other competitive algorithms in terms of performance and convergence rate. The results of this study are consistent with the empirical experience that two people working together are more likely to come to a correct decision than they would if working alone. [ABSTRACT FROM AUTHOR]

Feature selection is becoming a relevant problem within the field of machine learning. The feature selection problem focuses on the selection of the small, necessary, and sufficient subset of features that represent the general set of features, eliminating redundant and irrelevant information. Given the importance of the topic, in recent years there has been a boom in the study of the problem, generating a large number of related investigations. Given this, this work analyzes 161 articles published between 2019 and 2023 (20 April 2023), emphasizing the formulation of the problem and performance measures, and proposing classifications for the objective functions and evaluation metrics. Furthermore, an in-depth description and analysis of metaheuristics, benchmark datasets, and practical real-world applications are presented. Finally, in light of recent advances, this review paper provides future research opportunities. [ABSTRACT FROM AUTHOR]

In the optimization field, the ability to efficiently tackle complex and high-dimensional problems remains a persistent challenge. Metaheuristic algorithms, with a particular emphasis on their autonomous variants, are emerging as promising tools to overcome this challenge. The term "autonomous" refers to these variants' ability to dynamically adjust certain parameters based on their own outcomes, without external intervention. The objective is to leverage the advantages and characteristics of an unsupervised machine learning clustering technique to configure the population parameter with autonomous behavior, and emphasize how we incorporate the characteristics of search space clustering to enhance the intensification and diversification of the metaheuristic. This allows dynamic adjustments based on its own outcomes, whether by increasing or decreasing the population in response to the need for diversification or intensification of solutions. In this manner, it aims to imbue the metaheuristic with features for a broader search of solutions that can yield superior results. This study provides an in-depth examination of autonomous metaheuristic algorithms, including Autonomous Particle Swarm Optimization, Autonomous Cuckoo Search Algorithm, and Autonomous Bat Algorithm. We submit these algorithms to a thorough evaluation against their original counterparts using high-density functions from the well-known CEC LSGO benchmark suite. Quantitative results revealed performance enhancements in the autonomous versions, with Autonomous Particle Swarm Optimization consistently outperforming its peers in achieving optimal minimum values. Autonomous Cuckoo Search Algorithm and Autonomous Bat Algorithm also demonstrated noteworthy advancements over their traditional counterparts. A salient feature of these algorithms is the continuous nature of their population, which significantly bolsters their capability to navigate complex and high-dimensional search spaces. However, like all methodologies, there were challenges in ensuring consistent performance across all test scenarios. The intrinsic adaptability and autonomous decision making embedded within these algorithms herald a new era of optimization tools suited for complex real-world challenges. In sum, this research accentuates the potential of autonomous metaheuristics in the optimization arena, laying the groundwork for their expanded application across diverse challenges and domains. We recommend further explorations and adaptations of these autonomous algorithms to fully harness their potential. [ABSTRACT FROM AUTHOR]

This research paper develops a novel hybrid approach, called hybrid particle swarm optimization–teaching–learning-based optimization (hPSO-TLBO), by combining two metaheuristic algorithms to solve optimization problems. The main idea in hPSO-TLBO design is to integrate the exploitation ability of PSO with the exploration ability of TLBO. The meaning of "exploitation capabilities of PSO" is the ability of PSO to manage local search with the aim of obtaining possible better solutions near the obtained solutions and promising areas of the problem-solving space. Also, "exploration abilities of TLBO" means the ability of TLBO to manage the global search with the aim of preventing the algorithm from getting stuck in inappropriate local optima. hPSO-TLBO design methodology is such that in the first step, the teacher phase in TLBO is combined with the speed equation in PSO. Then, in the second step, the learning phase of TLBO is improved based on each student learning from a selected better student that has a better value for the objective function against the corresponding student. The algorithm is presented in detail, accompanied by a comprehensive mathematical model. A group of benchmarks is used to evaluate the effectiveness of hPSO-TLBO, covering various types such as unimodal, high-dimensional multimodal, and fixed-dimensional multimodal. In addition, CEC 2017 benchmark problems are also utilized for evaluation purposes. The optimization results clearly demonstrate that hPSO-TLBO performs remarkably well in addressing the benchmark functions. It exhibits a remarkable ability to explore and exploit the search space while maintaining a balanced approach throughout the optimization process. Furthermore, a comparative analysis is conducted to evaluate the performance of hPSO-TLBO against twelve widely recognized metaheuristic algorithms. The evaluation of the experimental findings illustrates that hPSO-TLBO consistently outperforms the competing algorithms across various benchmark functions, showcasing its superior performance. The successful deployment of hPSO-TLBO in addressing four engineering challenges highlights its effectiveness in tackling real-world applications. [ABSTRACT FROM AUTHOR]

Introduction/purpose: Simulated annealing is a powerful technique widely used in optimization problems. One critical aspect of using simulated annealing effectively is a proper and optimal adjustment of its parameters. This paper presents a novel approach to efficiently adjust the parameters of simulated annealing to enhance its performance and convergence speed. Methods: Since the simulated algorithm is inspired by the cooling Metropolis process, the basic idea is to simulate and analyze this process using a mathematical model. The proposed work tends to properly imitate the Metropolis cooling process in the algorithmic field. By intelligently adjusting the temperature schedule, temperature reduction and cooling rate, the algorithm optimizes the balance between exploration and exploitation, leading to improved convergence and higher-quality solutions. Results: To evaluate the effectiveness of this approach, it was applied first on a chosen sample function to be minimized, and then on some usual known optimization functions. The results demonstrate that our approach, called Optimal Adjusting of Simulated Annealing parameters (OASA), achieves superior performance compared to traditional static parameter settings and other existing approaches, showing how to well adjust the parameters of the simulated annealing algorithm to improve its efficiency in terms of solution quality and processing time. Conclusion: Adjusting the algorithm parameters could have a significant contribution in the optimization field even for other metaheuristics. [ABSTRACT FROM AUTHOR]

Brain tumor is an active research topic in the area of medical imaging due to only 36% survival rate. The malignant tumor is a more dangerous type of tumor. The recent facts and figures show that 700,000 American are living in brain tumor and from them, 30.25% tumors are malignant. The diagnosis at the initial stage can help to minimize the human mortality rate due to brain tumor. Several researchers of computer vision proposed computer-aided diagnosis systems for this purpose but they faced several issues such as low accuracy and higher computational time. In this work, an end-to-end optimized deep learning system for multimodal brain tumor classification is proposed. The BRATS datasets are utilized for evaluation. The contrast is enhanced at the very first step by using hybrid division histogram equalization along ant colony optimization approach and train a newly design nine-layered CNN model. The features are extracted from second fully connected layer and optimized through differential evolution and mouth flame optimization. The output of both methods is fused using matrix length approach and passed in multi-class support vector machine (MC-SVM). In the experimental process, suggested method achieved an accuracy of 99.06, 98.76, 98.18 and 94.6%, on BRATS 2013, BRATS 2015, BRATS 2017 and BRATS 2018, respectively. Comparing results with existing techniques shows the superiority of proposed technique. [ABSTRACT FROM AUTHOR]

Estimation of baseflow is a complex hydrographic task. Baseflow techniques and coefficients vary from basin to basin, stream to stream, and year to year. In this study, meta-heuristic optimization is used to automatically identify baseflow. The Particle Swarm Optimization (PSO), a meta-heuristic optimization approach, is chosen. The constraint and cost functions were determined using the PSO algorithm, Lyne and Hollick techniques, and a computer application. Over the period 1980–2015, the data were collected at the Kale station in the Yesilirmak River basin to validate the study model. The results show that the hydrographs and baseflow dividing line were separated effectively. It has also been revealed that the PSO has a high speed as well as a high level of precision. In the research, in addition to the baseflow separation, the hydrograph, baseflow, and ratio of the baseflow to the streamflow at the station No. 1402 were assessed using the Mann–Kendall test and Innovative Trend Test (ITA), and as a result, their trends have been found. By the use of both of these methods, it has been shown that all parameters have an unfavorable trend. In addition, the research came to some other significant conclusions, such as the fact that the baseflow declines in tandem with the flow values and that the baseflow rates are low in years with high peak values of the hydrograph. [ABSTRACT FROM AUTHOR]

In this study, a nonlinear Archimedes wave swing (AWS) energy conversion system was employed to enable the use of irregular sea waves to provide useful electricity. Instead of the conventional PI controllers used in prior research, this study employed fractional-order PID (FOPID) controllers to control the back-to-back configuration of AWS. The aim was to maximize the energy yield from waves and maintain the grid voltage and the capacitor DC link voltage at predetermined values. In this study, six FOPID controllers were used to accomplish the control goals, leading to an array of thirty parameters required to be fine-tuned. In this regard, a hybrid jellyfish search optimizer and particle swarm optimization (HJSPSO) algorithm was adopted to select the optimal control gains. Verification of the performance of the proposed FOPID control system was achieved by comparing the system results to two conventional PID controllers and one FOPID controller. The conventional PID controllers were tuned using a recently presented metaheuristic algorithm called the Coot optimization algorithm (COOT) and the classical particle swarm optimization algorithm (PSO). Moreover, the FOPID was also tuned using the well-known genetic algorithm (GA). The system investigated in this study was subjected to various unsymmetrical and symmetrical fault disturbances. When compared with the standard COOT-PID, PSO-PID, and GA-FOPID controllers, the HJSPSO-FOPID results show a significant improvement in terms of performance and preserving control goals during system instability [ABSTRACT FROM AUTHOR]

The presence of Salmonella in agricultural waters may be a source of produce contamination. Recently, the performances of various algorithms have been tested for the prediction of indicator bacteria population and pathogen occurrence in agricultural water sources. The purpose of this study was to evaluate the performance of meta-heuristic optimization algorithms for feature selection to increase the Salmonella occurrence prediction success of commonly used algorithms in agricultural waters. Previously collected datasets from six agricultural ponds in Central Florida included the population of indicator microorganisms, physicochemical water attributes, and weather station measurements. Salmonella presence was also reported with PCR-confirmed method in data set. Features were selected by using binary meta-heuristic optimization methods including differential evolution optimization (DEO), grey wolf optimization (GWO), Harris hawks optimization (HHO) and particle swarm optimization (PSO). Each meta-heuristic method was run 100 times for the extraction of features before classification analysis. Selected features after optimization were used in the K-nearest neighbor algorithm (kNN), support vector machine (SVM) and decision tree (DT) classification methods. Microbiological indicators were ranked as the first or second features by all optimization algorithms. Generic Escherichia coli was selected as the first feature 81 and 91 times out of 100 using GWO and DEO, respectively. The meta-heuristic optimization algorithms for the feature selection process followed by machine learning classification methods yielded a prediction accuracy between 93.57 and 95.55%. Meta-heuristic optimization algorithms had a positive effect on improving Salmonella prediction success in agricultural waters despite spatio-temporal variations. This study indicates that the development of computer-based tools with improved meta-heuristic optimization algorithms can help growers to assess risk of Salmonella occurrence in specific agricultural water sources with the increased prediction success. [ABSTRACT FROM AUTHOR]

This paper proposes a robust optimization of eight chaotic maps: Logistics, Sine, Gauss, Circle, Tent, Chebyshev, Singer, and Piecewise Maps, for superior image encryption. The proposed model consists of two main processes: chaotic confusion and pixel diffusion. In the chaotic confusion process, the positions of the image's pixels are permuted with the chaotic maps, where the initial condition and the control parameters represent the confusion key. Firstly, the confusion process was performed using the eight chaotic maps without optimization. Then nine metaheuristic optimizers, which are the genetic algorithm, particle swarm optimizations, whale optimization algorithm, dragonfly algorithm, grey wolf optimizer, moth-flame optimizer, sine cosine algorithm, multi-verse optimizer, and ant-lion optimizer, have been used to fine-tune the control parameters of the eight chaotic maps. Then the image's pixel values are changed using the diffusion function in the pixel diffusion process. Multiple performance metrics, such as entropy, histogram, cross-correlation, computation time analysis, the number of pixels change rate (NPCR), unified average changing intensity (UACI), noise attack, data loss, and key analysis metrics, are utilized to evaluate the proposed model. The results demonstrate that the encryption algorithms based on the eight optimized chaotic maps are more resistant to differential attacks than those without optimization. Furthermore, the optimized Gauss chaotic map is the most computationally efficient, while the chaotic circle map has the most robust key. The careful adjustment of initial conditions and control parameters empowers the chaotic maps to create encryption keys with greater randomness and complexity, thereby increasing the security level of the encryption scheme. Experimental analysis indicates that the correlation coefficient values of images encrypted with the proposed scheme are nearly zero, the histogram of the encrypted images is uniform, the execution time of 0.1556 s, the key space of 10^80, NPCR of 99.63%, UACI of 32.92%, and entropy of 7.997. Moreover, the analysis of noise and cropping attacks, along with the comparison with other algorithms, demonstrate the efficiency and robustness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

The advancement of modeling and optimization research, especially in metallurgical applications, usually aims at casting products with fewer macroscopic defects and superior mechanical resistance. Based on that, any casting industry with this objective, that requires the thermal optimization of the solidification process, which mainly controls the mechanical behavior of castings, must obtain a non-trivial and relevant answer: which optimizer should one use to get a quick and satisfactory answer to my casting manufacturing process? This paper proposes a performance analysis of ten metaheuristic optimization algorithms applied to an inverse estimation of the Interfacial Heat Transfer Coefficient (IHTC) coupled with the solidification phenomenon. For this purpose, a unidirectional permanent mold casting was simulated considering the Al–7wt%Si alloy. A multi-parameter temporal power law was used for the IHTC model. The numerical discretization of the problem is considered the Finite Volume Method approach. Statistical results from the Markov Chain Monte Carlo method were considered a reference for qualitative and quantitative performance analysis. The Moth-Flame Optimizer (MFO) presented a probability of success of 85%, outperforming the other methods in all parametric and non-parametric metrics. Further research is encouraged to verify the influence and effectiveness of the intrinsic search to the MFO method to propose more efficient optimizers for this physical problem. [ABSTRACT FROM AUTHOR]

This paper presents two hybrid optimization methods known as PSOHHO and DPSOHHO optimization algorithms. In the first method, using a number of formulae, the top populations are exchanged between the two algorithms and a new population is created and in the second method, we adopted the parallel optimization and optimized its performance. In this method, unlike other parallel methods, the population does not remain constant. With this ability, the strengths of an algorithm can be used to compensate for the weaknesses of the other algorithm. In these methods, no changes are made to the algorithms. The main goal is to use existing algorithms. These methods attain the optimal solution in the shortest time possible. Two algorithms of particle swarm optimization (PSO) and Harris Hawks's optimization (HHO) are used to present this method and two truss samples and CEC209 are considered to confirm the performance of this method. Based on the results, these methods have rapid convergence speed and acceptable results compared to other methods. [ABSTRACT FROM AUTHOR]

The optimal power flow (OPF) problem is one of the most popular and important issues that researchers need to solve in power systems. In this study, a modified weighted teaching-learning-based optimization (WTLBO) algorithm was designed and implemented for the OPF problem, regarding the teaching-learning-based optimization (TLBO) algorithm, which is one of the meta-heuristic algorithms. To demonstrate the effectiveness of TLBO and developed WTLBO algorithms in OPF solutions, six different single/multi-objective functions consisting of targets, such as fuel cost, total active power losses, and voltage deviation were tested on standard IEEE 30 and 57 bus systems. Multi-objective functions were transformed into a single objective function using the weighted sum method. Analysis results were compared with different optimization algorithms used in the literature. When the developed WTLBO algorithm is compared according to the single/multi-objective functions in OPF solutions, it has been proven that it performs better than the original TLBO algorithm and other algorithms in the literature. As a result of the analysis, according to the TLBO algorithm, in the IEEE 30 bus power system, in the proposed WTLBO algorithm, a decrease of 0.05% in the total fuel cost, 2.20% in active power losses, and 13.37% in voltage deviation are observed. [ABSTRACT FROM AUTHOR]

Through the ages the importance of the swarm intelligence-based algorithm has gained popularity in the field of optimization. The Whale Optimization Algorithm (WOA) is one such popular meta-heuristics nature inspired swarm intelligence-based algorithm which is well accepted for solving optimization problems, as it is simple and capable to obtain optimal results efficiently. In this paper, few benchmark functions along with radiation patterns of concentric circular antenna array are presented and their performance is optimized using WOA. Simulation results are shown by taking various benchmark functions, namely: Three hump & Six hump camel function, Ackley, Egg Crate Function, and Egg Holder Function. The capability of the WOA algorithm is also tested through pattern synthesis with respect to the thinned array as well as non-uniformly excited array for four diverse sets of CCAA geometries. When comparison is being done with respect to renowned and most popular optimization approaches like PSO, the WOA technique proves to be excellent in terms of maximum SLL suppression. Optimization results show the better capability of WOA in the field of optimization. [ABSTRACT FROM AUTHOR]

In this paper, a new bio-inspired metaheuristic algorithm called Giant Armadillo Optimization (GAO) is introduced, which imitates the natural behavior of giant armadillo in the wild. The fundamental inspiration in the design of GAO is derived from the hunting strategy of giant armadillos in moving towards prey positions and digging termite mounds. The theory of GAO is expressed and mathematically modeled in two phases: (i) exploration based on simulating the movement of giant armadillos towards termite mounds, and (ii) exploitation based on simulating giant armadillos' digging skills in order to prey on and rip open termite mounds. The performance of GAO in handling optimization tasks is evaluated in order to solve the CEC 2017 test suite for problem dimensions equal to 10, 30, 50, and 100. The optimization results show that GAO is able to achieve effective solutions for optimization problems by benefiting from its high abilities in exploration, exploitation, and balancing them during the search process. The quality of the results obtained from GAO is compared with the performance of twelve well-known metaheuristic algorithms. The simulation results show that GAO presents superior performance compared to competitor algorithms by providing better results for most of the benchmark functions. The statistical analysis of the Wilcoxon rank sum test confirms that GAO has a significant statistical superiority over competitor algorithms. The implementation of GAO on the CEC 2011 test suite and four engineering design problems show that the proposed approach has effective performance in dealing with real-world applications. [ABSTRACT FROM AUTHOR]

The aim of electrical load dispatch (ELD) is to achieve the optimal planning of different power plants to supply the required power at the minimum operation cost. Using the combined heat and power (CHP) units in modern power systems, increases energy efficiency and, produce less environmental pollution than conventional units, by producing electricity and heat, simultaneously. Consequently, the ELD problem in the presence of CHP units becomes a very non-linear and non-convex complex problem called the combined heat and power economic dispatch (CHPED), which supplies both electric and thermal loads at the minimum operational cost. In this work, at first, a brief review of optimization algorithms, in different categories of classical, or conventional, stochastic search-based, and hybrid optimization techniques for solving the CHPED problem is presented. Then the CHPED problem in large-scale power systems is investigated by applying the imperialist competitive Harris hawks optimization (ICHHO), as the combination of imperialist competitive algorithm (ICA), and Harris hawks optimizer (HHO), for the first time, to overcome the shortcomings of using the ICA and HHO in the exploitation, and exploration phases, respectively, to solve this complex optimization problem. The effectiveness of the combined algorithm on four standard case studies, including 24 units as a medium-scale, 48, 84, units as the large-scale, and 96-unit as a very large-scale heat and power system, is detailed. The obtained results are compared to those of different algorithms to demonstrate the performance of the ICHHO algorithm in terms of better solution quality and lower fuel cost. The simulation studies verify that the proposed algorithm decreases the minimum operation costs by at least 0.1870%, 0.342%, 0.05224%, and 0.07875% compared to the best results in the literature. [ABSTRACT FROM AUTHOR]

The parameter extraction of Photovoltaic (PV) cell and module is a necessary to simulate and evaluate the performance of the PV system. The parameter extraction is a complex and challenging task due to its non-linear nature. Researchers are used several metaheuristic algorithms to solve the non-linear problem of parameter extraction. However, the demand for most accurate and reliable methods is increasing to get precise estimation of parameters. In this paper, a novel hybrid optimization algorithm is proposed based on the Spotted-Hyena optimization (SHO) and Ant Lion Optimization (ALO). The hybrid method is called as Spotted Hyena - Ant Lion (SH-AL) optimization. The optimization algorithm is applied in two stages. In stage 1, essential parameters are identified and extracted using SHO and passed to stage 2. In stage 2, identified parameters are optimized using ALO for accurate model of PV cell. Different type of PV cells such as thin film, mono and multi crystalline are examined under various irradiance conditions to extract the parameters. The proposed algorithm is validated by comparing the results with other algorithms and proposed algorithm is proved its superiority. [ABSTRACT FROM AUTHOR]

This paper proposes a new method for encryption of RGB color images by combining two encryption approaches: the spatial approach and the transformation approach. The proposed method uses the 3D fractional modified Henon map (3D FrMHM) and the discrete fractional Krawtchouk moments (FrDKM). We have also proposed a new hybrid optimization algorithm (H-SSAOA) to optimize the parameters of the proposed Henon map and the parameters of the Krawtchouk fractional moments. This algorithm is based on the hybridization of two metaheuristic algorithms: the "Salp Swarm Algorithm" (SSA) and the "Arithmetic Optimization Algorithm" (AOA). The simulation results reveal the optimization efficiency of the proposed hybrid algorithm H-SSAOA compared to other meta-heuristic algorithms and the efficiency of the suggested encryption method for encrypting RGB color images in terms of sensitivity to the security key and resistance to different attacks. [ABSTRACT FROM AUTHOR]

Summary: This article presents a study on the placement of multiple nulls as well as minimization of side lobe level in the radiation pattern using a planar hexagonal antenna array structure in two different vertical planes. The desired null depth is achieved to suppress the interference signal by the position‐only control of the uniformly excited isotropic antennas in the array structure. The immediate solution to the mentioned computational problem is reached by various meta‐heuristic optimization algorithms such as teaching learning‐based optimization (TLBO), symbiotic organism search (SOS), and moth fly optimization (MFO) within a considerably reduced processing time with a control over the design constrains. Various examples for diversified scenarios are demonstrated to place multiple deep nulls in the radiation pattern without compromising the pattern constraints and all other radiation pattern characteristics. This experiment sought to illustrate and quantify the unique benefits and limitations of proposed technique using three considered meta‐heuristic optimization algorithm. [ABSTRACT FROM AUTHOR]

Recently, the population density in cities has increased at a higher pace, so waste generation is on the rise in most societies due to population growth. Given this concern, it would be highly important to manage waste generation. Intelligent city planning is necessary to improve the quality of city life and make cities more livable. This paper presents an intelligent waste management system (IWMS) in smart cities based on Internet of Things components like sensors, detectors, and actuators. IWMS contains three main phases. The first phase of the system is to adapt the low energy adaptive clustering hierarchy approach as an optimization process to better balance the energy consumption of smart waste bins (SBs), thus leading to extending the life of the smart waste network. The second phase is handling the missing values which are retrieved from SBs using an improved version of the k-nearest neighbor algorithm based on artificial hummingbird optimization (AHA), while the third phase presents an optimal energy-efficient route process for the routing of waste trucks that improves fuel efficiency and reduces the time to get an appropriate SB. According to the experimental results, the proposed system has achieved energy savings of 34% for the smart waste bin network. Moreover, compared to other systems, it has a lower mean error rate when generating missing values, and the results related to convergence and running time validate its superiority compared with other metaheuristic algorithms. [ABSTRACT FROM AUTHOR]

This paper presents an effective approach for solving economic load dispatch problems contemplating the scheduling a set of thermal generating units to produce a specific power at low consumption costs. These problems can be thought of as nonlinear, non-convex, and highly constrained optimization problems with a large number of local minima. To cope with the above issues in solving such problems, a new meta-heuristic named capuchin search algorithm was adopted. To boost the search performance of this algorithm as well as to mitigate its early convergence and regression to the local optimum, it was hybridized with another algorithm and improved using several positive amendments. First, a memory element was added to this algorithm to ameliorate its position and velocity update mechanisms in order to exploit the most encouraging candidate solutions. Second, two adaptive parametric functions were used to manage the exploration and exploitation features of this algorithm and balance them appropriately. Finally, the hybridization was made using the gradient-based optimizer to strengthen the intensification ability of this algorithm and balance its searching ability to fulfill sensible search performance. The proficiency of the proposed algorithm was divulged by assessing it on computationally difficult economic load dispatch problems under 6 different tests with a generator of 3, 13, 40, 80, and 140 units, each with different constraints and load conditions. The proposed algorithm provided the best performance among many other competitors. Its superiority and practicality were revealed by obtaining optimal solutions for large-scale test cases such as 40-unit and 140-unit test systems. [ABSTRACT FROM AUTHOR]