Meta-heuristic Optimization Method Research Articles

A TOPSIS based multi-objective optimal deployment of solar PV and BESS units in power distribution system electric vehicles load demand

The growing concerns regarding the depletion of fossil fuels, CO2 emissions, and the effects of climate change prompt the usage of plug-in electric vehicles (PHEVs) all over the world in a big way. The increased electrical demand brought on by the charging of electric vehicles puts a burden on the distribution network parameters like energy loss, voltage profile and thermal limits. Recently, renewable energy-based distribution generation (RDGs) units are firmly integrated with the transmission and distribution system networks to lower the carbon footprint generated due to conventional thermal power plants. In addition, Battery Energy Storage Systems (BESS) are used to enhance grid operation and lessen the consequences of the high intermittency nature of RDGs power. In this work, two charging methods of PHEVs are considered: charging electric vehicles at home during night-time and charging electric vehicles at public fast charging stations (PFCS). The uncertain nature of arrival time and trip distance of PHEVs are addressed using probability density functions (PDFs). The 33-bus test system consists of commercial, industrial and residential buses is taken to implement the proposed methodology. In this work, 500 PHEVs are taken into consideration. The aforementioned charging methods produce a 24-h electric demand for PHEVs, which is then placed on the corresponding distribution system buses. The effect of PHEVs on technical distribution system metrics, including voltage profile and energy loss, is investigated. To improve the above metrics, optimal planning of inverter-based non-dispatchable PV units and dispatchable PV-BESS units in the distribution network by the inclusion of PHEVs electric load demand is addressed. The Pareto-based meta-heuristic multi-objective chaotic velocity-based butterfly optimization method (MOCVBOA) is chosen for optimization of desired objectives. The results of the MOCVBOA optimization algorithm are compared with those of the other optimization algorithms, NSGA-II & MOBOA, frequently described in the literature to assess its effectiveness.

AI-Powered Geotechnics: Enhancing Rock Mass Classification for Safer Engineering Practices

AbstractRock mass classification is fundamental for evaluating rock mass quality, essential for stability analysis and geotechnical design. Traditional classification methods are limited by joint observation technology, which typically gathers joint information from one-dimensional or two-dimensional perspectives, failing to comprehensively capture three-dimensional joint occurrences. This often necessitates empirical formulas for joint distribution, resulting in less precise joint parameter calculations. This paper reviews 44 seminal articles on rock engineering classification in construction and subterranean projects, tracing the evolution from foundational methods like Rock Quality Designation, Rock Mass Rating, Q-system, Basic Quality, and Hydropower Classification to contemporary techniques. It highlights the transformative impact of data science, particularly artificial intelligence, on rock engineering. The analysis reveals 73 distinct algorithms used 162 times in literature, with Support Vector Machines Support, Vector Regression, K-means clustering, K-Nearest Neighbors, Artificial Neural Networks and Random Forest being the most successful. This paper examines each method's advantage and limitations, discussing the challenges of algorithm deployment in the scientific community. The findings underscore the integration of machine learning and meta-heuristic optimization methods in rock engineering classification, offering valuable insights for future research and applications.

Application of the Gray Wolf Optimization Algorithm and Neural Networks for Solving Discrete Problems

