Multi-criteria assessment of optimization methods for controlling renewable energy sources in distribution systems
Ahmad Eid, Abdulrahman Alsafrani

TL;DR
This paper evaluates 20 optimization algorithms for renewable energy integration in power systems, ranking them based on performance metrics like power loss and execution time.
Contribution
A novel statistical evaluation of 20 metaheuristic optimization techniques using 10 performance measures across 10 distribution systems.
Findings
AEO, GWO, JS, PSO, MVO, BO, and GNDO algorithms ranked in the highest category (below 25%).
CStA, HHO, AOA, GOA, and AOS algorithms ranked in the lowest category (above 75%).
Algorithms achieved power losses of 87.164 kW and 71.644 kW for 33-bus and 69-bus systems, respectively.
Abstract
Numerous optimization techniques have recently been employed in the literature to enhance various electric power systems. Optimization algorithms help system operators determine the optimal location and capacity of any renewable energy source (RES) connected to a system, enabling them to achieve a specific goal and improve its performance. This study presents a novel statistical evaluation of 20 famous metaheuristic optimization techniques based on 10 performance measures. The performance measures comprise five power loss indices, three voltage profile indices, load flow calling frequency, and execution time. The evaluation involves 10 distribution systems of varying sizes to ensure an equitable comparison of the algorithm. The Friedman Ranking method evaluates algorithms based on performance metrics, yielding a specific score. Upon modeling all distribution systems, a composite ranking…
Genes, proteins, chemicals, diseases, species, mutations and cell lines named across the full text — each resolved to its canonical identifier and authoritative record.
Click any figure to enlarge with its caption.
Figure 10
Figure 11
Figure 12
Figure 13
Figure 14
Figure 15
Figure 16
Figure 17
Figure 18
Figure 19
Figure 1
Figure 20
Figure 21
Figure 22
Figure 23
Figure 24
Figure 25
Figure 26
Figure 2
Figure 3
Figure 4
Figure 5
Figure 6
Figure 7
Figure 8
Figure 9Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimal Power Flow Distribution · Smart Grid Energy Management · Electric Power System Optimization
Introduction
The global decline of fossil fuels and its detrimental effects on the environment and human health prompted the researcher to explore other energy sources, such as renewables, including solar and wind energy. Renewable energy sources (RESs) can be integrated into current distribution networks to alleviate the burden on transformers during peak demand periods. However, incorporating RESs may lead to increased losses in the system, a compromised voltage profile, decreased stability, or other shortcomings if not correctly chosen and connected. In this instance, the function of optimization techniques is realized^1–4^. The optimization algorithms can choose the correct place and size of any RES connected to a distribution system to achieve a specific objective, such as reducing system loss.
By providing a comprehensive understanding of their advantages and disadvantages, classifying optimization algorithms significantly improves the process of selecting the right one. It helps create solutions tailored to the specific needs of distribution systems. This systematic classification reduces the likelihood of incorrect rankings resulting from simplistic evaluations, allowing decision-makers to rely on a range of performance metrics. It also supports thorough assessments that consider practical challenges, ensuring the selected algorithms can effectively address real-world energy management problems. Furthermore, the classification framework facilitates the incorporation of new algorithms, thereby encouraging continuous improvements in selection methods. Ultimately, this structured approach promotes the adoption of more effective and efficient optimization strategies, resulting in improved energy management outcomes.
Literature review
Many optimization algorithms have been adopted in the literature to optimize different distribution systems. In a recent work^5^, the authors adopted a logarithmic version of PSO to reduce losses in the IEEE 34-bus unbalanced system microgrid. The authors compared the results of the logarithmic PSO to those of different algorithms in many case studies. In^6^, the spotted hyena optimizer (SHO) was used to minimize the effects of integrating electric vehicle (EV) charging stations into distribution systems with the help of distributed generations (DGs) and static synchronous compensators (SSCs). The study examined the loss, stability, and reliability of the 69-bus system within a multi-objective (MO) optimization framework. Additionally, the study included various case studies and comparisons between different algorithms. In a similar study^7^, the authors applied the MOPSO algorithm to place the PV generator into the 9- and 15-bus systems using time-domain simulation in MATLAB/Simulink to maximize the power factor and voltage profiles. In^8^, a hybrid algorithm combining Firefly and Spider Monkey optimization was employed to minimize the operational expenses of a 33-bus microgrid, which includes electric vehicles, wind turbines, and photovoltaic power units. Another study^9^ adopted the DAOA and PSO algorithms to optimally allocate DG units to flatten the demand of unbalanced distribution systems while enhancing power quality. The study included three unbalanced systems, each with 10, 13, and 37 buses. The DAOA and PSO algorithms were compared in different case studies, including performance indicators of unbalanced voltage, power, and current factors.
In a recent study^10^, the Crow Search Algorithm (CSA) enhanced the radial 33-bus system by strategically positioning capacitor units to improve network performance through loss reduction and stability enhancement. The authors evaluated the system’s performance against six additional algorithms: PSO, ABC, GA, TLBO, and IWO. The authors in^11^ applied modified JAYA and GA algorithms to optimize the 33-, 47-, and 69-bus systems by integrating DG, capacitor banks, V2G, and EV charging stations. The study included the costs of optimized units and system performance enhancement during multiple case studies. In a recent study^12^, The Bonobo optimizer was employed in both single and multi-objective optimization frameworks to alleviate the demand fluctuations of the 69-bus system utilizing existing batteries and photovoltaic sources. The system was optimized throughout the day to demonstrate battery charging and discharging scenarios. Furthermore, the demands of residential, commercial, and industrial sectors were considered. The Pareto optimal front was selected using MOBO case studies, and the fuzzy logic function, together with TOPSIS approaches, were employed to identify the most favorable compromise options.
The authors of^13^ synthesized immune algorithms, moth flame optimization, and evolutionary strategies to reduce power loss in the 69- and 118-bus systems. The study included various distributed generation (DG) forms, I, II, and III, with single and multiple units. The authors of^14^ adopted the SMA and other algorithms to optimally allocate EVCS into the 33- and 69-bus systems. The research sought to minimize system losses and improve voltage profile and stability. Various DG, DSTATCOM, and battery energy storage system (BESS) units were utilized to meet the demand for electric vehicle charging stations (EVCS). The SMA was evaluated against other CSA, BA, and AVOA algorithms across several case studies. In another study^15^, the Honey Badger Algorithm (HBA) governed the wind turbine-battery energy storage system (BESS) units integrated with the 69-bus system to optimally manage three electric vehicle charging stations (EVCS) located at distinct sites within the system. The HBA minimized daily energy loss despite the unpredictable demand of EVCS and the state of charge of batteries, while enhancing the voltage profile and stability of the system.
Meanwhile, the study^16^ focused on the optimal integration of PV and DSTATCOM into radial 33- and 69-bus systems using the MVO algorithm to reduce the annual costs of PV and DSTATCOM devices as well as the operational costs of the networks. A comparative analysis of system performance was conducted utilizing various algorithms, including MVO, CGO, PSO, CSA, and VSA. The authors in^17^ integrated PV solar resources into the 33-bus system using the MOSMA algorithm to achieve different objectives. The study aimed to optimize the voltage profile and penetration level while minimizing power losses. The study considered various photovoltaic units ranging from one to five, with penetration levels reaching up to 300%. The MOSMA results were compared to those obtained using the NSGA-II, JAYA, and MOPSO algorithms. Another study^18^ adopted the Gorilla Troop Optimizer (GTO) to control eight EVCS allocated within the 108-bus system equipped with five groups of PV-BESS and WT-BESS. With the stochastic demand of the system and the state of charge of the batteries during the day, the GTO regulated each battery’s power to maintain the voltage and other constraints within acceptable limits.
In a recent study^19^, the MOHHO optimized the 69- and 118-bus systems to enhance the voltage profile and reduce system losses. The authors adopted the simplest aggregation method for the MO problem-solving. A similar study^20^ adopted the MODA to minimize the power loss, voltage variations, and total investment of reactive power of the 30- and 69-bus systems integrated with DG and reactive power sources. In a different work^21^, the authors developed and implemented the Enhanced Equilibrium Optimizer (EEO) to efficiently distribute PV-BESS units within the 69-bus system to minimize daily and annual energy losses. The study encompassed the simulation of the system over four distinct days to illustrate the summer, winter, spring, and autumn seasons. The Northern Goshawk Optimization (NGO)^22^ regulated the reactive power compensation produced by switching capacitors in the 33-bus system integrated with photovoltaic sources. Power losses were minimized and regulated, and annual net savings were optimized across the four seasons of the year. The Zebra Optimization Algorithm (ZOA)^23^ regulated different DG types and capacities to reduce power losses and enhance the voltage stability of the 33-bus system. The study included different scenarios with single and multiple DG units and types. Another study^24^ adopted the MOMVO for optimal allocation of PV and wind turbines and BESS units into the 33- and 141-bus systems using parallel processing and the Pareto front technique. The study simulated the systems for three days in the summer, winter, and spring seasons. Statistical analyses were performed on the different case studies. Other studies dealt with optimization algorithms, and their use can be explored in many literature sources such as^25–29^. The adopted optimization algorithms are listed in Table 1, along with their parameters and constants, sources of inspiration, and the year and publication source.
The categorization of current optimization algorithms utilized in distribution systems is crucial for the progression of energy management and distribution. By classifying these algorithms according to multiple criteria instead of just rating them, researchers and practitioners can gain a thorough understanding of their advantages and drawbacks^30–33^. This method facilitates a detailed assessment that takes into account various measures and factors, including system losses, voltage profile, speed of execution, load flow calling frequency, voltage stability, and relevance to real-world distribution system challenges. Establishing a systematic classification framework enables the proper evaluation of various optimization algorithms, ensuring that the selection of an algorithm is tailored to the specific needs of a distribution system. This systematic method not only averts deceptive rankings but also promotes informed decision-making, resulting in more effective and efficient optimization techniques in distribution system management.
Table 1. Adopted algorithms with their properties.No.MethodParameters and constantsInspirationYearSourceRef.1PSO \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:w=1,\:{c}_{1}={c}_{2}=$$\end{document} 1.5Swarm theory2011Conf. ^34^ 2FPA \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:p=0.8,\:L,\:JK=rand$$\end{document} Pollination process of flowers2012Journal ^35^ 3GWO \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{r}_{1},{r}_{2},\:{c}_{1},\:{c}_{2},\:{c}_{2}=rand$$\end{document}
\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{A}_{1},{A}_{2},{A}_{3}=rand$$\end{document} Hunting mechanism of wolves in nature2014Journal ^36^ 4ALO \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{r,r}_{1},\:{r}_{2},\:{r}_{3}=rand$$\end{document} Nature-inspired behavior of ant lions2015Journal ^37^ 5DA \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:a,c,f,e,s=rand$$\end{document} Nature-inspired2016Journal ^38^ 6MVO \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{W}_{m}=0.2,\:{W}_{x}=1$$\end{document}
\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{r}_{1},\:{r}_{2},\:{r}_{3}=rand$$\end{document} Nature-inspired concepts in cosmology2016Journal ^39^ 7JAYA \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{{\varnothing}}_{1},\:{{\varnothing}}_{2}=rand$$\end{document} Mathematical based2016Journal ^40^ 8GOA \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:cMax=1,\:cMin=4\times\:{10}^{-5}$$\end{document} Nature-inspired by grasshopper swarms2017Journal ^41^ 9SSA \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{c}_{1},\:{c}_{2},\:{c}_{2}=rand$$\end{document} Nature-inspired behavior of salps2017Journal ^42^ 10AEO \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{r,r}_{1},\:{r}_{2},\:{r}_{3}=rand$$\end{document} , \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:a,\:u,\:v,\:c=rand$$\end{document} Nature-inspired2019Journal ^43^ 11HHO \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:r,q,e=rand$$\end{document} Nature-inspired behavior of Harris Hawks2019Journal ^44^ 12GNDO \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:a,b,c=rand$$\end{document} normal distribution model2020Journal ^45^ 13SMA \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:z=0.03$$\end{document}
\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:r,A,\:B=rand$$\end{document} Oscillation mode of slime mould in nature2020Journal ^46^ 14CGO \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:\alpha\:,\beta\:,\gamma\:=random$$\end{document} Chaos theory2021Journal ^47^ 15JS \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{A}_{r},\:j=rand$$\end{document} Nature-inspired behavior of jellyfish2021Journal ^48^ 16AOA \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:\alpha\:=5,\:\mu\:=0.5$$\end{document} Arithmetic operations2021Journal ^49^ 17AOS \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:L=4,\:f=0.1$$\end{document} Quantum mechanics2021Journal ^50^ 18CStA \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{r,r}_{1},\:{r}_{2},\:{r}_{3}=rand$$\end{document} Formation of crystal structures2021Journal ^51^ 19SPO \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{I}_{d1},{I}_{d2},{I}_{d3},{I}_{d4}=rand$$\end{document} Inspired by the art of painting colors2022Journal ^52^ 20BO \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:pm=0.03,\:cab=1.25,\:csb=1.3,\:tsg=0.05,\:,\:rcp=0.0035$$\end{document} Social behavior of Bonobos2022Journal ^53^
Research gap
The No Free-Lunch Theorem asserts that no universal algorithm can be optimal for all problems. As a result, researchers have utilized several optimization methodologies. Researchers often use an optimization strategy to decrease or maximize a specific objective, typically one, two, or at most three, regardless of other critical system or problem metrics. Increasing the integration of renewable sources in distribution systems may lead to increased system losses or reduced stability. An analysis of the literature in the previous section and other available sources reveals a deficiency in explicit guidance for applying optimization methods in distribution systems. Each author chooses one or more optimization techniques to tackle a specific problem or achieve a goal. Ultimately, the readers or decision-makers are unable to identify the most advantageous choice among them. This paper introduces a ranking approach for 20 optimization algorithms, based on 10 performance measures, to address this research gap. Algorithms are assessed for applicability and scalability across 10 distribution systems of varying sizes, including small, medium, and large feeder buses. The evaluation framework is based on the statistical Friedman Ranking approach.
Contribution
This study involved simulating, testing, and evaluating 20 algorithms. These algorithms encompass both traditional and contemporary methods utilized throughout various study domains, including power systems. The PSO algorithm is regarded as one of the oldest and most established algorithms, having emerged in 1995. The FPA and GWO were established in 2012 and 2014. The list comprises three algorithms introduced in 2015 (ALO, DA, MVO), two in 2017 (GOA, SSA), two in 2019 (AEO, HHO), five from 2020 (CGO, GNDO, JJS, SMA, SPO), and five from 2021 (AOA, AOS, BO, CStA, JAYA). These algorithms are selected due to their extensive application among power system researchers. The complete list of algorithms is simulated and evaluated according to 10 performance metrics utilizing the statistical method of Friedman Ranking. The 20 algorithms optimize 10 distribution systems, which range in size from 15 to 136 feeder buses, to assess several prominent systems and accurately rank the algorithms. The proposed technique evaluates the optimization algorithms for each distribution system, and a comprehensive assessment is also presented. The main contribution points of this work can be summarized as follows.
- Comprehensive Evaluation: This study uniquely simulates and analyzes twenty optimization algorithms, providing a robust comparison that encompasses both historical and cutting-edge techniques in the context of distribution systems.
- Diverse Performance Metrics: By employing ten performance metrics for the assessment, this research goes beyond the typical single or dual-objective evaluations found in existing literature, offering a multi-faceted view of algorithm performance.
- Scalable System Modeling: The evaluation is based on a diverse set of ten distribution systems, representing small, medium, and large-scale configurations. This approach enables a more comprehensive understanding of algorithm effectiveness across various operational contexts.
- Statistical Rigor: The application of the Friedman Ranking method provides a thorough and systematic assessment of the algorithms, consolidating results from various systems to deliver clear insights into their relative performance and robustness.
Performance metrics
Selecting an appropriate optimization technique is crucial for complex situations, such as optimizing electrical distribution systems. Numerous authors and researchers have employed algorithms to optimize or minimize objective functions, often dealing with two or more objectives simultaneously in multi-objective optimization. The effectiveness of an optimization algorithm should not be solely dictated by its ability to accomplish a singular objective. The selected algorithm must possess sufficient flexibility to achieve various objectives. The efficacy of an optimization method must be evaluated using many measures. Key characteristics include convergence rate, solution accuracy (as measured by the standard deviation of different solutions), voltage profile of the system, scalability, and the time required to optimize the system. By evaluating the algorithm’s performance across several criteria, researchers can select the most suitable optimization approach for a problem, such as enhancing an electrical distribution system, leading to more efficient and effective solutions. This study evaluates the optimization technique using 10 performance metrics. The Friedman Ranking conducts the evaluation. The subsequent section examines the performance metrics adopted. The algorithm optimizes the system to minimize power loss, while also considering other vital metrics in the ranking process.
Metrics of power losses
The power losses of a distribution system are calculated by summing the losses of the feeders due to their resistance and reactance^18,21,54^.
\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{P}_{L}=\sum\:_{i}^{{N}_{b}}{I}_{i}^{2}\times\:{R}_{i}$$\end{document} \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{Q}_{L}=\sum\:_{i}^{{N}_{b}}{I}_{i}^{2}\times\:{X}_{i}$$\end{document}Where \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{P}_{L}$$\end{document} , \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{Q}_{L}$$\end{document} are the real and reactive losses of the system; \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{R}_{i}$$\end{document} , \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{X}_{i}$$\end{document} are the branch resistance and reactance; \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{I}_{i}$$\end{document} is the ith branch current; \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{N}_{b}$$\end{document} is the number of branches.
After solving the system 50 times, the metrics of minimum, average, and maximum active loss ( \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{P}_{L,min}$$\end{document} , \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{P}_{L,ave}$$\end{document} , \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{P}_{L,max}$$\end{document} ) are obtained with its standard deviation ( \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:std$$\end{document} ). The minimization of the power loss is the objective function ( \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{f}_{obj}$$\end{document} ).
\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{f}_{obj}={P}_{L}$$\end{document}Metrics of reactive power losses
The metric of reactive loss is the average of the reactive loss of the 50 system simulations.
\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{Q}_{La}=\sum\:_{k=1}^{{N}_{rx}}{Q}_{L,k}/{N}_{rx}$$\end{document}Where \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{Q}_{L,k}$$\end{document} is the kth run reactive loss.
Metric of voltage deviation
The total voltage deviation (TVD) expresses how far the bus voltage is from the unity. As the algorithm runs 50 times, the average TVD is considered a performance metric^15,55,56^.
\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{TVD}_{a}=\sum\:_{k=1}^{{N}_{rx}}\sum\:_{i}^{{N}_{s}}\left|1-\left|{V}_{i}\right|\right|/{N}_{rx}$$\end{document}Where \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{N}_{s}$$\end{document} is the number of buses; \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{V}_{i}$$\end{document} is the ith bus voltage; \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{N}_{rx}$$\end{document} is the maximum number of runs (50).
Metric of voltage stability
The voltage stability index (SI) is calculated as follows^12,57–59^.
\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:SI=1-{\left[2\left({P}_{i}{R}_{i}+{Q}_{i}{X}_{i}\right)-{V}_{k}^{2}\right]}^{2}-4{S}_{i}^{2}{Z}_{i}^{2}$$\end{document} \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{SI}_{a}=\sum\:_{n=1}^{{N}_{rx}}{SI}_{n}/{N}_{rx}$$\end{document}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{Z}_{i}={R}_{i}+{jX}_{i}$$\end{document} , \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{S}_{i}={P}_{i}+{jQ}_{i}$$\end{document} (8)
Where \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{SI}_{a}$$\end{document} is the average of SI over the 50 runs; \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{Z}_{i}$$\end{document} is the complex impedance of the branch; \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{S}_{i}$$\end{document} is the complex power at the receiving end of the branch; \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{V}_{k}$$\end{document} is the voltage at the sending end of the branch.
Metric of minimum voltage
The minimum voltage metric is the average minimum voltage recorded during the 50 solutions of the system.
\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{V}_{La}=\sum\:_{k=1}^{{N}_{rx}}{V}_{L,k}/{N}_{rx}$$\end{document} \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{V}_{L}=\text{min}\left({V}_{i}\right),\:i=\text{1,2},\dots\:,\:{N}_{s}$$\end{document}Where \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{V}_{L,k}$$\end{document} is the minimum voltage of the kth run; \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{V}_{i}$$\end{document} is the voltage at the ith bus.
Metric of execution time
Execution time varies among algorithms. The shorter the execution time, the better. A faster algorithm allows for online operation monitoring. Additionally, fast algorithms can handle extensive data more efficiently with fewer resources compared to slower ones. In this study, the execution time is recorded over 50 runs for each algorithm on every system and used as a performance metric. Figure 1 displays a boxplot of execution times for 20 algorithms optimizing 10 distribution systems, arranged by median value. The first twelve algorithms (SMA, BO, GWO, SSA, JS, JAYA, MVO, AOA, PSO, FPA, AOS, and ALO) require, on average, under 8 min for 50 runs (less than 10 min for the medians). In contrast, the following five algorithms (HHO, GNDO, AEO, DA, and GOA) complete 50 runs across the 10 systems in an average of 20 min or less. Only the final three algorithms (CStA, CGO, SPO) require an average of 28 min or less for 50 runs per system across the 10 systems. In terms of average execution times, SMA is the fastest, while CGO is the slowest.
Fig. 1. Variation of the execution time of algorithms solving all distribution systems for 50 different runs.
Metric of load flow calling frequency
The load flow algorithm resolves the distribution system and, consequently, the objective functions. Algorithms differ based on their architecture and the frequency with which they invoke the objective function. Typically, an algorithm that executes fewer objective function calls operates more swiftly than one that invokes the objective function multiple times. The frequency of objective function evaluations for the 20 algorithms is presented in Fig. 2. Most known methods evaluate the objective functions twice. Four algorithms, namely DA, GWO, MVO, and SMA, invoke the objective function alone once. Conversely, AEO and JS algorithms require three evaluations to achieve the objective, but AOS and HHO necessitate four assessments of the objective function.
Fig. 2. Calling frequency of the objective function for each algorithm.
Proposed methodology of assessment
Numerous metaheuristic algorithms exist, and researchers continually innovate new varieties and hybrids to address diverse and challenging optimization problems. Moreover, many of them are adopted in the area of distribution systems when integrated with renewable energy sources. The assessment method follows a series of steps, as illustrated in Fig. 3. The 20 optimization algorithms are selected to optimize the performance of 10 distribution systems. The algorithms encompass a range of well-established and emerging algorithms. On the other hand, different distribution systems are simulated and optimized to assess the algorithms. The systems are available in small, medium, and large sizes. These systems are 15-, 22-, 33-, 51-, 69-, 85-, 94-, 108-, 118-, and 136-bus. The considered algorithms are listed, in alphabetical order, AEO, ALO, AOA, AOS, BO, CGO, CStA, DA, FPA, GNDO, GOA, GWO, HHO, JAYA, JS, MVO, PSO, SMA, SPO, and SSA. Each algorithm executes the system 50 times to facilitate statistical analysis and comparison, yielding more reliable statistical outcomes. Each execution involves invoking load flow solutions, setting the maximum number of iterations, and modifying algorithm parameters. All simulations aim to reduce the power loss in the distribution system. As a result, 50 values for the objective function are gathered to ascertain the statistical parameters, including the minimum, maximum, average, and standard deviation of power loss. Furthermore, six additional performance measures are documented: reactive loss, total voltage deviation (TVD), stability index (SI), minimum and maximum bus voltages within the system, and the duration required to complete the 50 runs.
Upon gathering data from all systems simulated by the various algorithms, the Friedman ranking method is employed to evaluate the 20 algorithms for each distribution system. The Friedman test is used to compare 20 algorithms that address the same system. The Friedman test output is normalized regarding the minimum value to determine the score of each algorithm. The assessment process establishes the hierarchy of each performance metric for every examined distribution system. The optimization algorithms are rated as A, B, C, or D, with A being the highest quality and D the lowest. The optimization algorithm is assigned an A score for rankings under 25%, a B score from 25% to 50%, a C score from 50% to 75%, and a D score from 75% but under 100%. The algorithmic score varies across different systems. Consequently, a method that achieves an A score for one system does not ensure the same score when applied to a different system. The ultimate ranking of each algorithm is contingent upon the scores obtained from the 10 distribution systems. The 20 algorithms are categorized under four classifications: Excellent, Very Good, Good, and Fair. The classifications are derived from the aggregate and kind of scores obtained by the algorithm from the 10 performance metrics of the 10 distribution systems. A flow chart displaying the complete solution steps, ranking, and classification processes is shown in Fig. 4. The suggested methodology includes three distinct loops. The innermost loop operates on the load flow solution of the distribution system.
The variables \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{N}_{C}$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{N}_{LF}$$\end{document} are the current and the maximum number of load flow calling routines. The intermediate loop examines the presumed quantity of iterations. The variables \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{N}_{it}$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{N}_{itmax}$$\end{document} are the current iteration and the maximum number of iterations. The outermost loop spans the number of execution times that the algorithm executes. The variable \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{N}_{r}$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{N}_{rmax}$$\end{document} are the current and maximum number of runs. Upon completing the 50 runs, the system data are compiled, and statistics are computed for each method to determine the lowest, maximum, average, and standard deviations of the power loss. Additional performance indicators are also gathered. The subsequent phase involves computing the Friedman ranking and the scores of the algorithms. In the final stage, the classifications of the 20 algorithms are shown according to the performance scores attained using the 10 distribution methods.
Fig. 3. Layout of the proposed assessment methodology.
Fig. 4. Flow chart of the proposed methodology.
Simulations and observations
This section evaluates 20 optimization methods in simulating 10 distribution systems of varying sizes: small, medium, and large. The evaluation procedure relies on 10 quantified parameters representing the mean performance values from 50 runs of each algorithm. Every algorithm runs for 100 iterations and is considered the maximum iteration number with a population of 100 agents. Furthermore, each algorithm’s 50 runs are conducted five times, with the optimal result selected and documented. This study encompasses 10 distribution systems: the 15, 22, 33, 51, 69, 85, 94, 108, 118, and 136 bus systems. The evaluation of the optimization techniques is predicated on the mean of the performance metrics, including the minimum, average, and maximum power loss, their standard deviation, reactive power loss, total voltage deviation (TVD), stability index (SI), minimum bus voltage, duration of 50 iterations, and the frequency of load flow calls. As time is used as a performance metric, all simulations are run on MATLAB on the same laptop with the following specifications: Windows 11, Core i7, 2 GHz processor, and 8 GB RAM, running a 64-bit operating system. The ranking of each performance metric is calculated using the rank function, where values are ranked from lowest to highest. The average is considered whenever two or more ranks have the same value. After ranking all metrics, the total ranking of the algorithm is calculated, and the score is returned. In the following sections, all systems are considered and explored.
Performance of the 15-bus system
The 15-bus distribution system is the smallest system studied in this research. The system has a total demand of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:1226.4+\:j1251.1785$$\end{document} kVA^60^ with a rated voltage of 11 kV, the system has a layout as shown in Fig. 5. The 20 algorithms optimize the system by integrating two DGs to reduce the losses to a minimum. The performance metrics are recorded and ranked. The performance metrics for the system, along with other information, are listed in Table 2. Besides the 10-performance metrics, Table 2 shows the upper voltage limit ( \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{V}_{U}$$\end{document} ), the optimal DG sizes and sites. It is worth mentioning here that the optimal sites of DGs are the most common sites of the 50 runs of each algorithm. Also, the listed time is for the completion of the 50 runs. The \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:std$$\end{document} refers to the standard deviation of the power loss of the 50 solutions. \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{P}_{L,min}$$\end{document} , \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{P}_{L,ave}$$\end{document} , \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{P}_{L,max}$$\end{document} refer to the minimum, average, and maximum power losses during the 50 runs while \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{Q}_{L}$$\end{document} is the reactive losses. The table arranges all algorithms according to their ranking and scores, with the best at the top.
The percentage ranking is calculated from 200 (10 systems times 20 algorithms), and the normalized ranking of the algorithms is shown in Fig. 6. Notably, the best algorithm has the lowest normalized ranking, which is zero. In contrast, the worst algorithm has a normalized ranking of 100%. Thus, the MVO algorithm achieved the best score among the 20 algorithms, while the AOS algorithm is the worst. The algorithms MVO, GWO, SSA, PSO, ALO, GNDO, and AEO have attained a score of (A) Algorithms AEO, DA, AYA, BO, and FPA are ranked in second place, achieving a score of (B) The algorithms CGO, CStA, SPO, and HHO attained a third-place ranking with a score of (C) The algorithms with the lowest rank, receiving a score of D, include SMA, GOA, AOA, and AOS.
Fig. 5. Layout of the 15-bus system.
Table 2. Performance parameters of the 15-bus system with different algorithms.Method \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{\varvec{P}}_{\varvec{L},\varvec{m}\varvec{i}\varvec{n}}$$\end{document} (kW) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{\varvec{P}}_{\varvec{L},\varvec{a}\varvec{v}\varvec{e}}$$\end{document} (kW) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{\varvec{P}}_{\varvec{L},\varvec{m}\varvec{a}\varvec{x}}$$\end{document} (kW) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:\varvec{S}\varvec{t}\varvec{d}$$\end{document}
\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{\varvec{Q}}_{\varvec{L}}$$\end{document} (kVar) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:\varvec{T}\varvec{V}\varvec{D}$$\end{document} (pu) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:\varvec{V}\varvec{S}\varvec{I}$$\end{document} (pu) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{\varvec{V}}_{\varvec{L}}$$\end{document} (pu) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{\varvec{V}}_{\varvec{U}}$$\end{document} (pu)Time(min)MVO33.25133.25133.2510.0E + 0030.2920.3360.1290.965111.07GWO33.25133.25133.2510.0E + 0030.2920.3360.1290.965111.07SSA33.25133.25133.2510.0E + 0030.2920.3360.1290.965111.12PSO33.25133.25133.2510.0E + 0030.2920.3360.1290.965111.43ALO33.25133.25133.2510.0E + 0030.2920.3360.1290.965111.72GNDO33.25133.25133.2510.0E + 0030.2920.3360.1290.965112.28JS33.25133.25133.2510.0E + 0030.2920.3360.1290.965111.24AEO33.25133.25133.2515.07E-1630.2920.3360.1290.965112.46DA33.25133.35035.1446.2E-0330.3790.3350.1290.965318.93JAYA33.25133.25133.2510.0E + 0032.0750.3460.1300.965011.13BO33.25133.26634.0331.8E-0330.3050.3360.1290.965111.27FPA33.25133.28033.4315.5E-0430.3230.3370.1300.965111.19CGO33.25133.25133.2510.0E + 0041.2330.4660.1580.956816.50CStA33.25133.25733.2871.1E-0431.5900.3560.1320.964314.63SPO33.25133.36835.3377.6E-0333.2870.3340.1310.964715.14HHO33.25133.39835.1946.8E-0330.4090.3390.1300.964912.09SMA33.25133.52635.7311.1E-0250.2460.5630.1840.949411.39GOA33.25734.12836.6591.3E-0230.9860.3470.1300.964819.71AOA33.30535.58637.7381.9E-0232.3720.3820.1380.962511.23AOS33.25834.46036.3841.5E-0235.9530.4090.1460.960411.39
Table 2 shows the results of 20 optimization methods. Each method is evaluated based on parameters such as minimum, average, and maximum power loss, standard deviation, reactive power loss, convergence time, TVD, and the lower and upper voltage limits across 50 runs. The results indicate that while some methods produce similar outcomes, there are performance differences among various optimization techniques. This suggests that each method has its strengths and weaknesses in system optimization. The minimal standard deviation values imply that the methods tend to converge to nearly the same result in each run. MVO and GWO are the fastest algorithms, completing 50 runs in 1.07 min. Conversely, the slowest are DA and GOA, taking 8.93 and 9.71 min, respectively. The upper voltage limit remains constant at 1.0 pu for all methods. The lower voltage values are nearly identical, except for the SMA and CGO algorithms.
Fig. 6. Ranking of algorithms and their scores with the 15-bus system.
Performance of the 22-bus system
The 22-bus system has a total demand of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:662.311+j657.4$$\end{document} kVA^61^ with a rated voltage of 11 kV, its schematic layout is shown in Fig. 7. The system is optimized with two DGs using the 20 algorithms to minimize the system loss. The performance metrics, along with other parameters, are listed in Table 3. The algorithms’ percentage rankings and scores are calculated and shown in Fig. 8. It is observed that the GWO method is superior, achieving an A score with a normalized rank of zero, indicating the lowest rank. In this system, three algorithms attained a rating below 25%: GWO, FPA, and AEO. The algorithms ranked second-best with a score of B include PSO, GNDO, MVO, SPO, SSA, JAYA, BO, JS, DA, ALO, and SMA. The algorithms CStA, CGO, and HHO attained a C score, whereas GOA, AOA, and AOS received the lowest score of D.
Fig. 7. Layout of the 22-bus system.
Table 3. Performance parameters of the 22-bus system with different algorithms.Method \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{\varvec{P}}_{\varvec{L},\varvec{m}\varvec{i}\varvec{n}}$$\end{document} (kW) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{\varvec{P}}_{\varvec{L},\varvec{a}\varvec{v}\varvec{e}}$$\end{document} (kW) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{\varvec{P}}_{\varvec{L},\varvec{m}\varvec{a}\varvec{x}}$$\end{document} (kW) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:\varvec{S}\varvec{t}\varvec{d}$$\end{document}
\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{\varvec{Q}}_{\varvec{L}}$$\end{document} (kVar) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:\varvec{T}\varvec{V}\varvec{D}$$\end{document} (pu) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:\varvec{V}\varvec{S}\varvec{I}$$\end{document} (pu) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{\varvec{V}}_{\varvec{L}}$$\end{document} (pu) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{\varvec{V}}_{\varvec{U}}$$\end{document} (pu)Time(min)GWO8.4688.4688.4685.09E-074.3320.1250.0230.990411.59FPA8.4688.4728.4844.49E-034.3340.1250.0230.990411.65AEO8.4688.4688.4687.00E-154.3320.1250.0230.990412.79PSO8.4688.4738.5141.51E-024.3350.1250.0240.990511.8GNDO8.4688.4738.5141.39E-024.3350.1250.0240.990512.9MVO8.4688.4828.5142.16E-024.3400.1260.0240.990711.48SPO8.4688.4778.5141.85E-024.8000.1030.0210.99231.00036.50SSA8.4688.4808.5142.01E-024.3390.1260.0240.990611.41JAYA8.4688.4688.4681.68E-054.4510.1330.0250.989711.34BO8.4688.4848.5142.15E-024.3400.1260.0240.990711.55JS8.4688.4688.4683.69E-054.4270.1300.0250.990111.37DA8.4688.4848.5442.04E-024.3410.1250.0240.990719.31ALO8.4688.4798.5202.06E-024.3380.1260.0240.990612.09SMA8.4688.4688.4681.62E-076.3030.2210.0420.983111.84CStA8.4688.4728.4824.01E-034.4360.1270.0260.99101.00015.31CGO8.4688.4688.4685.67E-156.3540.2470.0480.98071.00015.74HHO8.4688.4958.5632.53E-024.3460.1270.0250.990812.50GOA8.4698.5328.6445.06E-024.3650.1270.0250.9907111.47AOA8.4968.6448.9459.59E-024.4220.1330.0260.990211.49AOS8.4688.5518.6544.94E-025.0910.1460.0300.98921.00011.76
Examining Table 3 highlights several key points. According to the findings, there are variations in performance among the various optimization strategies, despite specific methods producing results that are comparable to one another. It can be deduced from this that every strategy has both advantages and disadvantages when it comes to optimizing the system. The very low standard deviation values suggest that the methods tend to converge to nearly the same result in each run. JAYA is the fastest algorithm, completing 50 runs in 1.34 min. In contrast, DA and GOA are the slowest, taking 9.31 and 11.47 min, respectively. The upper voltage limit remains steady at 1.0 pu for all methods except for four algorithms, which have slightly higher values. The lower voltage values are nearly identical.
Fig. 8. Ranking of algorithms and their scores with the 22-bus system.
Performance of the 33-bus system
The third studied system is the 33-bus system shown in Fig. 9. The system has a total demand of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:3715+j2300$$\end{document} kVA and a rated voltage of 12.66 kV^62^. The algorithms optimize the system using two DGs to minimize the system loss and run 50 times. The performance parameters are recorded and listed in Table 4. The percentage ranking and scores of the algorithms are shown in Fig. 10. The algorithms for the A score in this system include GWO, MVO, PSO, JS, and AEO. Nine algorithms scored second-place B: GNDO, SPO, BO, SSA, ALO, FPA, DA, JAYA, and SMA. Thirdly, three algorithms exhibit a C score: CGO, CStA, and HHO. Three algorithms, GOA, AOA, and AOS, occupy the lowest rank of score D.
Fig. 9. Layout of the 33-bus system.
Table 4. Performance parameters of the 33-bus system with different algorithms.Method \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{\varvec{P}}_{\varvec{L},\varvec{m}\varvec{i}\varvec{n}}$$\end{document} (kW) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{\varvec{P}}_{\varvec{L},\varvec{a}\varvec{v}\varvec{e}}$$\end{document} (kW) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{\varvec{P}}_{\varvec{L},\varvec{m}\varvec{a}\varvec{x}}$$\end{document} (kW) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:\varvec{S}\varvec{t}\varvec{d}$$\end{document}
\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{\varvec{Q}}_{\varvec{L}}$$\end{document} (kVar) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:\varvec{T}\varvec{V}\varvec{D}$$\end{document} (pu) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:\varvec{V}\varvec{S}\varvec{I}$$\end{document} (pu) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{\varvec{V}}_{\varvec{L}}$$\end{document} (pu) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{\varvec{V}}_{\varvec{U}}$$\end{document} (pu)Time(min)GWO87.16487.16487.1643.30E-0559.7730.6770.1200.968512.06MVO87.16487.16487.1642.93E-0659.7730.6770.1200.9685112.17PSO87.16487.16487.1648.87E-1459.7730.6770.1200.9685112.56JS87.16487.16487.1648.11E-0859.7730.6770.1200.9685112.16AEO87.16487.16487.1647.06E-1459.7730.6770.1200.968514.98GNDO87.16487.16587.2481.20E-0259.7730.6770.1200.968414.27SPO87.16487.16487.1645.04E-1473.0720.6550.1260.966211.002711.80BO87.16487.17087.2482.32E-0259.7730.6770.1210.968212.39SSA87.16487.17787.2483.13E-0259.7720.6770.1220.9678512.50ALO87.16487.19987.2484.22E-0259.7710.6780.1250.966812.85FPA87.16487.30287.5689.99E-0259.9080.6750.1250.966912.26DA87.16487.24888.4191.97E-0159.8300.6740.1230.9673111.66JAYA87.16487.16487.1654.46E-0474.6130.8610.1800.950781.00052.05SMA87.16487.16487.1644.04E-07102.1401.2390.2250.936181.00042.30CGO87.16487.16487.1675.48E-0497.5311.1230.2420.93251.003610.85CStA87.16487.28387.4477.88E-0267.0550.7490.1530.95891.000510.25HHO87.16488.59092.7331.80E + 0061.0120.6840.1350.9640713.90GOA87.16689.58597.8592.48E + 0061.7640.6870.1410.9623110.14AOA87.63192.97498.9442.78E + 0064.6910.6980.1460.961012.37AOS87.34490.57397.9842.53E + 00101.8300.9310.1960.94621.00943.08
Upon closer inspection, Table 4 reveals several essential features. It can be deduced from this that every strategy has both advantages and disadvantages when it comes to optimizing the system. The extremely low values of the standard deviation indicate that the approaches tend to converge to nearly the same outcome in every application, except for the HHO, GOA, AOA, and AOS algorithms. JAYA and GWO are the algorithms that finish 50 runs in 2.05 and 2.06 min, making them the quickest algorithms. DA and SPO, on the other hand, are the slowest algorithms, taking 11.66 and 11.80 min, respectively. Except for six algorithms, which have somewhat higher values, the upper voltage limit remains constant at 1.0 pu for all approaches. The values of the lower voltage are almost identical, except for CGO and SMA, which achieve lower values, as reflected in the TVD values.
Fig. 10. Ranking of algorithms and their scores with the 33-bus system.
Performance of the 51-bus system
The 51-bus system is rated at 11 kV with a total demand of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:2463+j1569$$\end{document} kVA^63^. The system’s layout is shown in Fig. 11. Optimizing the system involves assigning two DGs to distinct algorithms to reduce the amount of power lost across the system whenever possible. The statistical calculations are performed by each method 50 times, as many times as they were before. Table 5 lists the components that contribute to system performance. In the 51-bus system, seven algorithms have achieved a score under 25%. The ideal algorithms, listed in descending order, are GWO, JS, AEO, MVO, FPA, PSO, and GNDO, each attaining an A score, as shown in Fig. 12. The algorithms DA, BO, SPO, JAYA, SSA, and ALO received second place with a score of B. The C scoring algorithms are CGO, CStA, SMA, and HHO. Ultimately, the AOA, GOA, and AOS algorithms occupy the lowest rank, having attained the lowest score of D.
Fig. 11. Layout of the 51-bus system.
Table 5. Performance parameters of the 51-bus system with different algorithms.Method \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{\varvec{P}}_{\varvec{L},\varvec{m}\varvec{i}\varvec{n}}$$\end{document} (kW) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{\varvec{P}}_{\varvec{L},\varvec{a}\varvec{v}\varvec{e}}$$\end{document} (kW) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{\varvec{P}}_{\varvec{L},\varvec{m}\varvec{a}\varvec{x}}$$\end{document} (kW) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:\varvec{S}\varvec{t}\varvec{d}$$\end{document}
\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{\varvec{Q}}_{\varvec{L}}$$\end{document} (kVar) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:\varvec{T}\varvec{V}\varvec{D}$$\end{document} (pu) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:\varvec{V}\varvec{S}\varvec{I}$$\end{document} (pu) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{\varvec{V}}_{\varvec{L}}$$\end{document} (pu) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{\varvec{V}}_{\varvec{U}}$$\end{document} (pu)Time(min)GWO64.52364.60965.7103.00E-0141.8711.4280.18150.950814.89JS64.52364.52364.5241.97E-0441.5361.4220.18220.950615.20AEO64.52364.52364.5232.12E-1441.5361.4230.18220.9506110.19MVO64.52364.81165.7104.56E-0142.1881.4360.18150.950815.01FPA64.52664.70665.2031.50E-0141.8271.4280.18240.950615.19PSO64.52364.71765.7104.12E-0142.1291.4320.18100.950915.40GNDO64.52364.58265.3151.53E-0141.6661.4280.18270.9505110.03DA64.52364.79565.9143.96E-0142.0231.4350.18240.9505115.72BO64.52364.76665.7103.92E-0142.0541.4370.18270.950516.11SPO64.52364.92165.7104.77E-0149.7441.3400.17920.95141.009721.09JAYA64.52364.54164.8074.94E-0251.2451.6820.22610.93711.00115.02SSA64.52364.84065.7104.24E-0142.2101.4420.18280.950415.07ALO64.52365.01465.9144.99E-0143.0261.4490.17940.951316.14CGO64.52364.52364.5233.12E-0872.1332.1650.28190.91941.000620.97CStA64.52864.62464.9379.52E-0248.2701.5330.18870.94831.002921.00SMA64.52364.80965.7104.18E-0175.1262.0910.25860.926415.15HHO64.52365.07667.2027.07E-0142.4721.4430.18290.950418.94AOA64.59668.52072.9012.06E + 0045.0641.4970.18980.948315.10GOA64.55866.07770.7731.23E + 0043.6221.4790.18320.9501130.29AOS64.57566.23269.0901.31E + 0061.5701.8120.23490.93401.00315.44
Table 5 reveals several critical characteristics upon closer examination. The approaches tend to converge to virtually the same outcome in every application, except the AOA, GOA, and AOS algorithms, as indicated by the extremely low values of the standard deviation. The fastest algorithms are GWO, MVO, JAYA, SSA, and AOA, in that order. GOA, on the other hand, is the slowest method, with an execution time of 30.29 min, respectively. The upper voltage limit for all approaches remains constant at 1.0 pu, except for five algorithms that have slightly higher values. The lower voltage values are nearly identical, except for CGO and SMA, which exhibit lower values, as evidenced by the TVD values.
Fig. 12. Ranking of algorithms and their scores with the 51-bus system.
Performance of the 69-bus system
The 12.66 kV 69-bus system has a total demand of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:3801.89+j2694.10$$\end{document} kVA^64^, as shown in Fig. 13. The implemented algorithms reduce power loss by efficiently allocating two DGs. The algorithms execute 50 times for statistical analysis; the performance metrics are detailed in Table 6. The percentage rankings and scores of the algorithms are calculated and listed in Fig. 14. It is noted that the JS, AEO, BO, GNDO, and GWO algorithms have achieved the highest scores of (A) The second position is allocated to the FPA, PSO, MVO, DA, JAYA, ALO, and SSA algorithms, each receiving a score of (B) The SMA, SPO, CStA, and CGO algorithms rank third with a score of (C) The fourth position is held by the lowest-ranked algorithms, HHO, GOA, AOA, and AOS, each receiving a score of D.
Fig. 13. Layout of the 69-bus system.
Table 6. Performance parameters of the 69-bus system with different algorithms.Method \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{\varvec{P}}_{\varvec{L},\varvec{m}\varvec{i}\varvec{n}}$$\end{document} (kW) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{\varvec{P}}_{\varvec{L},\varvec{a}\varvec{v}\varvec{e}}$$\end{document} (kW) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{\varvec{P}}_{\varvec{L},\varvec{m}\varvec{a}\varvec{x}}$$\end{document} (kW) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:\varvec{S}\varvec{t}\varvec{d}$$\end{document}
\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{\varvec{Q}}_{\varvec{L}}$$\end{document} (kVar) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:\varvec{T}\varvec{V}\varvec{D}$$\end{document} (pu) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:\varvec{V}\varvec{S}\varvec{I}$$\end{document} (pu) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{\varvec{V}}_{\varvec{L}}$$\end{document} (pu) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{\varvec{V}}_{\varvec{U}}$$\end{document} (pu)Time(min)JS71.64471.64471.6445.67E-1435.9280.4990.0820.978917.50AEO71.64471.64471.6444.26E-1435.9280.4990.0820.9789114.69BO71.64471.88874.4636.31E-0135.9740.5100.0820.978917.48GNDO71.64471.81474.4636.76E-0135.9700.5060.0820.9789116.23GWO71.64472.04874.5671.01E + 0036.0410.5170.0820.978818.32FPA71.74172.45973.9364.63E-0136.2050.5130.0820.978918.54PSO71.64472.01078.9611.49E + 0036.0530.5110.0840.978318.77MVO71.64472.51378.9611.92E + 0036.1980.5310.0850.977917.92DA71.64473.06574.7031.39E + 0036.3310.5620.0820.9788115.20JAYA71.64471.65371.9193.89E-0261.1510.7870.1690.95371.00567.84ALO71.64472.92778.0531.52E + 0036.2720.5570.0830.978619.48SSA71.64473.13178.9612.11E + 0036.3540.5560.0850.978017.04SMA71.64472.10078.9611.76E + 0056.6840.9130.1580.956518.05SPO71.64472.04574.5671.00E + 0046.9690.6050.1160.96921.004532.19CStA71.65972.57374.8627.44E-0141.3010.6430.1010.97341.001132.00CGO71.64471.70074.4633.99E-0185.4881.4080.2690.92401.007238.72HHO71.65174.27183.1662.81E + 0036.7670.5890.0890.9770113.39GOA71.93678.58584.6253.82E + 0038.4850.6680.1040.97281.000117.57AOA73.65484.381102.1606.40E + 0041.0980.7250.1130.97051.00079.23AOS72.19379.06187.0594.02E + 0061.0560.9180.1830.94971.00369.17
After inspecting Table 6 for the 69-bus system, it is observed that the power losses vary among some algorithms, reflected in other parameters such as TVD and VSI. The AOA algorithm has the highest power loss of 84.38 kW, while many other algorithms reach only 71.64 kW. The upper voltage remains constant at 1.0 pu except for seven algorithms. The lower voltages are above 0.95 pu except for the CGO and AOS methods. Some algorithms, like SSA, BO, and JS, show fast convergence; others, such as CGO, SPO, and CStA, are very slow.
Fig. 14. Ranking of algorithms and their scores with the 69-bus system.
Performance of the 85-bus system
The 11 kV 85-bus system has a total demand of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:2570.28+j2622.08$$\end{document} kVA^65^, as shown in Fig. 15. The system consists of many interconnected sub-branches. As in previous cases, the system is optimized by allocating two DGs using different algorithms to minimize system loss. The performance metrics from the 50 runs are documented in Table 7, and the ranking with scores is shown in Fig. 16. With this system, five algorithms achieve the A score: JS, SSA, DA, FPA, and GWO. The most effective algorithms are JS and SSA, whilst the least effective is AOS. Eight algorithms received a score of B, three attained a score of C, and four received the lowest score of D.
Fig. 15. Layout of the 85-bus system.
Table 7. Performance parameters of the 85-bus system with different algorithms.Method \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{\varvec{P}}_{\varvec{L},\varvec{m}\varvec{i}\varvec{n}}$$\end{document} (kW) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{\varvec{P}}_{\varvec{L},\varvec{a}\varvec{v}\varvec{e}}$$\end{document} (kW) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{\varvec{P}}_{\varvec{L},\varvec{m}\varvec{a}\varvec{x}}$$\end{document} (kW) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:\varvec{S}\varvec{t}\varvec{d}$$\end{document}
\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{\varvec{Q}}_{\varvec{L}}$$\end{document} (kVar) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:\varvec{T}\varvec{V}\varvec{D}$$\end{document} (pu) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:\varvec{V}\varvec{S}\varvec{I}$$\end{document} (pu) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{\varvec{V}}_{\varvec{L}}$$\end{document} (pu) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{\varvec{V}}_{\varvec{U}}$$\end{document} (pu)Time(min)JS156.40156.40156.403.14E-0495.8373.1570.2050.944217.14SSA156.40156.40156.401.35E-1395.8363.1570.2050.944219.97DA156.40156.58157.012.24E-0195.9413.1090.2030.9448114.57FPA156.40156.90157.733.65E-0196.0873.1680.2050.944118.92GWO156.40157.11165.272.43E + 0096.2053.1960.2080.943416.88AEO156.40156.67158.794.86E-0195.9813.1690.2020.9450117.44ALO156.40157.64159.849.73E-0196.6413.2180.1970.946518.44BO156.40157.34158.791.03E + 0096.5063.2130.1990.9461110.92JAYA156.40156.40156.412.37E-03116.6604.3080.2620.92621.00026.98GNDO156.40157.00165.272.00E + 0096.1313.1960.2080.9434118.50MVO156.40157.64165.273.11E + 0096.4813.2250.2100.942817.45SPO156.40157.75165.272.89E + 00108.8002.9140.2020.94521.000438.02PSO156.40157.43165.272.84E + 0096.3683.2100.2090.943119.55CStA156.40156.52156.891.13E-01103.2503.5730.2280.9369129.76CGO156.40156.40156.401.07E-13143.6005.8190.3390.90081.000329.54SMA156.40156.58165.271.25E + 00137.0405.1040.3000.912717.15HHO156.40159.27170.494.40E + 0097.2053.2630.2130.9417113.45GOA156.40163.34174.275.50E + 0098.9963.3410.2170.9406115.08AOA159.50166.89176.123.75E + 00101.6903.6280.2240.938217.06AOS157.38162.49170.453.46E + 00123.1004.1240.2630.92561.00077.50
Upon examining Table 7 for the 85-bus system, it is noted that power losses differ across various algorithms, as indicated by other characteristics such as TVD and VSI. The AOA algorithm exhibits the most significant power loss at 166.89 kW, whilst numerous other algorithms attain a maximum of just 156.40 kW. The top voltage remains fixed at 1.0 pu, except for four methods. The lower voltages exceed 0.93 pu, except for the JAYA, CGO, SMA, and AOS techniques. The CGO attains the lowest minimum voltage of 0.9008 pu, while ALO reaches the greatest voltage of 0.9465 pu. Certain algorithms, such as GWO, JAYA, and AOA, demonstrate rapid convergence, but others, like SPO, CGO, and CStA, have significantly slower convergence rates.
Fig. 16. Ranking of algorithms and their scores with the 85-bus system.
Performance of the 94-bus system
The 94-bus system has a total demand of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:4797+j2323.9$$\end{document} kVA with a rated voltage of 15 kV^66^, shown in Fig. 17. The system has many branches and is optimized by allocating four DGs distributed optimally among the system buses. The system performance with different algorithms is listed in Table 8. The ranking of the algorithms and their scores is shown in Fig. 18. Five algorithms, JS, AEO, GNDO, PSO, and MVO, have attained a first rank of under 25% with a score of (A) Three algorithms, BO, SPO, and GWO, have attained a second-place rating with a score of (B) Three other algorithms were assigned a score of C: JAYA, ALO, and SSA. The algorithms with the lowest rankings include SMA, DA, CGO, GOA, AOS, FPA, CStA, HHO, and AOA, all of which received a score of D.
Fig. 17. Layout of the 94-bus system.
Table 8. Performance parameters of the 94-bus system with different algorithms.Method \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{P}_{L,min}$$\end{document} (kW) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{P}_{L,ave}$$\end{document} (kW) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{P}_{L,max}$$\end{document} (kW) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:Std$$\end{document}
\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{Q}_{L}$$\end{document} (kVar) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:TVD$$\end{document} (pu) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:VSI$$\end{document} (pu) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{V}_{L}$$\end{document} (pu) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{V}_{U}$$\end{document} (pu)Time(min)JS68.1768.1768.200.00888.953.460.2040.944616.82AEO68.1768.1968.590.09288.943.460.2040.9445116.03GNDO68.1768.2369.280.19188.993.460.2040.9445112.77PSO68.1768.3672.460.61788.983.470.2040.944417.16MVO68.1768.7872.491.27689.113.480.2060.943816.78BO68.1768.6272.491.17689.033.470.2060.943916.27SPO68.1768.2872.460.634141.783.030.2030.94481.014829.80GWO68.1769.0972.981.49389.313.490.2070.943716.96JAYA68.2068.4469.020.19594.643.540.2100.942616.99ALO68.1770.0475.501.86489.953.490.2070.943519.67SSA68.1770.1374.501.77890.063.510.2080.943316.91SMA68.1769.5772.491.929277.896.230.3430.897116.93DA68.3170.5074.951.72690.213.510.2110.9423120.23CGO68.1768.5772.461.168205.995.560.3160.90821.003731.21GOA68.7573.0579.582.42592.233.510.2050.9441125.15AOS68.2269.7073.141.405135.413.780.2330.93501.0038.72FPA70.9873.9576.681.60993.463.610.2180.940417.49CStA68.9171.0973.851.096106.813.840.2290.9369130.84HHO68.4772.9686.893.41092.113.540.2090.9430111.92AOA70.7176.0090.563.53794.913.480.2160.941019.35
Optimizing the 94-bus system with 20 algorithms and evaluating the performance metrics from 50 runs, as shown in Table 8, reveals different characteristics and observations. It is observed that power losses vary among the algorithms, as reflected by metrics like TVD and VSI. The AOA algorithm shows the highest power loss at 76.0 kW, while many other algorithms have a maximum just below 68.5 kW. The top voltage remains steady at 1.0 pu, except for three methods (SPO, CGO, and AOS). Most methods maintain lower voltages above 0.93 pu. The SMA records the lowest minimum voltage at 0.8971 pu, while SPO reaches the highest voltage at 0.9448 pu. Certain algorithms, such as BO, show rapid convergence, whereas others, like SPO, CGO, and CStA, exhibit significantly slower convergence rates.
Fig. 18. Ranking of algorithms and their scores with the 94-bus system.
Performance of the 108-bus system
The 108-bus system is shown in Fig. 19 and has a total demand of 12,132 + j9099 kVA with a rating voltage of 11 kV^67^. The system comprises numerous branches linked to the substation bus. The system is optimized by strategically assigning four DGs utilizing the 20 algorithms at ideal locations and sizes. Each algorithm is executed 50 times for statistical analysis, and the system behavior is presented in Table 9. The percentage ranking and scores are calculated and shown in Fig. 20. The algorithms PSO, BO, AEO, and JS have attained the highest ranking, receiving a score of A. B-score algorithms occupy the second position, including GWO, MVO, GNDO, and SMA. The third position is allocated to the SPO, ALO, JAYA, GOA, DA, SSA, and CGO algorithms, with a score of C. The algorithms with the lowest rankings are AOA, FPA, AOS, CstA, and HHO, with a score of D and ascending order.
Fig. 19. Layout of the 108-bus system.
Table 9. Performance parameters of the 108-bus system with different algorithms.Method \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{P}_{L,min}$$\end{document} (kW) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{P}_{L,ave}$$\end{document} (kW) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{P}_{L,max}$$\end{document} (kW) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:Std$$\end{document}
\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{Q}_{L}$$\end{document} (kVar) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:TVD$$\end{document} (pu) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:VSI$$\end{document} (pu) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{V}_{L}$$\end{document} (pu) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{V}_{U}$$\end{document} (pu)Time(min)PSO306.73309.80311.951.26156.322.300.1450.960519.69BO306.73310.21312.391.38156.452.300.1450.960519.89AEO306.73308.19311.281.63155.732.280.1450.9605117.64JS306.77310.41312.381.02156.782.310.1450.960518.33GWO309.42317.35341.418.37161.142.360.1450.96051.00019.01MVO310.33316.17325.303.57160.092.330.1460.96041.00017.96GNDO306.73313.17356.009.09158.492.320.1450.9605115.47SMA306.73309.64311.281.29221.182.860.2120.93961.00929.80SPO306.73309.81312.391.37191.162.340.1660.95391.027733.42ALO309.63321.65361.9212.99164.002.300.1460.96041.000210.35JAYA309.53313.54322.722.67197.222.360.1850.94841.00798.84GOA311.90335.70381.5219.74158.492.320.1450.9605125.57DA309.63324.37363.0415.20167.892.350.1470.9602123.18SSA313.81331.88368.4114.22173.102.410.1460.96051.00029.64CGO306.73310.25311.951.39267.022.930.3210.90551.015133.42AOA326.71373.50395.7014.47189.372.150.1580.95681.01048.74FPA315.08333.36355.919.42169.012.420.1580.95701.001611.02AOS309.58321.46341.637.11236.562.440.2320.93321.036410.58CStA316.43334.23357.989.17206.252.380.1790.95031.006842.97HHO311.64344.77388.3421.08180.652.380.1520.95841.000815.95
Optimizing the 108-bus system using 20 algorithms and evaluating performance metrics over 50 runs, as shown in Table 9, reveals various features and insights. Power losses vary among the algorithms, indicated by measures such as TVD and VSI. The AOA algorithm exhibits the highest power loss at 373.5 kW, whereas many other algorithms have a power loss of approximately 310.0 kW. The maximum voltage remains above 1.0 pu for most of the algorithms, but the value doesn’t exceed 1.05 pu. Most methods maintain voltages above 0.96 pu. The CGO records the lowest lower voltage at 0.9055 pu. Some algorithms, such as MVO, exhibit rapid convergence, whereas others, including SPO, CGO, and CStA, demonstrate noticeably slower convergence rates.
Fig. 20. Ranking of algorithms and their scores with the 108-bus system.
Performance of the 118-bus system
The 118-bus system has many primary and secondary branches, as shown in Fig. 21. The system has a total demand of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:22709.720+j17041.068$$\end{document} kVA and a rating voltage of 11 kV^68^. As a large-scale system, it is optimized by allocating four DGs. The system is simulated using the 20 algorithms, and the performance metrics are listed in Table 10. The percentage ranking and scores of the algorithms are shown in Fig. 22. Seven algorithms achieved a score below 25% of the A score. The GNDO is the most effective algorithm, while the CStA is the least effective. Seven algorithms, GNDO, JS, PSO, BO, AEO, GWO, and DA, are ranked first with an overall rating of A. Five algorithms are ranked second with a score of B, whereas two are ranked third with a score of C. The six lowest-ranked algorithms each received a score of D.
Fig. 21. Layout of the 118-bus system.
Table 10. Performance parameters of the 118-bus system with different algorithms.Method \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{P}_{L,min}$$\end{document} (kW) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{P}_{L,ave}$$\end{document} (kW) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{P}_{L,max}$$\end{document} (kW) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:Std$$\end{document}
\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{Q}_{L}$$\end{document} (kVar) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:TVD$$\end{document} (pu) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:VSI$$\end{document} (pu) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{V}_{L}$$\end{document} (pu) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{V}_{U}$$\end{document} (pu)Time(min)GNDO616.16617.12618.880.67470.052.820.1670.9541121.00JS616.16616.30617.050.18469.502.820.1670.9540113.50PSO616.16616.51617.890.65468.332.830.1670.9541127.04BO616.16617.86623.692.33467.722.860.1680.9541112.60AEO616.16616.48618.720.64468.852.830.1670.9541123.62GWO616.57619.68627.102.62470.642.860.1680.9540110.93DA616.17622.33646.435.10468.282.850.1670.9547119.90JAYA616.16617.32620.431.13507.153.090.2230.93731.000312.15ALO616.33621.39633.984.33470.322.880.1730.9526113.75MVO617.13624.96646.544.85472.092.910.1730.9529112.73SMA616.16618.34627.743.39584.363.380.2340.9327111.31AOA633.95643.95695.239.79466.652.800.1790.9513110.83SPO616.16617.75627.742.69576.253.230.2520.92671.009844.24FPA626.56639.32658.697.79480.932.980.1940.9467112.30CGO616.16618.33627.743.42791.024.440.3840.88501.005653.93GOA617.12641.42743.7629.71482.382.950.1990.9448126.13SSA622.35648.70695.7815.16505.113.240.2050.9430113.20AOS616.88622.97635.103.93680.203.710.3400.89981.008613.38HHO618.57646.29694.9120.79494.863.100.1970.9457119.14CStA624.35636.09650.285.76573.563.370.2630.92541.00152.18
The 118-bus system has more branches than previous systems. Optimizing the 118-bus system using 20 algorithms and evaluating performance metrics over 50 runs, as listed in Table 10, reveals various features and insights. Power losses vary among the algorithms and are reflected in measures such as TVD and VSI. Most of the standard deviation of power loss is greater than unity and may reach 29.71 for the case of the GOA algorithm. The SSA algorithm exhibits the highest power loss at 648.70 kW, whereas many other algorithms have a power loss of approximately 620.0 kW. The maximum voltage remains at 1.0 pu for most of the algorithms; some voltages exceed 1.0 pu but are still under 1.05 pu. Most methods maintain voltages above 0.95 pu for the lower voltage value. The CGO records the lowest lower voltage at 0.8850 pu. Some algorithms, such as GWO, exhibit rapid convergence, whereas others, including SPO, CGO, and CStA, demonstrate noticeably slower convergence rates.
Fig. 22. Ranking of algorithms and their scores with the 118-bus system.
10. Performance of the 136-bus system
The 136-bus system has eight main branches and other sub-branches, as shown in Fig. 23. The system demand is \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:18314.177+\:j7932.533$$\end{document} kVA with a rated voltage of 13.8 kV^69^. The most extensive 136-bus system is optimized by four distributed generators utilizing the selected 20 algorithms. Each method is executed 50 times for statistical validity, addressing the stochastic characteristics of optimization algorithms. Table 11 presents the system performance. Figure 24 represents the ranking and scores of the 20 methods. Five algorithms, BO, AEO, MVO, PSO, and GWO, have attained the highest rating of below 25% with a score of A. The JS and SMA algorithms secured a score of B, placing them in second position. The algorithms ALO, FPA, SPO, SSA, AOA, DA, and GNDO are ranked third, but the algorithms JAYA, CGO, CStA, and GOA HHO and AOS are ranked lowest with a score of D.
Fig. 23. Layout of the 136-bus system.
Table 11. Performance parameters of the 136-bus system with different algorithms.Method \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{P}_{L,min}$$\end{document} (kW) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{P}_{L,ave}$$\end{document} (kW) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{P}_{L,max}$$\end{document} (kW) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:Std$$\end{document}
\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{Q}_{L}$$\end{document} (kVar) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:TVD$$\end{document} (pu) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:VSI$$\end{document} (pu) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{V}_{L}$$\end{document} (pu) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\:{V}_{U}$$\end{document} (pu)Time(min)BO143.61143.68146.990.48299.962.210.140.9637110.86AEO143.61143.62143.920.04299.812.210.140.9637120.13MVO143.61145.06149.832.01303.142.240.140.963519.11PSO143.61144.61149.791.77302.172.230.140.963719.82GWO143.62146.21152.172.36305.852.260.140.963819.37JS143.87147.41149.511.18307.722.270.140.9625110.70SMA143.61144.06148.621.23450.142.630.180.95141.000111.04ALO143.72147.75157.693.11308.732.270.140.9629112.68FPA148.52153.11159.622.38318.002.270.140.9638110.59SPO143.61143.92149.791.01434.342.350.180.95241.004737.93SSA143.92149.45160.253.37312.572.310.140.962319.12AOA159.40169.50188.727.07345.702.250.130.9650110.55DA143.66150.21160.303.79313.932.270.140.9623121.26GNDO143.84149.12154.472.87311.232.330.140.9618119.66JAYA146.68150.00153.731.85482.282.620.190.94951.00449.25CGO143.61145.52152.812.71616.472.780.230.93531.005847.25CStA147.11151.56158.562.32368.272.420.160.95851.000342.77GOA145.45156.14173.497.48325.352.320.140.9624129.30HHO144.17152.37170.725.57318.902.310.150.9603115.93AOS145.21150.18156.872.52464.892.510.190.94871.002911.26
The 136-bus system possesses the largest branches among all systems. The optimization of the 136-bus system utilizing 20 algorithms and assessing performance metrics throughout 50 runs, as detailed in Table 11, uncovers diverse characteristics and insights. Power losses differ across algorithms and are reflected by metrics such as TVD and VSI. The majority of the standard deviation of power loss exceeds one and may attain a value of 7.48 in the case of the GOA algorithm. The AOA method demonstrates the most significant power loss at 169.5 kW, while numerous other algorithms exhibit a power loss of around 145.0 kW. The maximum voltage is consistently 1.0 pu for the majority of algorithms; however, certain values exceed 1.0 pu but remain below 1.05 pu. Most methods sustain voltages over 0.96 pu for the lower voltage threshold. The CGO registers the minimum lower voltage as 0.9353 pu. Certain algorithms, such as MVO, exhibit rapid convergence, whereas others, including SPO, CGO, and CStA, have significantly slower convergence rates.
Fig. 24. Ranking of algorithms and their scores with the 136-bus system.
Overall ranking of optimization algorithms
The execution times of the 20 algorithms for each studied distribution system are gathered and displayed in the box plot of Fig. 25. Increasing the system size has the effect of increasing the solution time of the optimization, and this increase is in proportion to the system size. Some systems have some outliers, indicating the different behaviors of the algorithms in solving the same distribution system.
According to the No-Free-Lunch Theorem, all optimization methods perform equally well when their performance is averaged across all potential issues. This was discovered by analyzing the performance of all algorithms. It gives the impression that no one optimization algorithm outperforms all others. If one algorithm performs better than another on a particular category of problems, it will perform worse on a different category of data. The effect of the No-Free-Lunch theorem is applied here in this work; some of the 20 algorithms perform well, and others do not. If A, B, C, and D scores equal 1, 2, 3, and 4, then the scores the algorithm has achieved with all studied systems are summed, as listed in Fig. 26. The total score of each algorithm is obtained as a numerical value, and then its final rank is calculated.
The 20 algorithms are categorized into four classifications depending on their rankings: Excellent, Very Good, Good, and Fair. The 20 algorithms are ordered according to a normalized total achievement score derived from optimizing the 10 studied systems based on the 10 performance parameters. The algorithms AEO, GWO, JS, PSO, MVO, BO, and GNDO rank in the highest or ‘Excellent’ category. The ALO, DA, FPA, SSA, JAYA, and SPO algorithms are classified in the second-best category of ‘Very Good’. SMA and CGO algorithms are ranked third in the ‘Good’ category. The lowest ‘Fair’ algorithms include CStA, HHO, AOA, GOA, and AOS. All algorithms within each category are organized in increasing order (from best to worst).
The current work, which employs 20 optimization algorithms, is compared to published studies for the 33- and 69-bus systems, as shown in Table 12, regarding the power loss values. These two systems are chosen because they are well-known and frequently studied by researchers. For the 33-bus system, the power loss of 87.164 kW in the current work is comparable to or lower than those reported in most published studies. The same trend is observed for the 69-bus system. The power loss in the current work remains fairly stable at 71.644 kW across most optimization methods. These case studies illustrate the behavior of the adopted optimization algorithms within the proposed methodology and demonstrate the effectiveness of the approach in optimizing any distribution system, regardless of size or complexity.
Fig. 25. Execution time of the distribution systems solved by all optimization algorithms.
Fig. 26. Overall assessment and categories of the optimization methods.
Table 12. Comparison of published and current works for the 33- and 69-bus systems.33-bus system69-bus systemMethodPower loss (kW)MethodPower loss (kW)Published workAEO^59^87.164AEO^59^69.396HGWO^70^87.164MINLP^71^69.676PSO^72^91.300IA^73^70.239MINLP^71^87.167HGWO^70^69.425EA-OPF^74^87.17GAMS^75^72.090Hybrid^76^87.28MTLBO^77^69.539PSO^76^87.17HPSO^64^87.00IA^73^87.55SOS^78^69.428BSOA^79^89.34BFOA^80^75.238Current workAEO87.164AEO71.644GWO87.164GWO71.644JS87.164JS71.644PSO87.164PSO71.644MVO87.164MVO71.644BO87.164BO71.644GNDO87.164GNDO71.644ALO87.164ALO71.644DA87.164DA71.644FPA87.164FPA71.741SSA87.164SSA71.644JAYA87.164JAYA71.644SPO87.164SPO71.644SMA87.164SMA71.644CGO87.164CGO71.644CStA87.164CStA71.659HHO87.164HHO71.651AOA87.631AOA73.654GOA87.166GOA71.936AOS87.344AOS72.193
Conclusions
The study involves the assessment and categorization of 20 established and innovative optimization algorithms utilized in the optimization of renewable energy sources inside distribution systems. The proposed evaluation method employs the Friedman ranking algorithm across 10 performance metrics, including indices related to power loss, voltage profile, execution time, and frequency of load flow calls. To ensure equitable assessment, all algorithms simulate 10 distribution systems, obtaining ratings depending on their efficacy. All algorithms are systematically categorized as Excellent, Very Good, Good, and Fair. The Excellent category (First-best) has seven algorithms: AEO, GWO, JS, PSO, MVO, BO, and GNDO. The Very Good category includes the ALO, DA, FPA, SSA, JAYA, and SPO algorithms. Additionally, the Good category includes the SMA and CGO algorithms, whilst the lowest category (Fair) consists of the CStA, HHO, AOA, GOA, and AOS algorithms. The proposed evaluation method helps distribution system operators and decision-makers select a suitable optimization methodology tailored to their specific needs and performance objectives. Specific optimization algorithms exhibit suboptimal performance yet still achieve high rankings, as illustrated by GNDO and SPO. Algorithms classified in the Excellent category have low execution durations. Most algorithms invoke the objective function twice. Therefore, the choice of a particular optimization method should not depend solely on one or two objectives.
Future work can include the following recommendations:
- Parameter sensitivity study: This can help in understanding the robustness of the algorithms.
- Real-world application: Validate the performance of the top-ranked algorithms in real-world scenarios to assess their practical applicability and performance under more complex conditions.
- Hybrid algorithms: Explore the potential of hybridizing the top-performing algorithms to leverage the strengths of multiple approaches and potentially achieve enhanced performance.
- Dynamic optimization: Investigate the adaptability of the optimization algorithms to dynamic and changing conditions within distribution systems.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1Salgotra, R., Sharma, P., Raju, S. & gandomi, A. H. A contemporary systematic review on Meta-heuristic optimization algorithms with their MATLAB and python code reference. No 3 Springer Neth.3110.1007/s 11831-023-10030-1 (2024).
- 2Usman, G., Jonas, M. & Frey, D. A methodology for multi-criteria assessment of renewable integrated energy supply options and alternative HVAC systems in a household. Energy Build.273 (112397). 10.1016/j.enbuild.2022.112397 (2022).
- 3Picanço, A. F., de Souza, A. C. Z. & Oliveira, A. P. Natural logarithm particle swarm optimization for loss reduction in an Island power system. Methods X 1310.1016/j.mex.2024.102924 (2024).10.1016/j.mex.2024.102924 PMC 1138736639263359 · doi ↗ · pubmed ↗
- 4Yuvaraj, T., Arun, S., Suresh, T. D. & Thirumalai, M. Minimizing the impact of electric vehicle charging station with distributed generation and distribution static synchronous compensator using PSR index and spotted hyena optimizer algorithm on the radial distribution system, e-Prime - Adv. Electr. Eng. Electron. Energy, vol. 8, p. 100587, 10.1016/j.prime.2024.100587 (2023).
- 5Pramila, V., Kannadasan, R., Rameshkumar, B. J. T., Alsharif, M. H. & Kim, M. K. Smart grid management: Integrating hybrid intelligent algorithms for microgrid energy optimization, Energy Rep.12, 2997–3019, 10.1016/j.egyr.2024.08.053 (2024).
- 6Eid, A. & Alsafrani, A. Dynamic arithmetic optimization algorithm control of distributed generations for demand balancing and enhancing power quality of unbalanced distribution systems. Sci. Rep.14 (1), 31648. 10.1038/s 41598-024-80432-z (2024).10.1038/s 41598-024-80432-z PMC 1168609739738191 · doi ↗ · pubmed ↗
- 7Mathenge, S. W., Mharakurwa, E. T. & Mogaka, L. Voltage enhancement and loss minimization in a radial network through optimal capacitor sizing and placement based on Crow Search Algorithm, Energy Rep.12, 4953–4965 10.1016/j.egyr.2024.10.062 (2024).
- 8Abdullah, A. et al. October., Effect of multi-unit and multi-type DG installation using integrated optimization technique in distribution power system planning, Alexandria Eng. J.107, 895–914 10.1016/j.aej.2024.09.006 (2023).
