Metaheuristics Algorithm-Based Optimization for High Conductivity and Hardness CuNi2Si1 Alloy.

Several optimization problems from various types of applications have been efficiently resolved using available meta-heuristic algorithms such as Particle Swarm Optimization and Genetic Algorithm. Recently, many meta-heuristic optimization techniques have been extensively reported in the literature. Nevertheless, there is still room for new optimization techniques and strategies since, according to the literature, there is no meta-heuristic optimization algorithm that may be considered as the best choice to cope with all modern optimization problems. This paper introduces a novel meta-heuristic optimization algorithm named Dynamic Group-based Optimization Algorithm (DGCO). The proposed algorithm is inspired by the cooperative behavior adopted by swarm individuals to achieve their global goals. DGCO has been validated and tested against twenty-three mathematical optimization problems, and the results have been verified by a comparative study with respect to state-of-the-art optimization algorithms that are already available. The results have shown the high exploration capabilities of DGCO as well as its ability to avoid local optima. Moreover, the performance of DGCO has also been verified against five constrained engineering design problems. The results demonstrate the competitive performance and capabilities of DGCO with respect to well-known state-of-the-art meta-heuristic optimization algorithms. Finally, a sensitivity analysis is performed to study the effect of different parameters on the performance of the DGCO algorithm.

AnFiS-MoH: Systematic exploration of hybrid ANFIS frameworks via metaheuristic optimization hybridization with evolutionary and swarm-based algorithms

The research and development of metaheuristic methods are critical issues in computer science. In the past decade, metaheuristic algorithms have been used in many engineering applications such as optimization of engineering problems, telecommunications, information security, and image processing. Many metaheuristic algorithms such as particle swarm optimization (PSO), ant colony optimization (ACO), and genetic algorithm (GA) are recently becoming very popular.There are many studies conducted in the literature on the comparison of PSO with other metaheuristic algorithms. In this chapter, various studies carried out between the years of 2010 and 2020 about the comparison of PSO with the other metaheuristic algorithms will be examined. The metaheuristic algorithms to be considered are simulated annealing (SA), genetic algorithm (GA), differential evolution (DE), ant colony optimization (ACO), artificial bee colony (ABC) algorithm, particle swarm optimization (PSO), tabu search (TS), harmony search (HS), firefly algorithm (FF), cuckoo search (CS), bat-inspired algorithm (BA), water wave optimization (WWO), clonal selection algorithm (CLONALG), chemical reaction optimization (CRO), sine cosine algorithm (SCA), glowworm swarm optimization (GSO), and grey wolf optimizer (GWO). This study aims to evaluate and analyze the covered papers according to several criteria such as (a) rates of studies according to publishing years, (b) the metaheuristic algorithms that are compared to PSO, (c) performance evaluation of compared algorithms, (d) the metaheuristic algorithms with their inspirational approaches and their initial proposed studies and years, (e) the field of subjects where the algorithms are applied in the reviewed studies, and (f) used databases in the examined studies.This study is a comprehensive literature review of the comparison of PSO with the most popular metaheuristic algorithms. The intention of this review is to be useful for researchers who want to conduct a survey on this area of the subject as this chapter will cover the essential and helpful analysis of the related research.

Knowing the type of buried object before excavation prevents unnecessary excavation. Moreover, it saves time and money. In this study, an experiment set was prepared for the detection of buried objects. The experimental set was composed of an antenna that sends and receives electromagnetic waves in a wide frequency band, software that records and processes reflections, and a sandbox. In the study, metallic and non-metallic objects with different depths, sizes and shapes were buried in this sand pool and measurements were taken along a profile. 2D images were created from the measurements and image processing techniques were applied to these images. Classification algorithms were used to detect the type of bruied object from processed images. To increase the success of the algorithms, correlation-based attribute selection (CFS) and Principal Component Analysis (PCA) were used as attribute selection techniques. Genetic algorithm (GA), Particle Swarm Optimization (PSO), Harmony search (HA), and Evolutionary search (EA), which are among the metaheuristic optimization algorithms, were preferred as search methods in attribute selection with CFS. The performance of the algorithms was analyzed using the 10-fold cross-validation method. As a result, it was understood that the use of the PCA algorithm in attribute selection increases the classification success more than metaheuristic algorithms. The most successful among the classification algorithms used is the Random tree algorithm. After PCA, the accuracy value of this algorithm was 95.8 Therefore, a hybrid approach is proposed in which PCA and Random tree algorithms are used in the software embedded in the measurement system.