Relevance. In recent decades, metaheuristic optimization methods have become popular for solving complex problems that require searching for global extrema. Algorithms such as genetic algorithm (GA), ant colony optimization (ACO), particle swarm optimization (PSO), as well as more modern approaches such as cat pack optimization (CSO) and gray wolf pack optimization (GWO) demonstrate high efficiency, but their application is often limited by the conditions of continuity and differentiability of the objective functions. This is a challenge when solving problems with discrete data, where such requirements are not met. In this context, the search for methods that allow adapting metaheuristic algorithms to work with discrete functions is of particular relevance.Aim. The study is aimed at testing the hypothesis about the possibility of using a neural network trained on a limited set of discrete data as an approximation of a function sufficient for the correct execution of the GWO algorithm when searching for a global minimum. The implementation of this hypothesis can significantly expand the scope of GWO, making it available for a wider range of problems where functions are defined on discrete sets.Methods. The study is based on the analysis of existing approaches and experimental verification of the hypothesis on two test functions: a linear function and a Booth function, which are widely used as standards for evaluating the performance of optimization algorithms. Numerical experiments were conducted using neural networks as an approximating model to obtain the results. Solution. During the experiments, an analysis of the applicability of neural networks for approximating discrete functions was carried out, which showed the success of this approach. It was found that neural networks can approximate discrete functions with high accuracy, creating conditions for a successful search for a global minimum using the GWO algorithm.Novelty. For the first time, a hypothesis was proposed and tested on the use of neural networks for approximating objective functions in metaheuristic optimization problems on discrete data. This direction has not previously received due coverage in the scientific literature, which adds significance to the obtained results and confirms the effectiveness of the proposed approach.Practical significance. The results of the study open up new prospects for the application of algorithms such as GWO in optimization problems based on discrete data, expanding the capabilities of metaheuristic methods and facilitating their implementation in a wider class of applied problems, including problems where the use of other methods is limited.

A comparative analysis of metaheuristic algorithms for optimizing curved roof structures

This article explores the optimal design of curved steel structures with a focus on minimizing their weight by determining the most suitable cross-sections. Customized optimization algorithms were developed to identify structural designs that meet safety and durability requirements, adhering to design constraints set by the ASD-AISC specification. To ensure reliable results, the study employs a variety of metaheuristic optimization methods: Biogeography-Based Optimization (BBO), Dynamic Harmony Search (DHS), Wolf Colony Algorithm (WCA), and Honey Badger Algorithm (HBA). The Honey Badger Algorithm, a relatively new addition to the field, was used for the first time in the context of structural optimization for curved roof systems. This unique approach aims to evaluate its performance in civil engineering problems and compare it with other established algorithms. The major challenges of this study lie in the inherent complexity of dome structures, which involve a large number of elements and nonlinear constraints. The subdivision of the structure into smaller groups was necessary to manage the computational load, although this introduced additional complexities. Despite these challenges, the metaheuristic methods demonstrated their robustness in addressing such intricate engineering problems. Additionally, data retrieval is facilitated through Open Application Interface (OAPI) functions, enabling seamless data transfer between SAP 2000 and Visual Basic. The study's final design example involves a dome model with 2556 elements, which was both modeled and optimized. The results demonstrate the effectiveness of these optimization algorithms in achieving structurally sound and efficient designs. The insights gained from this study contribute to our understanding of optimized cross-sections in curved steel structures, offering valuable guidance for improving structural performance and minimizing material usage.

Chaotic-Based Improved Henry Gas Solubility Optimization Algorithm: Application to Electric Motor Control

This study presents a novel meta-heuristic optimization method that combines the Henry Gas Solubility Optimization (HGSO) technique with symmetric chaotic systems. By leveraging the randomness of chaotic systems, the parameters of the HGSO algorithm that require random generation are produced through chaotic processes, allowing the algorithm to exhibit chaotic behavior in its pursuit of optimal values. This innovative approach is termed Chaotic Henry Gas Solubility Optimization (CHGSO), with the primary objective of enhancing the performance of the HGSO method. The randomness of the data obtained from chaotic systems was validated using NIST-800-22 tests. The CHGSO method was applied to both 47 benchmark functions and the optimization of parameters for a PID controller utilized in the speed control of a DC motor. To evaluate the effectiveness of the proposed method, it was compared with several widely recognized algorithms in the literature, including PSO, WOA, GWO, EA, SA, and the original HGSO algorithm. The results demonstrate that the proposed method achieved the best performance in 43 of the benchmark functions, outperforming the other algorithms. In the context of controller design, the PID parameters were optimized using the error-based ITSE objective function. According to the controller responses, the proposed method has achieved the best results in the simulation studies, with a settling time of 0.035 and a rise time of 0.014 without overshooting, and in the experimental studies, with a settling time of 0.15 and a settling time of 1.4%. When the results are examined, it is observed that it has achieved successful results in the controller design problem.

