Abstract
Optimal Reactive Power Dispatch (ORPD is thought of as a noncontinuous, nonlinear global optimization problem. Within the system’s constraints, the ORPD manages to accomplish the reactive power flow. Due to its more intricate linkage of variables, the reactive power issue is more challenging to resolve than the optimum power flow issue. With the existence of renewable energy resources (RERs), solving the ORPD problem to attain the most stable and secure system condition has become a more challenging task. The goal of this article is to solve the objective function of ORPD combined with RERs using a metaheuristic novel optimizer named the African Vultures Optimization Algorithm abbreviated by (AVOA), where the formulation of the ORPD issue including minimization of three single objective functions as follows, voltage deviation, system operating cost, and real power loss, is introduced and also transmission power loss minimization is embraced with the simultaneous incorporation of the optimal renewable energy resources (RERs). Where the ORPD problem complexity grows exponentially with a mixture of continuous and discrete control variables, two distinct continuous and discrete types of optimization variables are considered, and the proposed single objective functions that meet different operating constraints are then transformed into a coefficient multi-objective ORPD problem and elucidated using the weighted sum approach. To validate the suggested algorithm’s effectiveness in addressing the ORPD issue, it is evaluated on three standard IEEE networks: the IEEE-30 bus small-scale network, the IEEE-57 bus medium-scale network, and the IEEE-118 bus large-scale network using different scenarios and the outcomes are compared to these other popular optimization techniques. The findings show that the suggested AVOA algorithm provides an efficient and sturdy high-quality solution for tackling ORPD situations and vastly enhances the overall system performance of power at all scales.
1. Introduction
The perfect and optimal solution to one of the most critical problems in the planning and operation of electric power systems known as (ORPD) takes great attention and continuous efforts and has piqued the interest of researchers due to its critical role in modern energy management systems, where ORPD is an optimum reactive power distribution in the power system that minimizes a predetermined objective function while accommodating a variety of constraints [1,2].
To accomplish these objectives, the optimal adaptation of specified control variables such as transformer tapping settings, generator buses’ voltages, and reactive power resource distribution, such as the VAR shunt compensator, is needed. Once the problem of ORPD is resolved, the equality constraints and the inequality constraints are kept inside their permissible operational bounds [3,4].
Renewable energy resources, such as wind energy, solar energy, and microturbine generators have helped lower system power losses while also enhancing power system security and dependability during the previous decade. Furthermore, RESs have a significant influence on the energy market since they must specify the system’s required reactive power to achieve the specified objective functions [5].
The optimization of reactive power issues deals mainly with an objective to minimalize the absolute value of total voltage deviation (TVD) leading to enhancement in the voltage profile, the reduction of reactive power cost, and reduction of the electric network active power losses (Ploss), consequently, reducing the total operating cost. Therefore, (TVD), (Cost), and (Ploss) minimization have thus been selected as the study’s objective functions. In recent decades, several approaches with excellent convergence characteristics, such as (DP) (IPM), (LP), and (QP) have been developed and employed to address the ORPD issue. These approaches can alternatively be classified as traditional optimization methods or mathematical optimization methods. However, these approaches have certain limits and obstacles when dealing with discrete variables and non-differentiable objective functions in ORPD. One of the most negative aspects of these approaches is that they necessitate many iterations of numbers and extensive calculations, so taking a lot of time to provide answers without rounding and assumptions leading to municipal perfect solutions. As a result, these strategies were unable to cope with non-linear and complicated situations such as the ORPD issue. As an outcome, more modern optimization methods have been continuously developed and, as a consequence, there are a large variety of optimization solvers used in various power system applications, such as the ORPD issue, leading to improvements in the downsides of traditional techniques for determining ORPD solutions [5,6,7]. Recently, metaheuristic scheme exploitation and development have proven successful results in resolving optimum RPD issues [2].
Table 1 shows what has been accessed and searched recently on the topic of ORPD problems, where many optimization algorithms are being used for solving the ORPD issues, which include various single objective functions such as minimizing voltage deviation, decreasing active power loss, voltage stability index improvement, minimizing operating cost, minimizing fuel cost, L-index, emission, and combining many objectives as a multi-objective function [8].
Table 1.
Optimization Methods for ORPD Problem Solution.
Based on the recent research papers listed in Table 1, which is concerned with and addresses the subject of ORPD research, some of the details on which the research choices were based and the most important points of motivation for research in these selected aspects were listed, based on the identification of the most common study aspects as percentages of the total research papers in the table, estimated at (40 research papers).
From the side of the study relating to the validation test system, there are (12) research papers, with a percentage of (30%) based on the IEEE 14—Bus System; there are (36) research papers with a percentage of (90%) based on the study of the IEEE 30—Bus System, (2) research papers with a percentage of (5%) based on the IEEE 39—Bus System, (19) research papers with a percentage of (47.5%) based on the IEEE 57—System, (12) research papers with a percentage of (30%) based on the IEEE 118—Bus System, and there is only (1) research Paper with a percentage of (2.5%) based on the IEEE 300—Bus System. Therefore, the aspects of the study were chosen according to the three highest aspects according to the IEEE (30, 57, and 118) bus validation test systems.
The study according to the optimization objective functions was identified and selected with the same approach, there are (40) research papers with a percentage of (100%) based on active power loss minimization, (30) research papers with a percentage of (75%) based on voltage deviation minimization, (12) research papers with a percentage of (30%) based on voltage stability index improvement, (2) research papers with a percentage of (5%) based on cost minimization, and there is only (1) research paper with a percentage (2.5%) based on emission minimization. Other than specifying the cost minimization, the aspects of the study were chosen according to the highest aspects of the study including active power loss minimization and voltage deviation. Thus, three aspects of the study were selected as single- and multi-optimization objective functions.
The suggested AVOA algorithm is implemented on the IEEE standard testing power systems of the IEEE (30, 57, and 118) bus in this article to showcase its efficiency in resolving the ORPD problem. The analyzed objective functions in this research are the minimization of active power loss, the system’s overall operating cost minimization, and total voltage deviation minimization. According to the simulation findings, the AVOA algorithm is more capable, and all results confirm that it is more convenient than the compared suggested metaheuristic algorithms.
In summary, the following are the primary contributions of this research:
- The African Vultures Optimization Algorithm (AVOA) is proposed for the first time to solve a real-world optimization problem such as the ORPD problem.
- In the AVOA, vulture populations are designed with a Levy mutation, which can help to avoid falling into the local minima.
- The suggested AVOA is used to divide the optimization problem into three distinct objective functions (voltage deviation, operating cost, and power loss) as single- and multi-optimization objective functions considering continuous and discrete types of optimization control variables.
- The standard IEEE (30-bus, 57-bus, and 118-bus) testing systems are employed in this research to analyze the impact and demonstrate the consistency of the suggested AVOA algorithm to reach the near-optimal solutions to the self-posed problem and its application scalability on a challenging testing process from the metaheuristic literature.
- The effect of RES insertion on solving the ORPD is analyzed by two methods. The first method is to find the optimal solutions in two steps. The first method is finding the optimal allocation of RES for standard IEEE then determining the optimal solution to the ORPD challenge for the modified IEEE system after inserting the RES in the first step. The second method to find the optimal solution in one step by finding the optimal RES allocation and the rest of the optimal control variables, which means the control variables are increased (problem dimensions increased).
- Finally, IEEE test systems incorporated with the RERs are presented to investigate the dominance of the analyzed AVOA algorithm among other metaheuristic methods for finding the best objective functions solution with fast convergence characteristics.
The remaining parts of this paper are structured as follows. Part 2 describes the ORPD issue mathematical formulations, Part 3 discusses the suggested AVOA approach, Part 4 describes the discussions of all simulation results and covers all proposed case studies. Finally, Part 5 gives the paper’s conclusion.
2. ORPD Problem Formulation
The ORPD issue attempts to optimize an objective function by making a good change to power system control variables while complying with various constraints. Overall, the problem of optimization can be expressed as follows [42,43,44,45,46,47]:
where the objective function is , signifies the dependent variables vector (state variables), signifies the independent variables vector (control variables), and and are equality and inequality constraints, respectively. The and variables signify the number of equality constraints and the number of inequality constraints, respectively.
where the power of slack bus is signified by, the voltage of the load bus is signified by, the reactive power output of the generator is signified by, the transmission line’s apparent power flow is signified by , reflects the transmission lines number, reflects the generation buses number, and reflects the load buses number.
where the generator’s active power output is signified by , the generation bus voltage is signified by , the shunt compensator’s injected reactive power is signified by , signifies the shunt compensator bank units’ number, and signifies the transformer’s number; signifies the transformer’s tapping settings.
2.1. Objective Functions
In this work, there are three objective functions: voltage deviation, operating cost, and active power loss, which are formulated as a single- and multi- objective function.
2.1.1. Single Objective Functions
The proposed objective functions can be performed as follows:
Voltage Deviation Minimization
Voltage instability has become an essential issue that must be addressed for the modern power system to operate securely. The objective function, demonstrated as (VD), is used to assess power system voltage instability by reducing the sum of voltage deviations at each load bus from a specified voltage. Therefore, the minimization of voltage deviations (VD) is the first objective function, which is expressed as follows:
where the voltage reference is and commonly equal to one.
Cost Minimization
The second objective function seeks to reduce total operating cost. The ORPD problem mostly focuses on this OF. For each generator, it can be written as the polynomial quadratic function shown below:
where the th generator’s fuel cost is , and the th generator’s cost coefficients are , , and .
Real Power Loss Minimization
In terms of economics, power suppliers invariably create the better utilization of active power and available transmission capacity. As a result, minimizing real power loss on transmission lines becomes a priority for the power department. The minimization of transmission active loss () is the third objective function, which can be expressed as follows:
where is the conductance of transmission, and is a phase difference of voltages.
2.1.2. Multi-Objective Functions
The main goal of solving multi-objective issues is to optimize numerous independent objective functions at the same time. The multi-objective problem is defined as follows:
where is the number of objective functions; the Pareto optimization approach or weight factors as follows can be used to solve multi-objective functions:
where , , and are weight factors chosen depending on the relative importance of one objective to others. Typically, the weight factor values are chosen as follows:
2.2. System Constraints
The system already has several constraints, which are listed as follows:
2.2.1. Equality Constraints
The equality of two constraints containing active and reactive power balance must be fulfilled for power system operating conditions and are stated as follows.
where is the generated active power at bus and is the generated reactive power at bus . The active demand load at bus and reactive demand load at bus are signified by and , respectively. The conductance and susceptibility between bus and bus are depicted by and , respectively.
2.2.2. Inequality Constraints
The inequality constraints, which reflect the system components’ operating bounds, include the following:
- -
- Generator Constraints
Under any condition, the generator should be operating within its lower and upper bounds. The maximum and minimum boundaries of output active power, output reactive power, and bus voltages are given below:
- -
- Transformer Constraints
The boundaries of maximum and minimum transformer tapping settings are given below as follows:
- -
- Shunt Capacitor Bank Constraints
Shunt capacitor banks’ VAR compensation capacity must be limited to the lower and upper bounds shown below as follows:
- -
- Load Voltage Constraints
The magnitude of load bus voltage must be kept within a tolerable limit, as follows:
- -
- Security Constraints
To avoid overload, each transmission line’s apparent power flow should be restricted to its allowed limits, which is shown below:
3. African Vultures Optimization Algorithm
A new nature-inspired metaheuristic algorithm was introduced in [48] and Figure 1 displays the flowchart and steps for the proposed AVOA by modeling and replicating African vulture life patterns and foraging activities. The African vulture agents have N as the population in the metaheuristic algorithms. Its size is determined by the issue to be solved, and each vulture’s position space is described in d dimensions. Vulture populations are divided into three categories: the best solution is the first-best vulture, the second solution is the second-best vulture, and the remaining vultures are allocated to the third group. The AVOA solution’s fitness value can reflect the upsides and downsides of vultures. As a result, two of the finest solutions are deemed the strongest and best vultures, with the remaining vultures attempting to approach the best. In general, all vultures in the AVOA want to be near the best while avoiding the worst. The AVOA approach may be divided into five stages in the foraging stage.
Figure 1.
Flowchart for AVOA proposed optimization algorithm.
- -
- Stage 1: Population Classification
In this phase, the fitness of all solutions is calculated, and the best solution is identified as the best and first vulture, the second solution is identified as the second-best vulture using Equation (18), and the other vultures are allocated to the third group.
where represents the best vulture, denotes the second-best one, and are two random values in the range of (0, 1) and their total is 1. Equation (19) is used to determine , which is accomplished using the roulette-wheel technique.
where the fitness of the first and second two groups of vultures is represented by , and is the total number of vultures in both groups.
- -
- Stage 2: Vulture Famine Rate
If the vultures are not famished, they have enough stamina to fly longer distances in search of food, but if they are, they lack the energy to sustain their long-distance flight. As a result, the hungry vultures will become hostile. Vulture exploration and exploitation stages may thus be built around this tendency. The , a hunger level, of the vulture at the iteration, is calculated using Equation (20), and it is used as a signal of the vulture’s transition from exploration to exploitation.
where denotes that the vultures have had their fill, is a variable with a random value between 0 and 1, is a variable with a random value between (−1,1) that varies with each iteration, and t is determined by Equation (21).
where the parameter , which is provided in advance, determines the vulture’s likelihood of executing the exploitation step. Furthermore, is the current iteration number, is the total number of iterations, and is a random integer between −2 and 2.
According to the equation, decreases steadily as the number of iterations grows (20). When the value of is greater than one, the vultures start the exploration stage and look for fresh food in various areas. Otherwise, vultures enter the exploitation stage, hunting for better food in the immediate surroundings.
- -
- Stage 3: Reconnaissance Phase
Vultures have excellent vision in the wild, helping them to seek food and recognize dead animals fast. Vultures, on the other hand, may have difficulty finding food since they spend a long time assessing their surroundings before flying huge distances in search of food. The AVOA’s vultures can check several locations randomly by two separate strategies based on the value of in the range of (0, 1).
During the exploration phase, a random number () between 0 and 1 is utilized to determine one of the techniques. If the value of the , parameter Equation (21) is used. Otherwise, Equation (22) is used.
where is one of the best vultures chosen in the current iteration using Equation (18), is the rate of vulture satiation calculated in the current iteration using Equation (20), is a random number between 0 and 1, and and are the variables’ lower and upper bounds, respectively. is used to give a high random coefficient at the search environment scale to boost the diversity and search for diverse search space areas.
, which reflects the distance between the vulture and the current optimum, is calculated by Equation (24).
where is the vulture’s location and is a random integer between 0 and 2.
- -
- Stage 4: Utilization Phase (First Stage)
The AVOA’s efficiency stage is investigated at this step. If value is less than one, the AVOA begins the first step of exploitation. The parameter in the range (0, 1) is used to determine which method is used. At the start of this phase, generates a random number between 0 and 1. If this is more than or equal to the parameterthe siege-fight method is implemented slowly. Otherwise, rotational flying is employed by Equation (25).
and are determined using Equations (26) and (27), respectively, as respects:
where and are random numbers between 0 and 1, respectively.
- -
- Stage 5: Utilization Phase (Second Stage)
If is less than 0.5, this stage of the algorithm is executed. is created in the range (0,1) at the commencement of this phase. If the parameteris greater than or equal to, the goal is to attract a variety of vultures to the food supply, resulting in competing behavior. As a result, utilizing the equation, the vulture’s location may be updated (28).
Equations (29) and (30) are used to compute and , respectively.
Similarly, as the AVOA reaches its second stage, the vultures would congregate around the best vulture to scavenge the leftover food. As a result, using an equation, the vultures’ location may be updated (31).
where is the problem dimensions.
The AVOA’s efficacy was boosted by adopting Lévy flight () patterns generated from Equation (32).
where, and are random numbers between 0 and 1, respectively, and is a constant number of 1.5.
Table 2.
The AVOA algorithm parameters.
4. Simulation Results and Discussion
To demonstrate the usefulness of the proposed AVOA, it was utilized to fix the typical IEEE (30, 57, and 118) bus test systems with the goal of reducing actual power loss, total voltage variations, and total operational cost as a single- and multi-objective function considering RES with a continuous and discrete control variable handling. Table 3 lists ten cases that were used in this study. All simulation studies have been run on MATLAB 2022a, a 2.8 GHz Intel Pentium i7 PC with 16 GB of RAM. After 200 iterations for all test systems, the numerical optimum values for the five methods were determined. Furthermore, the simulation studies were acquired after 50 independent runs for each of the test situations. The five algorithms were executed on a total population of 30 particles. The control variables handling in our codification cases with two distinct types of optimization variables considering continuous and discrete variables require a special initialization. The continuous variables are initialized as follows, e.g., random[,] and random[,]. However, tap changers and the shunt capacitor bank compensators in the case of discrete variables are rounded off to their closest decimal values.
Table 3.
Case studies for different objective functions of ORPD problems.
This procedure is accomplished by incorporating the rounding operator into each step of the AVOA algorithm. Mathematically, the rounding can be written as follows: round (random,, step size), and round (random,, step size). After the initialization phase, the solution vector is updated by changing the previous solution to find a better new solution. Table 4 contains a description of the proposed test systems, including several control variables. Table 5 shows the settings for the control variable limits for each test system [49].
Table 4.
The description of proposed test systems.
Table 5.
Control variable limits for various IEEE cases (pu).
4.1. IEEE 30-Bus Test System
Figure 2 depicts the IEEE 30-bus test system with 19 control variables including 6 generators, 4 tap changing transformer settings, 9 shunt VAR compensators, 41 branches (37 lines and 4 tap changing transformers), and the total real and reactive power demands are 238.4 MW and 126.2 MVAR, respectively. The exact details of lines and buses for the IEEE- 30 bus system are described in [16,34]. Furthermore, in this research, the system is restricted as follows: the magnitude range of all buses’ voltages is 0.95 pu to 1.1 pu. The tap-changing transformers, on the other hand, range in power from 0.9 pu to 1.1 pu. Likewise, the shunt VAR compensator limits are assumed to be in the range of 0 to 5 MVAR.
Figure 2.
Standard IEEE 30 bus test system.
4.1.1. Case 1: Minimization of Voltage-Level Deviation in IEEE 30 Bus
In this case, the AVOA algorithm is being used to improve the function of minimizing voltage deviation. The findings mentioned in Table 6 point out that the voltage deviation index is decreased with all proposed algorithms within the accepted range. The AVOA achieves the best and lowest voltage deviation (0.103 pu) and enhances the voltage profile at major buses (around 1 pu) as displayed in Figure 3. In addition, Figure 4 shows how the AVOA achieves a pattern of decreasing system voltage divergence characteristics that outperforms comparable algorithms. In Table 6, the comparison of solutions obtained using these five methods, the AVOA algorithm greatly outperforms other population-based optimization strategies.
Table 6.
Optimal IEEE-30 bus test system control variables for curtailment VD.
Figure 3.
The AVOA voltage profile with the other compared methods for case 1.
Figure 4.
The AVOA convergence characteristics with the other compared methods for case 1.
According to Table 7, all proposed algorithms succeeded in minimizing the VD objective function considering operational constraints and achieving real and reactive power balance. Also, the performance evaluation of the proposed algorithms based on VD and the “number of runs is 50” with statistical analysis is illustrated in Table 8. The AVOA algorithm’s narrow range between minimum and maximum values presents a minimum stander deviation value (0.02875 pu). Additionally, it achieves a suitable mean value of computational time (18.85260 s) among other compared algorithms.
Table 7.
Balance of active and reactive power for proposed algorithms with case 1.
Table 8.
Statistical analysis for proposed algorithms with case 1.
4.1.2. Case 2: Minimization of Operational Cost in IEEE 30 Bus
When using the AVOA algorithm without considering the DG’s involvement, the target function is thought to be fuel cost minimization in this case. The fuel cost reduction convergence graph is shown in Figure 5 and the AVOA algorithm gets the optimal solution according to a remarkable and quick convergence rate and gets the lowest numbers with 100 iterations. Table 9 shows the appropriate control variables changes and the optimal cost minimization values; the findings show how superior the AVOA algorithm is against other heuristic optimization techniques and also show a considerable reduction in fuel costs to 81.268916 USD/h and the average computing time for a single loop is 0.08. Also, the majority of obtained solutions employing proposed heuristic optimization techniques are particularly viable, owing to the voltage magnitude accepted at all system load buses, as shown in Figure 6. These outcomes demonstrate how the AVOA method performs well in terms of fuel cost minimization.
Figure 5.
The AVOA convergence characteristics with the other compared methods for case 2.
Table 9.
Optimal IEEE 30-bus test system control variables for lessening operational cost.
Figure 6.
The AVOA voltage profile with the other compared methods for case 2.
All proposed algorithms succeeded in minimizing the operational cost without considering DGs and achieving real and reactive power balance as shown in Table 10. Also, statistical analysis is illustrated in Table 11; the performance evaluation of the proposed algorithms with a number of runs is 50. The AVOA algorithm’s narrow range between minimum and maximum values presents a minimum stander deviation value (22.99958 pu). Additionally, it achieves a minimum mean value of computational time (15.85748 s) among other compared algorithms.
Table 10.
Balance of active and reactive power for proposed algorithms with case 2.
Table 11.
Statistical analysis for proposed algorithms with case 2.
4.1.3. Case 3: Minimization of Transmission Power Losses in IEEE 30 Bus
In this case, the target function is thought to be real power loss saving. The AVOA algorithm was employed to accomplish the best solution and establish the perfect sets of the control variable, which diminishes system losses. Table 12 shows how the AVOA algorithm outperforms these prior methods; when the AVOA algorithm is used without taking DG into account, real power losses are dramatically lowered to 4.54647 MW. In Figure 7 real power losses using the AVOA method are steeply converged and fully achieve the perfect solution with 120 iterations, indicating a remarkable and quick convergence rate. Also, the majority of obtained solutions employing proposed heuristic optimization techniques are particularly viable, owing to the voltage magnitude accepted at all system load buses, as shown in Figure 8. The outcomes demonstrate how the AVOA method performs well in terms of real power loss minimization compared to that found using published population-based optimization techniques.
Table 12.
Optimal IEEE 30-bus test system control variables for decline power losses.
Figure 7.
The AVOA convergence characteristics with the other compared methods for case 3.
Figure 8.
The AVOA voltage profile with the other compared methods for case 3.
All proposed algorithms succeeded in saving real power losses and achieving real and reactive power balance as shown in Table 13. Also, statistical analysis is illustrated in Table 14. The performance evaluation of the proposed algorithms with a number of runs is 50. The AVOA algorithm’s narrow range between minimum and maximum values presents a minimum stander deviation value (0.042 pu). Additionally, it achieves a minimum mean value of computational time (16.00185 s) among other compared algorithms.
Table 13.
Balance of active and reactive power for proposed algorithms with case 3.
Table 14.
Statistical analysis for proposed algorithms with case 3.
4.1.4. Case 4: Minimization of Transmission Power Loss for Standard IEEE 30 Bus Incorporating RES
The reduction of real power losses by implementing the AVOA method when accommodating the DG at node 27 is the target function in this case, even more significantly lowering the power losses, reaching 2.67438 MW as stated in Table 15. In Figure 9, real power losses using the AVOA method are steeply converged and fully achieve the perfect solution with 100 iterations, indicating a remarkable and fast convergence rate. Also, the majority of obtained solutions employing proposed heuristic optimization techniques are particularly viable, owing to the voltage magnitude accepted at all system load buses, as shown in Figure 10. The results demonstrate the AVOA algorithm’s advantage over other heuristic approaches for tackling this sort of issue, and they support the effectiveness of the suggested DG placement strategy.
Table 15.
Optimal IEEE 30-bus test system control variables for decline in power losses with incorporation of RES.
Figure 9.
The AVOA convergence characteristics with the other compared methods for case 4.
Figure 10.
The AVOA voltage profile with the other compared methods for case 4.
All proposed algorithms succeeded in saving the real power losses and achieving real and reactive power balance considering DGs as shown in Table 16. Also, statistical analysis is illustrated in Table 17. The performance evaluation of the proposed algorithms with a number of runs is 50. The AVOA algorithm’s narrow range between minimum and maximum values presents a minimum stander deviation value (0.637 pu). Additionally, it achieves a minimum mean value of computational time (20.66890 s) among other compared algorithms.
Table 16.
Balance of active and reactive power for proposed algorithms with case 4.
Table 17.
Statistical analysis for proposed algorithms with case 4.
4.1.5. Case 5: Minimization of Multi-Objective Functions (Voltage-Level Deviation, Operational Cost, and Transmission Power Loss) with Continuous Control Variable Settings in IEEE-30 Bus
The applicability of the AVOA algorithm for solving a combinatorial complex ORPD optimization problem involving nonlinear muti-objective functions with a nonlinear restricted constraint is presented in this case. The AVOA algorithm is proposed for solving a multi-objective function minimization problem based on a weighted sum approach with continuous control variable settings, three single distinct objective functions (voltage-level deviation, operational cost, and transmission power loss) are transformed into a coefficient multi-objective ORPD problem tested on the IEEE-30 bus small-scale power system, and its results are illustrated in Table 18 and show that the AVOA method outperforms these prior methods with a minimum multi-objective value of 103.336931. In Figure 11, the AVOA method is converged and accomplishes the best solution against other compared techniques. All obtained solutions employing proposed heuristic optimization techniques are particularly viable, owing to the voltage magnitude accepted at all system load buses, as shown in Figure 12.
Table 18.
Minimization of multi-objective functions (voltage-level deviation, operational cost, and transmission power loss) with continuous control variable settings in IEEE-30 bus.
Figure 11.
The AVOA convergence characteristics with the other compared methods for case 5.
Figure 12.
The AVOA voltage profile with the other compared methods for case 5.
4.1.6. Case 6: Minimization of Multi-Objective Functions (Voltage-Level Deviation, Operational Cost, and Transmission Power Loss) with Discrete Control Variable Settings in IEEE-30 Bus
When dealing with a mixture of continuous and discrete control variables, an additional case is introduced with these optimization algorithms because it significantly increases the complexity of the ORPD problem. When the discrete variables number increases, the complexity increases exponentially. Therefore, two distinct types of optimization control variables are considered in this case as follows; generator set points as a continuous control variables type, and transformer tap settings with generator reactive power compensations as a discrete control variable type.
In this case, with the IEEE 30 bus test small-scale power system, generators’ voltage set points are typically in the (0.95, 1.1) pu range, transformer taps vary within the (0.9, 1.1) pu range with a step of 0.01 discretized into 20 levels as (0.9 0.91 0.92...until, 1.1), and a 5 MVAR maximum capacity for all capacitor banks with a step of 0.05 MVAR. Also, to show the ability of the proposed AVOA algorithm for solving a multi-objective function dealing with these continuous and discrete control variables, all results are illustrated in Table 19 and prove that the AVOA algorithm outperforms these prior methods with a minimum multi-objective value of 234.854930. In Figure 13, the AVOA method is converged and accomplishes the best solution against other compared techniques. Also, the majority of obtained solutions employing proposed heuristic optimization techniques are particularly viable, owing to the voltage magnitude accepted at all system load buses, as shown in Figure 14.
Table 19.
Minimization of multi-objective functions (voltage-level deviation, operational cost, and transmission power loss) with discrete control variable settings in IEEE-30 bus.
Figure 13.
The AVOA convergence characteristics with the other compared methods for case 6.
Figure 14.
The AVOA voltage profile with the other compared methods for case 6.
4.2. Standard IEEE-57 Bus Test System
This work considers a medium-scale IEEE 57-test system portrayed in Figure 15, to assess the scalability of the suggested methods. This system has a total generation capacity of 1975.9 MW and is made up of 80 transmission lines, containing 25 control variables including 7 generators, 3 shunt VAR compensators, and 15 transformers [6,16,34]. Furthermore, the system is restricted as follows: the voltage magnitude range for all buses is 0.9 pu to 1.1 pu. The tap-changing transformers, on the other hand, range in power from 0.9 pu to 1.1 pu. Likewise, the shunt VAR compensator limits are assumed to be between 0 and 30 MVAR.
Figure 15.
Standard IEEE 57 bus.
4.2.1. Case 7: Minimization of Transmission Power Loss in IEEE 57 Bus
In this case, the target function is thought to be real power loss saving. The AVOA algorithm was employed to accomplish the best solution and establish the perfect sets of the control variable, which diminishes system losses, the findings of which are given in Table 20, which shows how the AVOA algorithm outperforms these prior methods. When the AVOA algorithm is used without taking DG into account, real power losses are dramatically lowered to 27.51680 MW. In Figure 16, real power losses using the AVOA method are steeply converged and fully achieve the perfect solution with 160 iterations, exhibiting the AVOA method’s remarkable and quick convergence rate. Also, the majority of obtained solutions employing proposed heuristic optimization techniques are particularly viable, owing to the voltage magnitude accepted at all system load buses, as shown in Figure 17. The outcomes demonstrate how the AVOA method performs well in terms of real power loss minimization compared to that found using published population-based optimization techniques.
Table 20.
Optimal IEEE 57-bus test system control variables for reducing power losses.
Figure 16.
The AVOA convergence characteristics with the other compared methods for case 7.
Figure 17.
The AVOA voltage profile with the other compared methods for case 7.
In this case, all proposed algorithms succeeded in saving real power losses, but only AVOA was excellent against all other proposed algorithms and succeeded in achieving real and reactive power balance as shown in Table 21.
Table 21.
Balance of active and reactive power for proposed algorithms with case 7.
4.2.2. Case 8: Minimization of Transmission Power Loss for Standard IEEE 57 Bus Incorporating RES
Implementing the AVOA method when accommodating the DG at node 14 even more significantly lowered power losses, reaching 25.61081 MW as stated in Table 22. These results demonstrate the AVOA algorithm’s advantage over other heuristic approaches for tackling this sort of issue, and they support the effectiveness of the suggested DG placement strategy. In Figure 18, real power losses using the AVOA method are steeply converged and fully achieve the optimal solution at 25 rounds, exhibiting the AVOA algorithm’s quick convergence rate. Also, the majority of obtained solutions employing proposed heuristic optimization techniques are particularly viable, owing to the voltage magnitude accepted at all system load buses, as shown in Figure 19. The results demonstrate the AVOA algorithm’s advantage over other heuristic approaches for tackling this sort of issue, and they support the effectiveness of the suggested DG placement strategy.
Table 22.
Optimal IEEE 57-bus test system control variables for reducing power losses with incorporation of RES.
Figure 18.
The AVOA convergence characteristics with the other compared methods for case 8.
Figure 19.
The AVOA voltage profile with the other compared methods for case 8.
4.3. Standard IEEE-118 Bus Test System
This work considers a large-scale IEEE 118-bus test system to evaluate the scalability of the proposed methods, which has 77 control variables including 186 transmission lines, 54 generators, 14 shunt VAR compensators, 9 tap changing transformers, and a total system demand of 4242 MW. Furthermore, in this research, the IEEE 118-bus system is restricted as follows: the voltage magnitude range for all generator buses is 0.94 pu to 1.06 pu. The tap-changing transformers, on the other hand, range in power from 0.9 pu to 1.1 pu. Likewise, the shunt VAR compensator limits are assumed to be between 0 and 30 MVAR and its details are described in [49,50,51].
4.3.1. Case 9: Minimization of Multi-Objective Functions (Voltage-Level Deviation, Operational Cost, and Transmission Power Loss) with Continuous Control Variable Settings in IEEE-118 Bus
As explained in case 5, the applicability of the proposed AVOA algorithm for solving a multi-objective ORPD problem is presented and tested on the IEEE-118 bus large-scale power system and its results are illustrated in Table 23 and show that the AVOA algorithm outperforms these prior methods with the minimum multi-objective value of 265394.15. In Figure 20, the AVOA method is converged and fully accomplishes the best solution against other compared techniques. All obtained solutions employing proposed heuristic optimization techniques are particularly viable, owing to the voltage magnitude accepted at all system load buses, as shown in Figure 21.
Table 23.
Minimization of multi-objective functions (voltage-level deviation, operational cost, and transmission power loss) with continuous control variable settings in IEEE-118 bus.
Figure 20.
The AVOA convergence characteristics with the other compared methods for case 9.
Figure 21.
The AVOA voltage profile with the other compared methods for case 9.
4.3.2. Case 10: Minimization of Multi-Objective Functions (Voltage-Level Deviation, Operational Cost, and Transmission Power Loss) with Discrete Control Variable Settings in IEEE-118 Bus
For a small-scale IEEE-30 network presented previously in case 5, the problem is solved as multi-objective functions considering continuous control variables and the findings show a minimization of the objective function with a small value more than that obtained with discrete control variables presented in case 6. Therefore, on the large-scale network, the same cases are studied to prove the validity of the results and the ability of the AVOA optimizer for handling and solving the ORPD optimization issues. In this case, with the IEEE-118 bus test large-scale power system, generators’ voltage set points are typically in the (0.95, 1.1) pu range, transformer taps vary within the (0.9,1.1) pu range with steps of 0.01 discretized into 20 levels as (0.9 0.91 0.92...until, 1.1), and a 300 MVAR maximum capacity for all capacitor banks with steps of 0.3 MVAR. As explained in case 6, to prove the ability of the proposed AVOA algorithm for solving a multi-objective function dealing with these continuous and discrete control variables, all results are illustrated in Table 24 and prove that the AVOA algorithm outperforms these prior methods with a minimum multi-objective value of 269,219.7522. In Figure 22, the AVOA method is steeply converged and fully accomplishes the best solution against other compared techniques. All obtained solutions employing proposed heuristic optimization techniques are particularly viable, owing to the voltage magnitude accepted at all system load buses, as shown in Figure 23.
Table 24.
Minimization of multi-objective functions (voltage-level deviation, operational cost, and transmission power loss) with discrete control variable settings in IEEE-118 bus.
Figure 22.
The AVOA convergence characteristics with the other compared methods for case 10.
Figure 23.
The AVOA voltage profile with the other compared methods for case 10.
5. Conclusions
In this research, an efficient optimization optimizer named AVOA is developed for handling ORPD optimization issues. Furthermore, ten approaches for addressing a single- and multi-objective ORPD issue were proposed. The suggested methods were evaluated and confirmed on a variety of standard testing systems including IEEE (30, 57, and 118) bus systems with and without RES, and considering two distinct discrete and continuous types of optimization variables. The results proved that the optimal allocation of renewable energy sources simultaneously with the optimal power flow gives better results than that if it happens separately. This was achieved by adding the location and size of the distributed generation as a control variable and increasing the dimension of the ORPD problem. The results validate AVOA’s excellent performance and efficacy in tackling ORPD optimization challenges, when solving a multi-objective ORPD optimization problem considering continuous control variables, and all the findings show a minimization of the objective function with a small value more than that obtained with discrete control variables and prove the validity of the results and the ability of the AVOA optimizer to handle and solve ORPD optimization issues. Additionally, the best-achieved results from the IEEE-standard systems prove that the suggested approach overcomes the challenges associated with this test system. The AVOA’s results were also compared to other newly developed meta-heuristic approaches. The simulated findings demonstrate that the AVOA surpasses other compared strategies for handling ORPD when it comes to robustness and efficacy. In upcoming work, the suggested AVOA can be modified or mixed with other metaheuristic algorithms for addressing other complex optimization problems in dissimilar fields, for instance optimally distributed generation allocation seeing the vagueness of RES, optimal hybrid RES planning and design, the parameter estimation of fuel cells, and photovoltaic models.
Author Contributions
Conceptualization, M.H.A. and A.M.A.S.; methodology, M.H.A. and A.M.A.S.; software, M.H.A. and A.M.A.S.; validation, M.H.A., T.K. and A.E.-S.; formal analysis, T.K. and M.A.; investigation, T.K., M.A. and A.E.-S.; resources, M.H.A. and A.M.A.S.; Data curation, M.H.A. and A.M.A.S.; writing—original draft preparation, A.M.A.S.; writing—review and editing, T.K., M.A., A.Y.A. and A.E.-S.; visualization, T.K., M.A., A.Y.A. and A.E.-S.; supervision, A.Y.A. and A.E.-S. All authors have read and agreed to the published version of the manuscript.
Funding
This research received no external funding.
Conflicts of Interest
The authors declare no conflict of interest.
Abbreviations
| A-CSOS | Adaptive chaotic symbiotic organisms search algorithm |
| AMOAIA | Adaptive multi-objective optimization artificial immune algorithm |
| AO | A novel Optimizer |
| AVOA | African Vultures Optimization Algorithm |
| CTFWO | Chaotic turbulent flow of water-based optimization algorithm |
| CA | Coot Algorithm |
| CBA | Chaotic bat algorithm |
| DP | Dynamic programming |
| EP | Evolutionary Programming |
| FA | Firefly Algorithm |
| FO-DPSO | Fractional-order Darwinian particle swarm optimization |
| FPSOGSA | Fractional particle swarm optimization-gravitational search algorithm |
| GWO | Grey wolf optimization algorithm |
| GWFA | Adaptive Grey Wolf-based Firefly Algorithm |
| HPSOFA | Hybridization of particle swarm optimization with firefly algorithm |
| HPSOBA | Hybrid bat optimization algorithm based on particle swarm algorithm |
| ICOA | Improved coyote optimization algorithm |
| IDE | Improved Differential evolution algorithm |
| IHBO | Improved Heap-based optimizer |
| IMPA | Improved Marine Predators Algorithm |
| IMFO | Improved Moth-flame Optimization algorithm |
| IPM | Interior Point Method |
| IRCGA | Improved real-coded genetic algorithm |
| IALO | Improved Antlion optimization algorithm |
| ICOA | Improved coyote optimization algorithm |
| ISSO | Improved social spider optimization |
| LAPO | Lightning attachment procedure optimization |
| LP | Linear Programming |
| MOPSO | Multi-objective particle swarm optimization algorithm |
| MPA | Marine predators’ algorithm |
| MPFA | Modified pathfinder algorithm |
| MSCA | Modified sine cosine algorithm |
| MVMO | Mean-variance mapping optimization algorithm |
| ORPD | Optimal reactive power dispatch |
| OF | Objective Function |
| PSO | Particle Swarm Optimization |
| PCA-RCGA | Real coded genetic algorithm with Principal component analysis |
| Ploss | Active power losses |
| QP | Quadratic Programming |
| RERs | Renewable energy resources |
| SCA | Sine-cosine algorithm |
| SMA | Slime mold algorithm |
| TVD | Total voltage deviation |
| VAR | Volt ampere reactive |
| WWO | Water wave optimization algorithm |
| Symbols | |
| First best vulture | |
| Second best vulture | |
| Function | |
| Conductance between bus and bus | |
| Susceptance between bus and bus | |
| Weight factor for objective function | |
| Equality constraints | |
| Inequality constraints | |
| Equality constraints numbers | |
| Inequality constraints numbers | |
| IEEE | Institute of Electrical and Electronics Engineers |
| The probability parameter for deciding the best vulture | |
| The probability parameter for deciding the second-best vulture | |
| The lower search spaces bound | |
| The upper search spaces bound | |
| Maximum iterations’ number | |
| Shunt compensator bank units’ numbers | |
| Generation buses numbers | |
| Load buses numbers | |
| Transformers numbers | |
| Number of transmission lines | |
| Vulture position vector | |
| A parameter that determines the chances of choosing a mechanism during the exploration phase | |
| A parameter that determines the chances of choosing a mechanism during the exploration phase of the first part | |
| A parameter that determines the chances of choosing mechanisms during the exploration phase of the second part | |
| Vultures’ numbers | |
| Slack bus power | |
| Generated active power at bus | |
| Generated reactive power at bus | |
| Demand active power at bus | |
| Demand reactive power at bus | |
| Injected reactive power of the shunt compensator | |
| Generator’s output reactive power | |
| A random number | |
| One of the top vultures selected | |
| The transmission line’s apparent power flow | |
| Transformer’s tap setting | |
| Control variables | |
| Generation bus voltage | |
| Load bus voltage | |
| Reference voltage | |
| State variables | |
| A parameter that defines the disruption of the exploration and exploitation phases | |
| USD/h | Dollar/hour |
| The phase difference of voltages |
References
- Yalcin, E.; Taplamacioglu, M.C.; Cam, E. The Adaptive Chaotic Symbiotic Organisms Search Algorithm Proposal for Optimal Reactive Power Dispatch Problem in Power Systems. Electrica 2019, 19, 37–47. [Google Scholar] [CrossRef] [Scilit]
- Muhammad, Y.; Khan, R.; Ullah, F.; Rehman, A.U.; Aslam, M.S.; Raja, M.A.Z. Design of fractional swarming strategy for solution of optimal reactive power dispatch. Neural Comput. Appl. 2020, 32, 10501–10518. [Google Scholar] [CrossRef] [Scilit]
- Gafar, M.G.; El-Sehiemy, R.A.; Hasanien, H.M. A Novel Hybrid Fuzzy-JAYA Optimization Algorithm for Efficient ORPD Solution. IEEE Access 2019, 7, 182078–182088. [Google Scholar] [CrossRef] [Scilit]
- Salimin, R.H.; Musirin, I.; Hamid, Z.A.; Harun, A.F.; Suliman, S.I.; Suyono, H.; Hasanah, R.N. Multi cases optimal reactive power dispatch using evolutionary programming. Indones. J. Electr. Eng. Comput. Sci. 2020, 17, 662–670. [Google Scholar] [CrossRef] [Scilit]
- ElSayed, S.; Elattar, E. Slime Mold Algorithm for Optimal Reactive Power Dispatch Combining with Renewable Energy Sources. Sustainability 2021, 13, 5831. [Google Scholar] [CrossRef] [Scilit]
- Mugemanyi, S.; Qu, Z.; Rugema, F.X.; Dong, Y.; Bananeza, C.; Wang, L. Optimal Reactive Power Dispatch Using Chaotic Bat Algorithm. IEEE Access 2020, 8, 65830–65867. [Google Scholar] [CrossRef] [Scilit]
- Jamal, R.; Men, B.; Khan, N.H. A Novel Nature Inspired Meta-Heuristic Optimization Approach of GWO Optimizer for Optimal Reactive Power Dispatch Problems. IEEE Access 2020, 8, 202596–202610. [Google Scholar] [CrossRef] [Scilit]
- Chaitanya, S.N.V.S.K.; Bakkiyaraj, R.A.; Rao, B.V. Technical Review on Optimal Reactive Power Dispatch with FACTS Devices and Renewable Energy Sources. In Lecture Notes in Electrical Engineering; Springer: Berlin/Heidelberg, Germany, 2022; Volume 766, pp. 185–194. [Google Scholar] [CrossRef] [Scilit]
- Pattanaik, J.K.; Basu, M.; Dash, D.P. Improved Real-Coded Genetic Algorithm for Reactive Power Dispatch. IETE J. Res. 2022, 68, 1462–1474. [Google Scholar] [CrossRef] [Scilit]
- Abdel-Fatah, S.; Ebeed, M.; Kamel, S. Optimal Reactive Power Dispatch Using Modified Sine Cosine Algorithm. Proceedings of 2019 International Conference on Innovative Trends in Computer Engineering (ITCE), Aswan, Egypt, 2–4 February 2019; pp. 510–514. [Google Scholar] [CrossRef] [Scilit]
- Li, Z.; Cao, Y.; Van Dai, L.; Yang, X.; Nguyen, T.T. Finding Solutions for Optimal Reactive Power Dispatch Problem by a Novel Improved Antlion Optimization Algorithm. Energies 2019, 12, 2968. [Google Scholar] [CrossRef] [Scilit]
- Nguyen, T.T.; Vo, D.N. Improved social spider optimization algorithm for optimal reactive power dispatch problem with different objectives. Neural Comput. Appl. 2020, 32, 5919–5950. [Google Scholar] [CrossRef] [Scilit]
- Saraswat, A.; Ucheniya, R.; Gupta, Y. Two-Stage Stochastic Optimization for Reactive Power Dispatch with Wind Power Uncertainties. In Proceedings of the International Conference on Computation, Automation and Knowledge Management (ICCAKM-2020), Dubai, United Arab Emirates, 9–10 January 2020; pp. 332–337. [Google Scholar] [CrossRef] [Scilit]
- Ebeed, M.; Ali, A.; Mosaad, M.I.; Kamel, S. An Improved Lightning Attachment Procedure Optimizer for Optimal Reactive Power Dispatch with Uncertainty in Renewable Energy Resources. IEEE Access 2020, 8, 168721–168731. [Google Scholar] [CrossRef] [Scilit]
- Jamal, R.; Men, B.; Khan, N.H.; Raja, M.A.Z.; Muhammad, Y. Application of Shannon Entropy Implementation Into a Novel Fractional Particle Swarm Optimization Gravitational Search Algorithm (FPSOGSA) for Optimal Reactive Power Dispatch Problem. IEEE Access 2021, 9, 2715–2733. [Google Scholar] [CrossRef] [Scilit]
- Khan, N.H.; Wang, Y.; Tian, D.; Raja, M.A.Z.; Jamal, R.; Muhammad, Y. Design of Fractional Particle Swarm Optimization Gravitational Search Algorithm for Optimal Reactive Power Dispatch Problems. IEEE Access 2020, 8, 146785–146806. [Google Scholar] [CrossRef] [Scilit]
- Khan, N.H.; Wang, Y.; Tian, D.; Jamal, R.; Ebeed, M.; Deng, Q. Fractional PSOGSA Algorithm Approach to Solve Optimal Reactive Power Dispatch Problems With Uncertainty of Renewable Energy Resources. IEEE Access 2020, 8, 215399–215413. [Google Scholar] [CrossRef] [Scilit]
- Kunapareddy, M.; Rao, B.V. Hybridization of Particle Swarm Optimization with Firefly Algorithm for Multi-objective Optimal Reactive Power Dispatch. In Lecture Notes in Mechanical Engineering; Springer: Berlin/Heidelberg, Germany, 2020; pp. 673–682. [Google Scholar] [CrossRef] [Scilit]
- Das, T.; Roy, R.; Mandal, K.K. Impact of the penetration of distributed generation on optimal reactive power dispatch. Prot. Control. Mod. Power Syst. 2020, 5, 1–26. [Google Scholar] [CrossRef] [Scilit]
- Yapici, H. Solution of optimal reactive power dispatch problem using pathfinder algorithm. Eng. Optim. 2021, 53, 1946–1963. [Google Scholar] [CrossRef] [Scilit]
- Zhou, Y.; Zhang, J.; Yang, X.; Ling, Y. Optimal reactive power dispatch using water wave optimization algorithm. Oper. Res. 2020, 20, 2537–2553. [Google Scholar] [CrossRef] [Scilit]
- Roy, R.; Das, T.; Mandal, K.K. Optimal Reactive Power Dispatch for Voltage Security using JAYA Algorithm. In Proceedings of the 2020 International Conference on Convergence to Digital World—Quo Vadis, ICCDW, Mumbai, India, 18–20 February 2020; pp. 1–6. [Google Scholar] [CrossRef] [Scilit]
- Ebeed, M.; Alhejji, A.; Kamel, S.; Jurado, F. Solving the Optimal Reactive Power Dispatch Using Marine Predators Algorithm Considering the Uncertainties in Load and Wind-Solar Generation Systems. Energies 2020, 13, 4316. [Google Scholar] [CrossRef] [Scilit]
- Ahmed, M.; Osman, M.; Korovkin, N. Optimal reactive power dispatch in power system comprising renewable energy sources by means of a multi-objective particle swarm algorithm. Mater. Sci. Power Eng. 2021, 27, 5–20. [Google Scholar] [CrossRef]
- Elsayed, S.K.; Kamel, S.; Selim, A.; Ahmed, M. An Improved Heap-Based Optimizer for Optimal Reactive Power Dispatch. IEEE Access 2021, 9, 58319–58336. [Google Scholar] [CrossRef] [Scilit]
- Londono, D.; Acevedo, W.V.; Camilo, D.; Tamayo, L.; María, J.; Lezama, L.; Mauricio, W.; Acevedo, V. Mean-Variance Mapping Optimization Algorithm Applied to the Optimal Reactive Power Dispatch. In INGE CUC; Universidad de la Costa-CUC: Barranquilla, Colombia, 2021; Volume 17. [Google Scholar] [CrossRef] [Scilit]
- Das, T.; Roy, R.; Mandal, K.K. Integrated PV system with Optimal Reactive Power Dispatch for Voltage Security using JAYA Algorithm. In Proceedings of the 7th International Conference on Electrical Energy Systems, ICEES, Chennai, India, 11–19 February 2021; pp. 56–61. [Google Scholar] [CrossRef] [Scilit]
- Das, T.; Roy, R.; Mandal, K.K. Solving Optimal Reactive Power Dispatch Problem with the Consideration of Load Uncertainty using Modified JAYA Algorithm. In Proceedings of the 2021 1st International Conference on Advances in Electrical, Computing, Communications and Sustainable Technologies, ICAECT, Bhilai, India, 19–20 February 2021; pp. 1–6. [Google Scholar] [CrossRef] [Scilit]
- Roy, R.; Das, T.; Mandal, K.K. Optimal reactive power dispatch using a novel optimization algorithm. J. Electr. Syst. Inf. Technol. 2021, 8, 18. [Google Scholar] [CrossRef] [Scilit]
- Hassan, M.H.; Kamel, S.; El-Dabah, M.A.; Khurshaid, T.; Dominguez-Garcia, J.L. Optimal Reactive Power Dispatch with Time-Varying Demand and Renewable Energy Uncertainty Using Rao-3 Algorithm. IEEE Access 2021, 9, 23264–23283. [Google Scholar] [CrossRef] [Scilit]
- Kien, L.; Hien, C.; Nguyen, T. Optimal Reactive Power Generation for Transmission Power Systems Considering Discrete Values of Capacitors and Tap Changers. Appl. Sci. 2021, 11, 5378. [Google Scholar] [CrossRef] [Scilit]
- Sabir, M.; Ahmad, A.; Ahmed, A.; Siddique, S.; Hashmi, U.A. A Modified Inertia Weight Control of Particle Swarm Optimization for Optimal Reactive Power Dispatch Problem. In Proceedings of the 2021 International Conference on Emerging Power Technologies, ICEPT, Topi, Pakistan, 10–11 April 2021; pp. 1–6. [Google Scholar] [CrossRef] [Scilit]
- Chi, R.; Li, Z.; Chi, X.; Qu, Z.; Tu, H.-B. Reactive Power Optimization of Power System Based on Improved Differential Evolution Algorithm. Math. Probl. Eng. 2021, 2021, 6690924. [Google Scholar] [CrossRef] [Scilit]
- Wahab, A.M.A.-E.; Kamel, S.; Hassan, M.H.; Mosaad, M.I.; AbdulFattah, T.A. Optimal Reactive Power Dispatch Using a Chaotic Turbulent Flow of Water-Based Optimization Algorithm. Mathematics 2022, 10, 346. [Google Scholar] [CrossRef] [Scilit]
- Shareef, S.K.M.; Rao, R.S. Adaptive Grey Wolf based on Firefly algorithm technique for optimal reactive power dispatch in unbalanced load conditions. J. Curr. Sci. Technol. 2019, 12, 11–31. [Google Scholar] [CrossRef]
- Ramkee, P.; Chaitanya, S.N.V.S.K.; Rao, B.V.; Bakkiyaraj, R.A. Optimal Reactive Power Dispatch Under Load Uncertainty Incorporating Solar Power Using Firefly Algorithm. In Lecture Notes in Electrical Engineering; Springer: Berlin/Heidelberg, Germany, 2022; pp. 423–434. [Google Scholar] [CrossRef] [Scilit]
- Khan, N.H.; Jamal, R.; Ebeed, M.; Kamel, S.; Zeinoddini-Meymand, H.; Zawbaa, H.M. Adopting Scenario-Based approach to solve optimal reactive power Dispatch problem with integration of wind and solar energy using improved Marine predator algorithm. Ain Shams Eng. J. 2022, 13, 101726. [Google Scholar] [CrossRef] [Scilit]
- Qin, L.; Xu, T.; Li, S.; Chen, Z.; Zhang, Q.; Tian, J.; Lin, Y. Coot Algorithm for Optimal Carbon–Energy Combined Flow of Power Grid with Aluminum Plants. Front. Energy Res. 2022, 10, 856314. [Google Scholar] [CrossRef] [Scilit]
- Sakthivel Padaiyatchi, S.; Jaya, S. Hybrid Bat Optimization Algorithm Applied to Optimal Reactive Power Dispatch Problems. Int. J. Electr. Electron. Eng. 2022, 9, 1–5. [Google Scholar] [CrossRef] [Scilit]
- Saddique, M.S.; Habib, S.; Haroon, S.S.; Bhatti, A.R.; Amin, S.; Ahmed, E.M. Optimal Solution of Reactive Power Dispatch in Transmission System to Minimize Power Losses Using Sine-Cosine Algorithm. IEEE Access 2022, 10, 20223–20239. [Google Scholar] [CrossRef] [Scilit]
- Lian, L. Reactive power optimization based on adaptive multi-objective optimization artificial immune algorithm. Ain Shams Eng. J. 2022, 13, 101677. [Google Scholar] [CrossRef] [Scilit]
- Zhang, M.; Li, Y. Multi-Objective Optimal Reactive Power Dispatch of Power Systems by Combining Classification-Based Multi-Objective Evolutionary Algorithm and Integrated Decision Making. IEEE Access 2020, 8, 38198–38209. [Google Scholar] [CrossRef] [Scilit]
- Muhammad, Y.; Khan, R.; Raja, M.A.Z.; Ullah, F.; Chaudhary, N.I.; He, Y. Solution of optimal reactive power dispatch with FACTS devices: A survey. Energy Rep. 2020, 6, 2211–2229. [Google Scholar] [CrossRef] [Scilit]
- Khan, N.H.; Wang, Y.; Tian, D.; Jamal, R.; Kamel, S.; Ebeed, M. Optimal Siting and Sizing of SSSC Using Modified Salp Swarm Algorithm Considering Optimal Reactive Power Dispatch Problem. IEEE Access 2021, 9, 49249–49266. [Google Scholar] [CrossRef] [Scilit]
- Niu, M.; Xu, N.Z.; Dong, H.N.; Ge, Y.Y.; Liu, Y.T.; Ngin, H.T. Adaptive Range Composite Differential Evolution for Fast Optimal Reactive Power Dispatch. IEEE Access 2021, 9, 20117–20126. [Google Scholar] [CrossRef] [Scilit]
- Li, Y.; Sun, B.; Zeng, Y.; Dong, S.; Ma, S.; Zhang, X. Active distribution network active and reactive power coordinated dispatching method based on discrete monkey algorithm. Int. J. Electr. Power Energy Syst. 2022, 14, 1084253. [Google Scholar] [CrossRef] [Scilit]
- Sun, B.; Jing, R.; Zeng, Y.; Li, Y.; Chen, J.; Liang, G. Distributed optimal dispatching method for smart distribution network considering effective interaction of source-network-load-storage flexible resources. Energy Rep. 2023, 9, 148–162. [Google Scholar] [CrossRef] [Scilit]
- Abdollahzadeh, B.; Gharehchopogh, F.S.; Mirjalili, S. African vultures optimization algorithm: A new nature-inspired metaheuristic algorithm for global optimization problems. Comput. Ind. Eng. 2021, 158, 107408. [Google Scholar] [CrossRef] [Scilit]
- Villa-Acevedo, W.M.; López-Lezama, J.M.; Valencia-Velásquez, J.A. A Novel Constraint Handling Approach for the Optimal Reactive Power Dispatch Problem. Energies 2018, 11, 2352. [Google Scholar] [CrossRef] [Scilit]
- Mouassa, S.; Bouktir, T.; Salhi, A. Ant lion optimizer for solving optimal reactive power dispatch problem in power systems. Eng. Sci. Technol. Int. J. 2017, 20, 885–895. [Google Scholar] [CrossRef] [Scilit]
- Nagarajan, K.; Parvathy, A.K.; Rajagopalan, A. Multi-Objective Optimal Reactive Power Dispatch using Levy Interior Search Algorithm. Int. J. Electr. Eng. Inform. 2020, 12, 547–570. [Google Scholar] [CrossRef] [Scilit]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2023 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).






