Cross-correlation stacking-based microseismic source location using three metaheuristic optimization algorithms

This study presents a multi-objective deep learning framework that integrates Long Short Term Memory (LSTM) neural networks with four metaheuristic optimization algorithms: Particle Swarm Optimization (PSO), Grey Wolf Optimizer (GWO), Genetic Algorithm (GA), and Non-dominated Sorting Genetic Algorithm II (NSGA-II) to optimize forecasting accuracy and model complexity for groundwater level prediction in data-scarce, hyper-arid urban aquifers. The framework was assessed using four groundwater monitoring wells in Kuwait City, where lagged groundwater data and cross-validation were employed to train the models. Results revealed that the models developed by using GA and PSO were superior to those developed using GWO and NSGA-II in terms of key statistical metrics. The proposed data-driven approach addresses key limitations of traditional physically based models, offering a flexible and computationally efficient alternative for groundwater forecasting. The framework presents a practical tool for real-time monitoring and management of groundwater resources in water-scarce regions.

Procedural Content Generation (PCG) has emerged as a powerful approach for automating game content creation, offering significant benefits in terms of cost reduction and time efficiency compared to traditional game design and development processes (Zhang, Zhang, & Huang, 2022). While Genetic Algorithms (GAs) have been widely used in PCG, alternative metaheuristic algorithms such as Particle Swarm Optimization (PSO) and Artificial Bee Colony (ABC) have demonstrated their effectiveness in delivering high-quality solutions and efficient optimization capabilities across different problem domains (Amato, 2017). However, their application in PCG remains limited. I aim to evaluate the performance of PSO and ABC in map layout generation, challenging the conventional use of GAs. By comparing three metaheuristic algorithms (GA, ABC, and PSO) I seek to assess the effectiveness of these approaches in generating game levels and identify any obvious differences in their performance characteristics. Comprehensive experiments are conducted, applying GA, ABC, and PSO to a map layout generation. Metrics like convergence speed and content quality are used to evaluate the generated game content. My findings reveal that both ABC and PSO demonstrate advantages over traditional GA implementations when generating game levels, indicating their potential for enhancing PCG. In this presentation, I will share the results of comparing three metaheuristic algorithms (GA, PSO, and ABC) in map layout generation for game levels, emphasizing the potential benefits of leveraging diverse algorithmic approaches to create more captivating and immersive game worlds. Also, I will conclude with a call for further research in this area to expose new possibilities in content generation. By considering varied metaheuristic approaches, game developers can improve content generation techniques and create more captivating and interactive player experiences.

Today, the use of permanent magnet brushless DC (PMBLDC) motors in vehicles is increasing due to the characteristics of sensorless operation. PMBLDC motor controllers can control the speed and position in the closed-loop feedback system without the need for a position sensor mounted on the shaft. Proportional – Integral – Derivative (PID) controller is one of the most common feedback control algorithms used in PMBLDC motor controllers. Optimizing problems using deterministic methods such as Lagrange and simplex methods requires basic information and complex calculations. Meta-heuristic algorithms are a type of stochastic algorithm that is used to find the optimal solution. Meta-heuristic algorithms are divided into three general categories: evolutionary algorithms, swarm intelligence algorithms, and stochastic algorithms. In this paper, using 14 metaheuristic optimisation algorithms, PID control parameters including settling time, time rise, overshoot, and stability of step response of the mentioned system are optimised. In this paper, 14 meta-heuristic algorithms are simulated and evaluated to optimise the PID coefficients of the controller, including settling time, rising time, excessive increase, and step response stability. The simulation result shows that the genetic algorithm (GA) has the best performance in terms of cost function and biogeography-based optimisation (BBO) in terms of settling time and rising time parameters. Finally, the simulation results are confirmed using experimental results.