Performance analysis of DC-DC Buck converter with innovative multi-stage PIDn(1+PD) controller using GEO algorithm

Power electronic converters are widely used in various fields of electrical equipment. Due to their fast dynamics and non-linear nature, controlling them requires dealing with various complexities. Therefore, having a well-designed, high-speed, and robust controller is critical to ensure the effective operation of these devices. In a DC-DC converter, steady-state performance with minimum error and fast dynamic response relies on controller design. This paper presents the design of a multi-stage PID controller with an N-filter combined with a one plus proportional derivative (1+PD) controller. This controller illustrates fast tracking reference voltage; additionally, it shows incredible results when the DC-DC converter operates in different modes. The parameters of the proposed controller are effectively determined using the golden eagle optimization (GEO) algorithm. Furthermore, a comprehensive comparison between the proposed controller, proportional–integral–derivative (PID), and fractional order PID (FOPID) controllers, as well as different metaheuristic optimization methods in various conditions, has been conducted to demonstrate the effectiveness of the proposed controller. The behavior of the closed-loop system under different conditions has been thoroughly investigated. The superior time and frequency domain characteristics of the closed-loop system with the PIDn(1+PD) controller highlight its superiority over other controllers. The demonstrated enhancements in settling time, voltage regulation accuracy, and transient response emphasize the potential applicability of the proposed control strategy in real-world power electronics systems, particularly in scenarios requiring high efficiency, stability, and dynamic performance.

Heat energy utilization of a double-flash geothermal source efficiently for heating/electricity supply through particle swarm optimization method

The principal aim of this article is to optimize the thermal and electrical efficiency of a geothermal combined heat and power system through metaheuristic particle swarm optimization (PSO) method. The objective of this research is to conduct a thorough analysis of the incorporation of metaheuristic PSO technique, with a specific emphasis on the potential advantages and obstacles associated with the utilization of metaheuristic approaches in improving the effectiveness of geothermal energy systems. The utilization of a double-flash geothermal system in conjunction with a transcritical carbon dioxide Rankine cycle is utilized for the co-generation of electricity and thermal energy. The research utilized a PSO method to enhance power generation, heating capacity, and overall system efficiency. The PSO algorithm was employed to determine the optimum operational parameters for a pressure level of 820 kPa and a pressure ratio of 1.59, leading to the maximization of power output to 2591.4 kW The PSO algorithm effectively identified the optimal operational parameters as a pressure of 820 kPa and a pressure ratio of 1.59, resulting in the achievement of a peak power output of 2591.4 kW. The methodology has determined that a pressure of 916.4 kPa and a pressure ratio of 1.5 represent the optimal parameters for achieving a maximum heating capacity of 12329.1 kW.

A Comparative Study of Metaheuristic Feature Selection Algorithms for Respiratory Disease Classification.

The correct diagnosis and early treatment of respiratory diseases can significantly improve the health status of patients, reduce healthcare expenses, and enhance quality of life. Therefore, there has been extensive interest in developing automatic respiratory disease detection systems. Most recent methods for detecting respiratory disease use machine and deep learning algorithms. The success of these machine learning methods depends heavily on the selection of proper features to be used in the classifier. Although metaheuristic-based feature selection methods have been successful in addressing difficulties presented by high-dimensional medical data in various biomedical classification tasks, there is not much research on the utilization of metaheuristic methods in respiratory disease classification. This paper aims to conduct a detailed and comparative analysis of six widely used metaheuristic optimization methods using eight different transfer functions in respiratory disease classification. For this purpose, two different classification cases were examined: binary and multi-class. The findings demonstrate that metaheuristic algorithms using correct transfer functions could effectively reduce data dimensionality while enhancing classification accuracy.

Performance analysis of meta-heuristic optimization techniques for multi-objective VLSI circuit partitioning

Abstract The efficiency of various stages of physical design in the Very Large Scale Integration (VLSI) circuit can be enhanced by using multi-objective optimization techniques. The circuit is partitioned into a set of modules at the beginning of the physical design phase. This step is known as circuit partitioning. All subsequent physical design stages, like floor planning, placement, pin configuration, and routing etc, are influenced by the outcome of the circuit partitioning method being used. The efficiency of the partitioning method controls the quality of ultimate architecture. The efficiency achieved by the final product may be decreased by incorrect partitioning. This study compares the effectiveness of four Meta-heuristic optimization methods include the Genetic Algorithm (GA), Satin Bowered Bird (SBO), Particle Swarm Optimization (PSO), Simulated Annealing (SA) — in terms of number of net cut, duration of sleeping mode, and efficiency in power consumption for addressing the VLSI circuit partitioning problem. This experiment achieves K-way partitioning of the circuit that minimizes net cuts as well as maximizes sleep duration simultaneously, by evaluating optimization function. Solutions developed using GA, SBO and PSO consistently surpass those acquired using SA with respect to quality of optimal solution. The average optimum net cut and sleep duration achieved by this experiment are 10.7 and 9.9 in GA ; 11.5 and 12.3 in SBO, 11.80 and 9.10 in PSO; and 16.8 and 6.7 in SA based method respectively. This research resulted in a considerable reduction in power consumption, with the system’s average power efficiency achieved by 21.6%, 26.84%, 19.85%, and 14.62%, respectively, in GA, SBO , PSO, and SA based optimizations. The experimental results are compared with a recent publication and proposed GA, SBO, and PSO based methods achieve 18.75%, 4.17%, and 1.04% improvement in terms of average net cut respectively. The proposed GA, SBO, PSO and SA based methods also achieve 44.90%, 51.30%, 40.05%, and 18.60% improvement in terms of average power efficiency.

Intelligent cross-entropy optimizer: A novel machine learning-based meta-heuristic for global optimization

Machine Learning (ML) features are extensively applied in various domains, notably in the context of Metaheuristic (MH) optimization methods. While MHs are known for their exploitation and exploration capabilities in navigating large and complex search spaces, they are not without their inherent weaknesses. These weaknesses include slow convergence rates and a struggle to strike an optimal balance between exploration and exploitation, as well as the challenge of effective knowledge extraction from complex data. To address these shortcomings, an AI-based global optimization technique is introduced, known as the Intelligent Cross-Entropy Optimizer (ICEO). This method draws inspiration from the concept of Cross Entropy (CE), a strategy that uses Kullback–Leibler or cross-entropy divergence as a measure of closeness between two sampling distributions, and it uses the potential of Machine Learning (ML) to facilitate the extraction of knowledge from the search data to learn and guide dynamically within complex search spaces. ICEO employs the Self-Organizing Map (SOM), to train and map the intricate, high-dimensional relationships within the search space onto a reduced lattice structure. This combination empowers ICEO to effectively address the weaknesses of traditional MH algorithms. To validate the effectiveness of ICEO, a rigorous evaluation involving well-established benchmark functions, including the CEC 2017 test suite, as well as real-world engineering problems have been conducted. A comprehensive statistical analysis, employing the Wilcoxon test, ranks ICEO against other prominent optimization approaches. The results demonstrate the superiority of ICEO in achieving the optimal balance between computational efficiency, precision, and reliability. In particular, it excels in enhancing convergence rates and exploration-exploitation balance.

Exploring the potential of 5G uplink communication: Synergistic integration of joint power control, user grouping, and multi-learning Grey Wolf Optimizer