This paper presents compared performances of three metaheuristic algorithms in determining the cost of hybrid renewable energy system. Using genetic algorithm (GA), particle swarm optimization (PSO), and artificial bee colony (ABC), the best affordable sizes of solar photovoltaic array, battery bank, and a minimum-rated diesel generator that could be hybridized to meet the demand of a community in Southwest Nigeria were determined. Load profile, solar radiation, and temperature data were employed as required inputs, and the parameters of the algorithms were properly set to ensure the best result. Bonferroni– Holm method was deployed to ascertain the statistical significance among the algorithms. It was found that ABC produced the best configuration comprising 427 numbers of solar photovoltaic panels, 19 battery units, and 163.2 kW-rated diesel generator. With this, a total annualized cost of $167 284 and 0.2443 estimated cost of energy were obtained. These were the lowest when compared with PSO and GA. The t-test between PSO and ABC are both 5.83 × 10−10 < 0.01666667, between ABC and GA are 6.09 × 10−6 0.01666667 and 9.13 × 10−1 > 0.05. PSO/ABC and ABC/GA groups are clarified significant, while GA/PSO group is insignificant; post hoc test reveals that ABC produced the best result. Hence, a reliable and sustainable power supply at a reduced cost is guaranteed for the community. Cite this article as: T.O. Ajewole, O. Oladepo, K.A. Hassan, A.A. Olawuyi, O. Opeyemi, Comparative study of the performances of three metaheuristic algorithms in sizing hybrid-source power system. Turk J Electr Power Energy Syst, 2022; 2(2), 134-146.

The integration of renewable sources and energy storage in residential microgrids offers energy efficiency and emission reduction potential. Effective energy management is vital for optimizing resources and lowering costs. In this paper, we propose a novel approach, combining the imperialist competitive algorithm (ICA) with particle swarm optimization (PSO) as ICA-PSO to enhance energy management. The proposed energy management system operates in an offline mode, anticipating data for the upcoming 24 h, including consumption predictions, tariff rates, and meteorological data. This anticipatory approach facilitates optimal power distribution among the various connected sources within the microgrid. The performance of the proposed hybrid ICA-PSO algorithm is evaluated by comparing it with three selected benchmark algorithms, namely the genetic algorithm (GA), ICA, and PSO. This comparison aims to assess the effectiveness of the ICA-PSO algorithm in optimizing energy management in multi-source residential microgrids. The simulation results, obtained using Matlab 2023a, provide clear evidence of the effectiveness of the hybrid ICA-PSO algorithm in achieving optimal power flows and delivering substantial cost savings. The hybrid algorithm outperforms the benchmark algorithms with cost reductions of 4.47%, 14.93%, and 26% compared to ICA, PSO, and GA, respectively. Furthermore, it achieves a remarkable participation rate of 50.6% for renewable resources in the energy mix, surpassing the participation levels of the ICA (42.88%), PSO (40.51%), and GA (38.95%). This research contributes to the advancement of power flow management techniques in the context of multi-source residential microgrids, paving the way for further research and development in this field.

Ultra-high-performance concrete (UHPC) is a recently developed material which has attracted considerable attention in the field of civil engineering because of its outstanding characteristics. One of the key factors in concrete design is the compressive strength (CS) of UHPC. As one of the most potent tools in artificial intelligence (AI), machine learning (ML) can accurately predict concrete’s mechanical properties. Hyperparameter tuning is crucial in ensuring the prediction model’s reliability. However, it is a complex work. The purpose of this study is to optimize the CS prediction method for UHPC. Three ML methods, random forest (RF), support vector machine (SVM), and k-nearest neighbor (KNN), are selected to predict the CS of UHPC. Among them, the RF model demonstrates superior predictive accuracy, with the testing dataset R2 of 0.8506. In addition, three meta-heuristic optimization algorithms, particle swarm optimization (PSO), beetle antenna search (BAS), and snake optimization (SO), are utilized to optimize the prediction model hyperparameters. The R2 values for the testing dataset of SO-RF, PSO-RF, and BAS-RF are 0.9147, 0.8529, and 0.8607, respectively. The results indicate that SO-RF exhibits the highest predictive performance. Furthermore, the importance of input parameters is evaluated, and the findings prove the feasibility of the SO-RF model. This research enriches the prediction method of the CS of UHPC.