Non-orthogonal Multiple Access (NOMA) techniques offer potential enhancements in spectral efficiency for 5G and 6G wireless networks, facilitating broader network access. Central to realizing optimal system performance are factors like joint power control, user grouping, and decoding order. This study investigates power control and user grouping to optimize spectral efficiency in NOMA uplink systems, aiming to reduce computational difficulty. While previous research on this integrated optimization has identified several near-optimal solutions, they often come with considerable system and computational overheads. To address this, this study employed an improved Grey Wolf Optimizer (GWO), a nature-inspired metaheuristic optimization method. Although GWO is effective, it can sometimes converge prematurely and might lack diversity. To enhance its performance, this study introduces a new version of GWO, integrating Competitive Learning, Q-learning, and Greedy Selection. Competitive learning adopts agent competition, balancing exploration and exploitation and preserving diversity. Q-learning guides the search based on past experiences, enhancing adaptability and preventing redundant exploration of sub-optimal regions. Greedy selection ensures the retention of the best solutions after each iteration. The synergistic integration of these three components substantially enhances the performance of the standard GWO. This algorithm was used to manage power and user-grouping in NOMA systems, aiming to strengthen system performance while restricting computational demands. The effectiveness of the proposed algorithm was validated through numerical evaluations. Simulated outcomes revealed that when applied to the joint challenge in NOMA uplink systems, it surpasses the spectral efficiency of conventional orthogonal multiple access. Moreover, the proposed approach demonstrated superior performance compared to the standard GWO and other state-of-the-art algorithms, achieving reduced system complexity under identical constraints.

Application of multi-objective neural network algorithm in industrial polymerization reactors for reducing energy cost and maximising productivity

Optimization on an industrial scale is a complex task that involves fine-tuning the performance of large-scale systems and applications to make them more efficient and effective. This process can be challenging due to the increasing volume of work, growing system complexity, and the need to maintain optimal performance. Due to the significant power required for compression and the high costs of reactant materials, optimizing low-density polyethylene (LDPE) production to provide maximum productivity with a reduction of energy cost is required. However, it is not a simple process because the optimization problem of the LDPE tubular reactor consists of conflicting objective functions. Multi-objective neural network algorithm (MONNA) is a metaheuristic optimization method that provides a versatile and robust approach for solving complex, contradictory targets and diverse optimization problems that do not rely on specific mathematical properties of the problem. It is inspired by the structure and information-processing capabilities of biological neural networks. MONNA iteratively proposes solutions, evaluates its performance, and adjusts its approach based on feedback, which avoids complex mathematical formulations. In this work, we implement Multi-objective optimization neural network algorithm (MONNA) in LDPE tubular reactor for maximising productivity, conversion and minimising energy costs with three scenario of problem optimization, i.e. maximising productivity and reducing energy cost for the first problem (P1); increasing conversion and reducing energy costs for the second problem (P2); and increasing productivity and reducing by-products for the third problem (P3). The results show that the highest productivity, highest conversion, and lowest energy are 545.1 mil. RM/year, 0.314, and 0.672 mil. RM/year. The extreme points in the Pareto Front (PF) for various bi-objective situations provide practitioners with helpful information for selecting the best trade-off for the operational strategy. According to their preferences, decision-makers can use the resulting Pareto to decide on the most acceptable alternative. The decision variable plots show that both initiators in the reacting zone highly affected the optimal solution with the opposite action.

Integrated study of prediction and optimization performance of PBI-HTPEM fuel cell using deep learning, machine learning and statistical correlation

This paper uses 3D modeling and artificial intelligence methods to predict, and find optimal point in high-temperature proton exchange membrane (HTPEM) fuel cells. The main objective is to obtain maximum power and current density at the optimum node of the HTPEM fuel cell. The response surface method (RSM) is used to prevent excessive duplication and ensure adequate data coverage for determining input parameters. Also, for the first time, the correlation presented was compared with AI-based metaheuristic optimization methods i.e., including support vector regression (SVR), Gaussian process regression (GPR), and deep neural networks (DNN) with a dropout layer, alongside metaheuristic algorithms such as whale optimization algorithm (WOA), Grasshopper optimization algorithm (GOA), firefly algorithm (FF), and the genetic algorithm (GA). The results show that SVR, GPR, and DNN methods have excellent performance, with mean absolute percentage error (MAPE) of 0.81 % for DNN, 0.83 % for SVR, and 2.24 % for GPR. Most optimization algorithms exhibit errors below 8 %. The DNN-GOA, SVR-WOA, SVR-GA, and GPR-GOA algorithms have the lowest errors among them. Correlations have a lower computational cost for obtaining maximum power and current density at the optimum node compared to optimization algorithms, with a relative error of less than 6 % in most cases.

A modified particle swarm optimization-based adaptive maximum power point tracking approach for proton exchange membrane fuel cells

Fuel cells are one of the most promising renewable energy sources, offering advantages like reliability, eco-friendliness, and low pollutant emissions, which have spurred rapid advancements in power generation technologies. However, fuel cells face significant challenges, including high initial costs, limited fuel availability, and the difficulty of maintaining operation at the maximum power point, which hinders their use in stand-alone applications. In this paper, a Modified Particle Swarm Optimization (MPSO) method is proposed for maximum power point tracking (MPPT) to optimize the power output of Proton Exchange Membrane Fuel Cells (PEMFCs). The proposed method dynamically adjusts to key operational parameters such as cell temperature, hydrogen partial pressure, and membrane water content, areas that have not been comprehensively addressed in previous research. In this paper, an MPSO algorithm-based MPPT tracking approach without a PID controller is proposed to achieve the maximum power point (MPP) of a PEMFC. Under rapid temperature fluctuations in the fuel cell, the proposed MPSO MPPT method achieved a maximum power of 1223.5 W with an average of 5.66 iterations. In comparison, the meta-heuristic particle swarm optimization (PSO) method and the conventional perturb and observe (P&O) method achieved maximum power outputs of 1218.5 W and 1213.65 W, respectively, with PSO requiring 12.33 iterations. Additionally, the proposed approach showed improvements in power efficiency by 2.47 %, 2.87 %, and 13.58 % for the Jaya algorithm. demonstrating effective MPPT tracking under different operating conditions and perturbations. The MPSO method is implemented in the Simulink/MATLAB environment and is compared with the Perturb & Observe (P&O) and Conventional PSO (CPSO) methods. The results demonstrate that the proposed MPSO approach outperforms these traditional techniques in terms of tracking speed, efficiency, and stability under varying conditions. This successful implementation lays a strong foundation for future integration into real-world PEMFC systems.

Evaluation of metaheuristic optimization algorithms applied to path planning

The development of autonomous ground vehicles is a topic widely discussed by the international scientific community. Path planning for these robots is an essential element to achieving a satisfactory fulfillment of missions without human intervention. This work adopts and improves the metaheuristic optimization methods harmony search and ant colony optimization, developing strategies based on the enhanced harmony search and improved ant colony optimization to achieve short, collision-free paths for robot movement. A description of the original methods and improvement procedures is presented, and their performance in path planning is compared through simulation. Theoretical results are supported by simulated experiments, which highlight the situations in which each metaheuristic algorithm is preferable and the benefits they bring to the path planning strategy.

Predictive functional control for chamber pressure: A quantum simultaneous whale optimization approach

This study introduces a Constrained Predictive Functional Controller (CPFC) designed for regulating chamber pressure in a coke furnace. While the traditional controllers face challenges posed by the system’s complex multi-input multi-output (MIMO) structure, cross-coupling, time delays, physical constraints, and uncertainties, this article’s approach realized set-point tracking and disturbance rejection, addressing model mismatches while considering constraints on system inputs, input variations, and outputs. To tackle the constrained Model Predictive Control (MPC) optimization problem and minimize the cost function, the Quantum Simultaneous Whale Optimization Algorithm (QSWOA) is employed. This meta-heuristic optimization method integrates quantum coding and simultaneous search with the whale optimization algorithm, enhancing convergence speed and precision. Furthermore, the performance of the proposed CPFC-QSWOA controller is assessed through simulations of the chamber pressure control of a Coke furnace. Results demonstrate the superiority of the CPFC-QSWOA approach, showcasing high precision and robustness, particularly in the face of uncertainties and disturbances.