The multi-objective portfolio optimization is regarded as an multi-objective optimization problem which is complicated and hard to find a satisfactory solution in a limited time. It is more complex and difficult to use the conventional method to solve this problem. In this paper, we first establish a mean-CVaR-entropy model with transaction costs and investment weight restrictions, and then propose a Multi-objective Optimization Algorithm for BeetleSearch(MOBSO), a meta-heuristic optimization algorithm, and a variant of Beetle Antennae Search (BAS) algorithm, which is applied into portfolio optimization to solve this constraint multi-objective optimization problem. Finally, we use the 20 stocksfrom January 2017 to December 2021 in the US stock market to do case studyand compare the results with other meta-heuristic optimization algorithms. It shows that the MOBSO outperforms swarm algorithms such as the particle swarm optimization (PSO) and the genetic algorithm(GA). KeywordsMulti-objective portfolio optimizationBeetle Antennae Search (BAS)Particle Swarm Optimization (PSO)Meta-heuristic optimizationFinance problem

Guest Editorial

Hyperparameter tuning is a critical function necessary for the effective deployment of most machine learning (ML) algorithms. It is used to find the optimal hyperparameter settings of an ML algorithm in order to improve its overall output performance. To this effect, several optimization strategies have been studied for fine-tuning the hyperparameters of many ML algorithms, especially in the absence of model-specific information. However, because most ML training procedures need a significant amount of computational time and memory, it is frequently necessary to build an optimization technique that converges within a small number of fitness evaluations. As a result, a simple deterministic selection genetic algorithm (SDSGA) is proposed in this article. The SDSGA was realized by ensuring that both chromosomes and their accompanying fitness values in the original genetic algorithm are selected in an elitist-like way. We assessed the SDSGA over a variety of mathematical test functions. It was then used to optimize the hyperparameters of two well-known machine learning models, namely, the convolutional neural network (CNN) and the random forest (RF) algorithm, with application on the MNIST and UCI classification datasets. The SDSGA’s efficiency was compared to that of the Bayesian Optimization (BO) and three other popular metaheuristic optimization algorithms (MOAs), namely, the genetic algorithm (GA), particle swarm optimization (PSO) and biogeography-based optimization (BBO) algorithms. The results obtained reveal that the SDSGA performed better than the other MOAs in solving 11 of the 17 known benchmark functions considered in our study. While optimizing the hyperparameters of the two ML models, it performed marginally better in terms of accuracy than the other methods while taking less time to compute.

Precise estimation of pan evaporation is necessary to manage available water resources. In this study, the capability of three hybridized models for modeling monthly pan evaporation (Epan) at three stations in the Dongting lake basin, China, were investigated. Each model consisted of an adaptive neuro-fuzzy inference system (ANFIS) integrated with a metaheuristic optimization algorithm; i.e., particle swarm optimization (PSO), whale optimization algorithm (WOA), and Harris hawks optimization (HHO). The modeling data were acquired for the period between 1962 and 2001 (480 months) and were grouped into several combinations and incorporated into the hybridized models. The performance of the models was assessed using the root mean square error (RMSE), mean absolute error (MAE), Nash–Sutcliffe Efficiency (NSE), coefficient of determination (R2), Taylor diagram, and Violin plot. The results showed that maximum temperature was the most influential variable for evaporation estimation compared to the other input variables. The effect of periodicity input was investigated, demonstrating the efficacy of this variable in improving the models’ predictive accuracy. Among the models developed, the ANFIS-HHO and ANFIS-WOA models outperformed the other models, predicting Epan in the study stations with different combinations of input variables. Between these two models, ANFIS-WOA performed better than ANFIS-HHO. The results also proved the capability of the models when they were used for the prediction of Epan when given a study station using the data obtained for another station. Our study can provide insights into the development of predictive hybrid models when the analysis is conducted in data-scare regions.