Continuous-time Hammerstein model identification utilizing hybridization of Augmented Sine Cosine Algorithm and Game-Theoretic approach

The widespread use of dynamic systems has greatly simplified various human-operated tasks. However, the complex and nonlinear nature of these systems has posed challenges in determining their structure due to heavy reliance on modeling for theoretical and empirical purposes in academic and practical contexts. This challenge is particularly evident in the Hammerstein model, which is well-known for its recognition of structural nonlinearity. To address the limitations of uncovering an optimized continuous-time Hammerstein model, researchers have explored the practical application of the Augmented Sine Cosine Algorithm-Game Theoretic (ASCA-GT). By combining the Game Theoretic (GT) and Sine Cosine Algorithm (SCA), this hybrid approach aims to achieve a nonlinear position-updated process for improved exploration and exploitation, while effectively overcoming issues like local optima trapping. The performance of ASCA-GT was evaluated using 13 benchmark functions and mathematical scenarios, as well as the Twin-Rotor System (TRS) and Electro-Mechanical Positioning System (EMPS). The effectiveness of the proposed technique was assessed using Wilcoxon's rank test, which confirmed the superior performance of ASCA-GT compared to other metaheuristic optimization methods in determining the continuous-time Hammerstein model.

Improving photovoltaic cell parameter calculations through a puffer fish inspired optimization technique

The precise estimation of solar PV cell parameters has become increasingly important as solar energy deployment expands. Due to the intricate and nonlinear characteristics of solar PV cells, meta-heuristic algorithms show greater promise than traditional ones for parameter estimation. This study utilizes the Puffer Fish (PF) meta-heuristic optimization method, inspired by male puffer fish's circular structures, to estimate parameters of a modified four-diode PV cell. The PF algorithm's performance is assessed against ten benchmark test functions, with results presented as mean and standard deviation for validation. Comparative analysis with Particle Swarm Optimization (PSO), Grey Wolf Optimization (GWO), Rat Search Algorithm (RAT), Heap Based Optimizer (HBO), and Cuckoo Search (CS) algorithms highlights PF's superior performance, achieving optimal solutions with minimal error of 7.8947E-08. Statistical tests, including Friedman Ranking (1st) and Wilcoxon's rank sum (3.8108E-07), confirm PF's superiority. The circular structures of male puffer fish serve as an effective model for optimization algorithms, enhancing parameter estimation. Benchmark tests and statistical analysis consistently underscore PF's superiority over other meta-heuristic algorithms. Future research should explore PF's potential applications in solar energy and beyond.

Solving the Travelling Salesman Problem Using the PSO Optimization

This article examines a potential solution to the well-known Travelling Salesman Problem (TSP), which is classified as an NP-hard problem. We also provide a theoretical synopsis of several approaches that have been employed to tackle this problem. A prominent example of a combinatorial problem is the traveling salesman problem (TSP). To address the fundamental PSO algorithm's premature convergence issue and stagnation behavior on TSP, a scout characteristic-based PSO algorithm is suggested.We address Particle Swarm Optimization (PSO), a member of the evolutionary methods class, and outline the methodology for applying PSO to the TSP. Among population-based metaheuristic optimization methods, Particle Swarm Optimization (PSO) is one of the most widely used. Scientific domains such as engineering, chemistry, medicine, advanced physics, and humanities have all effectively employed PSO. Numerous theoretical and empirical results on the convergence and parameterization of PSO versions have been produced as a result of the method's extensive investigation since its introduction in 1995. Hundreds of PSO versions have been developed. It is well recognized that population size has a significant impact on the effectiveness of metaheuristics; nevertheless, no comprehensive research has been done on the appropriate selection of PSO swarm size to date.Through the application of this approach, we examine the effects of various control settings. The ideal solution and the quality of the solution are contrasted.

Metaheuristic Optimization Methods in Energy Community Scheduling: A Benchmark Study

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