Next Article in Journal
Weak Solutions and Their Kinetic Energy Regarding Time-Periodic Navier–Stokes Equations in Three Dimensional Whole-Space
Next Article in Special Issue
A Compact Octa-Band Frequency Reconfigurable Antenna for Wireless Applications
Previous Article in Journal
How the Theme of ‘Doing and Undoing’ Applied to the Action of Exchange Reveals Overlooked Core Ideas in School Mathematics
Previous Article in Special Issue
Parameter Estimation of Induction Machine Single-Cage and Double-Cage Models Using a Hybrid Simulated Annealing–Evaporation Rate Water Cycle Algorithm
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Modified Rao-2 Algorithm for Optimal Power Flow Incorporating Renewable Energy Sources

1
Electrical Engineering Department, Faculty of Engineering, Aswan University, Aswan 81542, Egypt
2
Electrical Engineering Department, Yeungnam University, Gyeongsan 38541, Korea
3
IREC Catalonia Institute for Energy Research, Jardins de les Dones de Negre 1, 2a, 08930 Sant Adrià de Besòs, Barcelona, Spain
*
Authors to whom correspondence should be addressed.
Mathematics 2021, 9(13), 1532; https://doi.org/10.3390/math9131532
Submission received: 26 May 2021 / Revised: 22 June 2021 / Accepted: 27 June 2021 / Published: 29 June 2021
(This article belongs to the Special Issue Evolutionary Optimization Algorithms for Electromagnetic Devices)

Abstract

:
In this paper, a modified Rao-2 (MRao-2) algorithm is proposed to solve the problem of optimal power flow (OPF) in a power system incorporating renewable energy sources (RES). Quasi-oppositional and Levy flight methods are used to improve the performance of the Rao algorithm. To demonstrate effectiveness of the MRao-2 technique, it is tested on two standard test systems: an IEEE 30-bus system and an IEEE 118-bus system. The objective function of the OPF is the minimization of fuel cost in five scenarios. The IEEE 30-bus system reflects fuel cost minimization in three scenarios (without RES, with RES, and with RES under contingency state), while the IEEE 118-bus system reflects fuel cost minimization in two scenarios (without RES and with RES). The achieved results of various scenarios using the suggested MRao-2 technique are compared with those obtained using five recent techniques: Atom Search Optimization (ASO), Turbulent Flow of Water-based Optimization (TFWO), Marine Predators Algorithm (MPA), Rao-1, Rao-3 algorithms, as well as the conventional Rao-2 algorithm. Those comparisons confirm the superiority of the MRao-2 technique over those other algorithms in solving the OPF problem.

1. Introduction

In recent decades, the optimal power flow (OPF) problem has had an important role in the operation and planning of electrical systems [1]. OPF aims to adjust the independent control variables parameters of power systems to reach the needed objective function, which are normally reducing the fuel cost, emission, and active power loss, to satisfy the needed demand load, concurrently meeting the boundaries of inequality and equality constraints [2].
The critical necessity to address global warming and climate change have placed renewable energy sources (RES) such as solar energy systems, wind energy systems, and hydropower plants in the center of energy conversion as well as the quickly dropping renewable power generation costs, we need to face the challenges, arising from using a high scale of renewable energy sources in the power system [3]. In recent years, RES contributes to decreasing the power losses of the grid, enhancing the quality and reliability of the electrical grid [4]; furthermore, they affect the electricity market. By increasing the added energy from RES inside the electrical power grid, it is required to set the best energy production for the system to satisfy the objective functions such as minimizing the fuel cost, total emission from the conventional power generation stations, and transmission losses and enhancing the voltage profile [5].
The OPF problem is generally non-convex, non-smooth, and non-differentiable objective functions. Consequently, it is very significant to develop new techniques to reach the global best solution for this problem. The conventional approaches such as Gradient’s method [6], nonlinear programming [6], quadratic programming [7], and interior-point methods [8] have been successfully applied in the previous researches to solve the OPF problem. The nonlinear properties may produce the obtained solutions to be confined in local minima, and these methods need a huge quantity of computational effort and time. Therefore, several optimization techniques need to be developed to defeat these weaknesses [9].
Thus, different heuristic techniques are utilized to solve the OPF problem such as a multi-objective hybrid firefly and PSO (MOHFPSO) [10], modified grasshopper optimization algorithm (MGOA) [11], forced initialized differential evolution algorithm [12], an adaptive multiple teams perturbation-guiding Jaya (AMTPG-Jaya) technique [13], modified Sine-Cosine algorithm (MSCA) [14], Developed Grey Wolf Optimizer (DGWO) [15], improved salp swarm algorithm (ISSA) [16], Barnacles Mating Optimizer (BMO) [17], and Lévy Coyote optimization algorithm (LCOA) [18].
Although these three versions of the Rao algorithm have been recently published, many optimization problems have been solved using them and using their modifications such as the photovoltaic cell parameter estimation [19,20,21,22], design optimization of mechanical system components [23], selected thermodynamic [24], Optimal weight design of a spur gear train [25], 2D truss structures [26], multi-objective design optimization of selected heat sinks [27], optimal reactive power dispatch with renewable energy and time-varying demand uncertainty [28], and Classification of Parkinson disease [29].
In this article, the main contribution is summarized as follows.
  • The proposed MRao-2 technique is used to achieve the accurate values of control variables of the OPF problem without RES, with RES, and with RES under contingency state.
  • The fuel cost is the main objective function in five scenarios for the two IEEE 30 -bus and 118-bus systems to test the validation of the proposed algorithm.
  • To check the robustness of this modified algorithm, its results are compared with five recent algorithms—ASO, TFWO, MPA, Rao-1, and Rao-3—as well as the original Rao-2 which are the strong algorithms in solving the modern power system problems and they are used in many published papers in the last two years so far.
The rest of the paper is organized as follows. The problem formulation is presented in Section 2. Section 3 introduces the proposed MRao-2 algorithm applied to solve the OPF problem with various scenarios. Section 4 gives a discussion and analysis of the simulation results. Section 5 presents the conclusion.

2. Problem Formulation

2.1. General Structure of OPF

The OPF solution provides the best value of the control variables by minimizing an objective function with satisfying equality and inequality limitations. Commonly, the mathematical formulation of the optimization problem may be expressed as follows [30]:
Minimize   F x , u
Subject to
g i x , u = 0             i = 1 , 2 , 3 , , m
  h j x , u 0             j = 1 , 2 , 3 , , n
where F is the objective function; x ,   u are the state variables (dependent variables) and the control variables (independent variables) vectors, respectively; g i is the equality constraints ;   m is the number of equality constraints;   h j is the number of inequality constraints; and n is the number of inequality constraints.
The state variables are represented in a vector as follows [16]:
x = P G 1 , V L 1 V LNPQ , Q G 1 Q GNPV , S TL 1 S TLNTL
where P G 1 refers to the active power generation of slack bus, VL is the voltage magnitude of the load bus, NPQ is the number of load buses, QG is the generated reactive power, NPV is the number of generation buses, STL is the loading of transmission line, and NTL is Number of transmission lines.
The control variables are represented in a vector as follows [16]:
u = P G 2 P GNG , V G 1 V GNG , Q C 1 Q CNC , T 1 T NT
where PG is the generated active power, and NG is the number of generators. VG is the voltage magnitude of the generation bus. QC is the injected imaginary power by the shunt compensator. NC is the number of shunt compensators. T is the tapping ratio of the transformer. NT is the number of transformers.

2.2. Objective Functions

2.2.1. Quadratic Total Fuel Cost

The total fuel cost of all thermal generation units is represented based on the polynomial quadratic function as the following equation [2]:
F 1 = i = 1 N a i P gi 2 + b i P gi + c i             $ / h  
where ai, b, and ci are the cost coefficients of ith generator.

2.2.2. Total Emission

Various types of noxious emissions are emitted from those plants because of using several types of fossil fuels in thermal power plants. Newly, one of the principal goals of the OPF problem is reducing these emissions without affecting the generated power to satisfy the load demands in the electrical power system. This emission is calculated from the following equation: [31]:
E = i = 1 N 10 2 ( α i + β i P i + γ i P i 2 )
where α i , β i , and γ i represent the emission coefficients for the ith unit.

2.2.3. Power Loss Function

The total active power losses in the system can be expressed as follows [32]:
P loss = k = 1 nl G k V i 2 + V j 2 2 V i V j cos ( δ i δ j ) MW
where nl is the number of network nodes; V i and V j are the voltage magnitudes for the i-th and j-th nodes, respectively; δ i and δ j are the node voltage angles of the i-th–j-th branch; and G k refers to the conductivity between node i and node j.

2.2.4. Voltage Deviation (VD) Function (Voltage Profile Improvement)

One of the effective methods is the voltage magnitude fluctuation from 1.0 per unit at each load bus which is defined as follows [32]:
VD = p = 1 NL V L p 1
where V L p is the ith voltage of load buses.

2.3. Constraints

2.3.1. Equality Constraints

The balanced load flow equations represent the equality constraints. The following equations express the active and reactive power constraints that fulfill the load demands requirements and also the power losses of the transmission line [33]:
P Gi P Di = V i   j = 1 NB V j [ G ij cos δ i δ j + B ij sin δ i δ j ]
Q Gi Q Di = V i   j = 1 NB V j [ G ij cos δ i δ j B ij sin δ i δ j ]
where PG is the generated real power, QG is the reactive power generation, NB is the number of buses, and PD and QD are the real and imaginary load demands, respectively. G ij and B ij are the conductance and substance between buses i and j.   δ i and δ j are the voltage angles bus i and j.

2.3.2. Inequality Constraints

The inequality constraints are described as follows [34]:
(a) Generator constraints (thermal or renewable as applicable):
P Gi min   P Gi P Gi max              i = 1 , 2 , , NG
V Gi min V Gi V Gi max              i = 1 , 2 , , NPV
Q Gi min Q Gi Q Gi max              i = 1 , 2 , , NPV
(b) Security constraints
  S Li S li max                       i = 1 , 2 , , NTL
V i min   V i V i max              i = 1 , 2 , , NPQ
(c) Shunt VAR compensator constraints:
Q ci min   Q Ci Q ci max              i   = 1 , 2 ,     ,   NC
(d) Transformer constraints:
T i min   T i T i max              i   = 1 , 2 ,     ,   NT
The mathematical formulation of the fitness function combined with the quadratic penalty is as follows:
F g x , u = F i x , u + Penalty
Penalty = λ p Δ P G 1 2 + λ v i = 1 NPQ   Δ V Li 2 + λ Q i = 1 NPV   Δ Q Gi 2 + λ s i = 1 NTL   Δ S Li 2
Δ P G 1 = P G 1 max P G 1               P G 1 > P G 1 max P G 1 P G 1 min               P G 1 < P G 1 min
Δ V Li = Δ V Li max Δ V Li             Δ V Li > Δ V Li max Δ V Li Δ V Li min             Δ V Li < Δ V Li min
Δ Q Gi = Δ Q Gi max Δ Q Gi              Δ Q Gi > Δ Q Gi max Δ Q Gi Δ Q Gi min              Δ Q Gi < Δ Q Gi min
Δ S Li = Δ S Li max Δ S Li     Δ S Li > Δ S Li max Δ S Li Δ S Li min     Δ S Li < Δ S Li min
where λ p , λ v , λ Q , λ s are the Penalty factors.

2.3.3. Power Balance Considering RES

Adding the RES to the power system has different shapes in the studying of the OPF problem. In this article, the RES is employed as a negative load [35,36]. This implies that all RES (such as solar, wind, hydro, and biomass) that are added to the system will be utilized first to produce the part of the required power to loads then the remainder of the loads and power losses will be covered from the thermal power plants.

3. The Proposed Optimization Technique

3.1. Rao Algorithm

Rao algorithms have recently been implemented in [37]. The key benefit of these algorithms is that they do not need any complex control parameters, only ordinary parameters such as population size and the number of iterations are required. Rao-1, Rao-2, and Rao-3 are three algorithms that have been developed in [37]. The Rao-2 algorithm is used in this study as it has a high convergence rate.
The following equation can be used to describe the mathematical formulation of the Rao-2 algorithm:
X j , k p , i = X j , k p , i + R d 1 , j , i   X j , b e s t , i X j , w o r s t , i + R d 2 , j , i X j , k p , i o r   X j , l m , i     X j , l m , i o r   X j , k p , i  
where X j , kp , i denotes the value of jth variable design for kpth candidate solution after the ith iteration, and X j , kp , i   denotes the updated value of the next iteration. X j , best , i and   X j , worst , i   are the values of the j for the best and worst candidate solutions during the ith iteration, respectively.   Rd 1 , j , i   and   Rd 2 , j , i   are random numbers in the range [0, 1] for the jth variable during the ith iteration.
The terminology ( X j , kp , i   or   X j , lm , i     and   X j , lm , i   or   X j , kp , i   ) are used to compare the fitness values of a candidate solution k and a randomly chosen candidate solution.
The following are the key steps of the Rao-2 algorithm.
  • Step 1: Randomly distribute the population within the vector ranges.
  • Step 2: Determine the objective value for each variable.
  • Step 3: Define the worst and best solutions depending on the objective function’s values.
  • Step 4: Upgrade the solutions by (25).
  • Step 5: If any of the updated values fall outside of the range, they should be returned.
  • Step 6: Evaluate the value of each search agent’s objective function.
  • Step 7: Increase the number of iterations of the new one i t = i t + 1
  • Step 8: If the iteration has reached its end, return the best value so far. If not, go on to Step 3.
Figure 1 illustrates the main flowchart for the Rao-2.

3.2. Modified Rao Algorithm

The quasi-oppositional and Levy flight methods are used to enhance the conventional Rao technique in this paper.

3.2.1. Quasi-Oppositional

Opposition-based learning (OBL) [38] is a commonly used way to enhance several optimization algorithms such as Quasi-oppositional swine influenza model-based optimization with quarantine (QOSIMBO-Q) [39], quasi-oppositional teaching-learning (QOTLBO) [40], quasi oppositional bonobo optimizer (QOBO) [41], and Oppositional Jaya Algorithm [42].
The OBL can be improved by simultaneously using the candidate solution and the opposite. Therefore, this work will express the opposite solution of X B i in the Rao algorithm as
X j , kp , i qi = C + r 1 C X j , kp , i ,     |     X j , kp , i ) < C C r 1 X j , kp , i C ) ,     |     X j , kp , i ) C
where r 1 is a random number between [0, 1], and C is a middle point between X min i and X max i , which can be calculated as follows:
C = X min i + X max i 2

3.2.2. Levy Flight

The delivery of levy flight is used to boost the exploration phase using the following equation:
X j , kp , i levy = X j , kp , i + S × LF D
where D is the problem dimension, and   S is a vector of random values with size 1 × D . The LF is the levy flight function, which is calculated by the following equations:
LF x = 0.01 × μ × σ v 1 β
σ = Γ 1 + β × sin π β 2 Γ 1 + β 2 × β × 2 β 1 2 1 β
where μ and v are random values inside (0,1), β is a default constantset to 1.5, and Γ is a gamma function.
The updated Rao positions will then be chosen based on the value of the objective function where if the objective function of the updated Rao position using levy F X j , kp , i levy   is   lower   than   the objective function of the conventional Rao position F X j , kp , i then the new position will be the X j , kp , i levy otherwise the position will not be updated. Therefore, the following equation can be used to update the modified Rao:
X j , kp , i = X j , kp , i                if   F X j , kp , i < F X j , kp , i levy X j , kp , i levy ,              if     F X j , kp , i levy < F X j , kp , i

4. Simulation Results

4.1. Test Systems

In this paper, the IEEE 30-bus and IEEE 118-bus systems are used to prove the efficient performance of the proposed MRao-2. The data of lines and buses for the IEEE 30-bus system can be found in [43], while the data of lines and buses for the IEEE 118-bus system can be found in [28,44]. The IEEE 30-bus system has 41 transmission lines and 6 generating units. Bus 1 is selected as the slack bus and the load demand is 283.4 MW. Table 1 displays the upper and lower limits of the control variables in 30- bus system. The IEEE 118-bus system has 54 generation units and 186 transmission lines. Bus 69 is chosen as the slack bus and the total load of the network is 3733.07 MW [45]. The upper and lower limits of the control variables in 118-bus systems are also displayed in Table 1 [4]. The emission coefficients of the generators are taken from [46].
The modification to the IEEE 30-bus system is by adding the RES. The selection of the proper location of these RES in the test system is based on the power loss sensitivity and generation cost to each real and imaginary power as stated in [47]. The results in [47] presented that the optimum location is bus 30 and the value chosen of RES is 20MW. Figure 2 shows a single line diagram of the modified IEEE 30-bus system.
The modification to the standard IEEE 118-bus test system is by adding RES based on that in [48]. The location and values of the RES in the IEEE 118-bus test systems are tabulated in Table 2. A single line diagram of the modified IEEE 118-bus system is presented in Figure 3.
In this article, the numerical simulations studies have been run on an Intel ®® core TM i5-7200U CPU with 8 GB of RAM using MATLAB 2016a. The proposed MRao-2 technique is employed to find the best solution for the OPF problem in different cases considering the fuel cost, emission, transmission loss, and improvement of the voltage profile. The results of MRao-2 are compared with the ASO Algorithm [49], TFWO [50], MPA [51], and Rao algorithms: Three metaphor-less simple algorithms (Rao-1, Rao-2, and Rao-3) [37]. The parameters settings of the different optimization techniques are shown in Table 3.

4.2. Case 1: The OPF without RES for the IEEE 30-Bus System

The proposed MRao-2 is used in this case to achieve the best solution for the OPF problem without RES and considering the fuel cost, power loss, emission, and voltage profile improvement. Table 4 presents the results of the MRao-2 algorithm in comparison with other techniques. These results confirm that the MRao-2 technique outperforms other algorithms. Its objective function (Fuel Cost = 800.4412 $/h) is better than all other algorithms and it performs without any violation of the constraints. The voltage profile of the proposed MRao-2 is displayed in Figure 4. It can be observed from this figure that all voltage magnitudes at all buses of the power system are within the boundaries presented in Table 1. Given the convergence characteristics of all algorithms for the optimal solutions that have been achieved by the ASO, TFWO, MPA, Rao algorithms, and MRao-2 in this case, the proposed MRao-2 has a smooth convergence characteristics curve to the best solution with a rapid convergence rate and without oscillations in comparison with all other techniques as displayed in Figure 5. It is shown in Figure 5 that the supremacy of the MRao-2 over the recent other techniques is proven in the last iterations as it converges to the best solution.
Furthermore, Figure 6 shows graphic comparisons for 20 individual runs (i.e., fuel cost) obtained from the proposed algorithm compared with the other six algorithms in the form of a boxplot graph. These boxplots present the mean performance of techniques that can be compared visually. There are five elements that can be defined from each boxplot as follows: first quartile, minimum, third quartile, maximum, and median. The median value is the line inside the box. These boxplots are drawn after 20 individual runs for each technique, and they display the classification precision. It can be seen that the MRao-2 algorithm has a lower boxplot compared to the other well-known techniques. Furthermore, the median of the proposed MRao-2 has a minimum value compared to the other techniques. It can be observed from this figure that the proposed MRao-2 is competitive and often superior to the other recent algorithms. Furthermore, the proposed MRao-2 technique delivers the optimal results in terms of precision and reliability compared to the other techniques. The optimal fuel cost listed in Table 5 shows that the proposed MRao-2 technique is more effective than other approaches in obtaining the best solutions as its fuel cost is less than those of others.

4.3. Case 2: OPF Incorporating RES for the IEEE 30-Bus System

The proposed MRao-2 technique is employed in the second case to reach the optimum solution for the OPF problem incorporating RES, considering the generation cost, transmission loss, emission, and improvement of voltage profile. Next, the obtained results using the proposed MRao-2 algorithm are compared with ASO, TFWO, MPA, Rao-1, Rao-2, and Rao-3 algorithms. The results of all the techniques for this case are listed in Table 6.
It is seen from these results that the MRao-2 technique is also more effective than other techniques in reaching the best solution for the OPF problem with fuel cost and RES. Its fitness function (Fuel cost = 729.3429 $/h) is less than all other algorithms and it does not violate the constraints. Furthermore, the objective function of the MRao-2 technique is reduced from 800.4412 $/h (case 1) to 729.3429 $/h (case 2) by 8.88% after incorporating the RES as expected. By entering the RES as a negative load, the total load of the power system is decreased, which reduces the generation cost of the conventional thermal generators.
Furthermore, as in the previous case, the voltage magnitude of all buses is within their boundaries as shown in Figure 7. After incorporating the RES, the proposed MRao-2 has also smooth and speedy convergence curves in comparison with other algorithms as presented in Figure 8. The Boxplot graph of best Fuel cost in 20 runs of the proposed MRao-2 and other recent algorithms for case 2 is presented in Figure 9.

4.4. Case 3: OPF Incorporating RES under Contingency State for IEEE 30-Bus System

In this case, a contingency state is simulated by the outage of two lines. These lines are line (10–17) and line (10–21). Table 7 tabulates the obtained results using the proposed MRao-2 and other algorithms. According to these results, the proposed MRao-2 technique provides the best solution for the fitness function in comparison with other algorithms including RES during the contingency state and without any violation of the constraints. Figure 10 displays the voltage profile of the MRao-2 technique, while Figure 11 shows the convergence characteristics of all algorithms. From these figures, it is clear that all voltage magnitudes are within the constraints and the proposed MRao-2 has smooth convergence features with speedy convergence in comparison with other techniques. Furthermore, Figure 12 displays the Boxplot graph of best Fuel cost in individual 20 runs of the proposed MRao-2 and other recent algorithms for this case.
The statistical results of the proposed MRao-2 and the other recently algorithms for 20 individual runs for each case are presented in Table 8. Most researchers choose the minimum, mean, median, maximum, and standard deviation (STD) values to demonstrate the superiority and effectiveness of a technique. Table 8 shows the minimum, average, median, maximum, and STD values of the fuel cost as the objective function for all cases. These results confirm the supremacy of the proposed algorithm on the other algorithms.

4.5. Case 4: OPF without RES for the IEEE 118-Bus System

In this case, the MRao-2 is utilized to find the optimum solution for the OPF problem for the IEEE 118-bus system considering the fuel cost, transmission loss, and improvement of the voltage profile and without considering the RES. In this paper, this system is chosen to test the scalability of the MRao-2 technique and demonstrate its robustness to apply it to solve the OPF for large-scale systems. Table 9 presents the obtained results using the proposed MRao-2 algorithm. These results are compared with ASO, TFWO, MPA, Rao-1, Rao-2, and Rao-3, and this comparison is listed in Table 10. These results confirm the supremacy of the MRao-2 algorithm over other techniques in achieving the best solution for the OPF problem with the Fuel cost as an objective function for the large-scale electrical power system without considering the RES.
The MRao-2’s objective function (Fuel cost = 131,457.8 $/h) is less than the fitness function of other algorithms without any violation of the restraints. Figure 13 displays the magnitudes of the voltages of all buses are within the limits. Moreover, the MRao-2 has smooth and speedy convergence curves in comparison with other algorithms as shown in Figure 14.

4.6. Case 5: OPF Incorporating RES for the IEEE 118-Bus System

In this case, the proposed MRao-2 technique is applied to the IEEE 118-bus system to check the ability of the proposed algorithm to solve the OPF for the large-scale system considering the RES. Table 11 tabulates the obtained results using the proposed MRao-2 algorithm. Furthermore, the results of the MRao-2 technique and other algorithms for this case are presented in Table 12. These results of the fuel cost for this case by ASO, TFWO, MPA, Rao-1, Rao-2, Rao-3, and MRao-2 algorithms are 103,847.47, 101,747.68, 101,981.69, 101,981.17, 101,078.92, 101,297.12, and 100,738.54 $/h, respectively. These results show that the proposed MRao-2 achieves a better solution than other algorithms in solving the OPF considering RES using the large-scale system and without any violation of the limits. Furthermore, adding RES to the IEEE 118-bus system decreases the fuel cost as an objective function of the MRao-2 by 23.4%. Figure 15 displays the magnitudes of the voltage of all buses of the MRao-2 are within the limits. Figure 16 shows that the proposed MRao-2 has smooth and speedy convergence curves in comparison with other techniques even for large-scale systems.

5. Conclusions

In this article, a new technique has been proposed for finding the optimum solution to the OPF problem incorporating renewable energy sources considering the fuel cost, transmission loss, emission, and improvement of the voltage profile. To overcome the shortcomings of the original Rao-2, the MRao-2 algorithm has been proposed using the quasi-oppositional and levy methods. The superiority and effectiveness of MRao-2 have been checked based on two standard test systems (IEEE 30-bus system and IEEE 118-bus system) with or without RES. It is obvious from the results that the MRao-2 provided a better solution of the objective function for all cases over other algorithms employed in the comparison. The obtained results using MRao-2 in comparison with those obtained using other recent techniques show that the proposed MRao-2 is superior to these algorithms for normal, contingency states and with incorporating RES whatsoever the scale of the power system which shows the strength of the MRao-2 to solve the real-life application.

Author Contributions

Conceptualization, M.H.H., A.S., and S.K.; data curation, T.K. and J.L.D.-G.; formal analysis, M.H.H., A.S., and S.K.; resources, T.K. and J.L.D.-G.; methodology, M.H.H. A.S. and S.K.; software, M.H.H., A.S., and S.K.; supervision, T.K. and J.L.D.-G.; validation, T.K. and J.L.D.-G.; visualization, M.H.H., A.S., and S.K.; writing—original draft, M.H.H., A.S., and S.K.; writing—review and editing, T.K. and J.L.D.-G. All authors together organized and refined the manuscript in the present form. All authors have approved the final version of the submitted paper. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Sulaiman, M.H.; Mustaffa, Z.; Mohamad, A.J.; Saari, M.M.; Mohamed, M.R. Optimal power flow with stochastic solar power using barnacles mating optimizer. Int. Trans. Electr. Energy Syst. 2021, 31, e12858. [Google Scholar] [CrossRef]
  2. Abaci, K.; Yamacli, V. Differential search algorithm for solving multi-objective optimal power flow problem. Int. J. Electr. Power Energy Syst. 2016, 79, 1–10. [Google Scholar] [CrossRef]
  3. Ben Hmida, J.; Chambers, T.; Lee, J. Solving constrained optimal power flow with renewables using hybrid modified imperialist competitive algorithm and sequential quadratic programming. Electr. Power Syst. Res. 2019, 177, 105989. [Google Scholar] [CrossRef]
  4. Elattar, E.E.; ElSayed, S.K. Modified JAYA algorithm for optimal power flow incorporating renewable energy sources considering the cost, emission, power loss and voltage profile improvement. Energy 2019, 178, 598–609. [Google Scholar] [CrossRef]
  5. Shaheen, M.A.M.; Hasanien, H.M.; Al-Durra, A. Solving of Optimal Power Flow Problem Including Renewable Energy Resources Using HEAP Optimization Algorithm. IEEE Access 2021, 9, 35846–35863. [Google Scholar] [CrossRef]
  6. Frank, S.; Steponavice, I.; Rebennack, S. Optimal power flow: A bibliographic survey I. Energy Syst. 2012, 3, 221–258. [Google Scholar] [CrossRef]
  7. Momoh, J.A.; Adapa, R.; El-Hawary, M.E. A review of selected optimal power flow literature to 1993. I. Nonlinear and quadratic programming approaches. IEEE Trans. Power Syst. 1999, 14, 96–104. [Google Scholar] [CrossRef]
  8. Yan, X.; Quintana, V.H. Improving an interior-point-based OPF by dynamic adjustments of step sizes and tolerances. IEEE Trans. Power Syst. 1999, 14, 709–717. [Google Scholar] [CrossRef]
  9. Khunkitti, S.; Siritaratiwat, A.; Premrudeepreechacharn, S.; Chatthaworn, R.; Watson, N. A Hybrid DA-PSO Optimization Algorithm for Multiobjective Optimal Power Flow Problems. Energies 2018, 11, 2270. [Google Scholar] [CrossRef] [Green Version]
  10. Khan, A.; Hizam, H.; Abdul-Wahab, N.I.; Othman, M.L. Solution of Optimal Power Flow Using Non-Dominated Sorting Multi Objective Based Hybrid Firefly and Particle Swarm Optimization Algorithm. Energies 2020, 13, 4265. [Google Scholar] [CrossRef]
  11. Taher, M.A.; Kamel, S.; Jurado, F.; Ebeed, M. Modified grasshopper optimization framework for optimal power flow solution. Electr. Eng. 2019, 101, 121–148. [Google Scholar] [CrossRef]
  12. Shaheen, A.M.; El-Sehiemy, R.A.; Farrag, S.M. Solving multi-objective optimal power flow problem via forced initialised differential evolution algorithm. IET Gener. Transm. Distrib. 2016, 10, 1634–1647. [Google Scholar] [CrossRef]
  13. Warid, W. Optimal power flow using the AMTPG-Jaya algorithm. Appl. Soft Comput. 2020, 91, 106252. [Google Scholar] [CrossRef]
  14. Attia, A.-F.; El Sehiemy, R.A.; Hasanien, H.M. Optimal power flow solution in power systems using a novel Sine-Cosine algorithm. Int. J. Electr. Power Energy Syst. 2018, 99, 331–343. [Google Scholar] [CrossRef]
  15. Abdo, M.; Kamel, S.; Ebeed, M.; Yu, J.; Jurado, F. Solving Non-Smooth Optimal Power Flow Problems Using a Developed Grey Wolf Optimizer. Energies 2018, 11, 1692. [Google Scholar] [CrossRef] [Green Version]
  16. Abd el-sattar, S.; Kamel, S.; Ebeed, M.; Jurado, F. An improved version of salp swarm algorithm for solving optimal power flow problem. Soft Comput. 2021, 25, 4027–4052. [Google Scholar] [CrossRef]
  17. Sulaiman, M.H.; Mustaffa, Z. Solving optimal power flow problem with stochastic wind–solar–small hydro power using barnacles mating optimizer. Control Eng. Pract. 2021, 106, 104672. [Google Scholar] [CrossRef]
  18. Kaymaz, E.; Duman, S.; Guvenc, U. Optimal power flow solution with stochastic wind power using the Lévy coyote optimization algorithm. Neural Comput. Appl. 2021, 33, 6775–6804. [Google Scholar] [CrossRef]
  19. Premkumar, M.; Babu, T.S.; Umashankar, S.; Sowmya, R. A new metaphor-less algorithms for the photovoltaic cell parameter estimation. Optik 2020, 208, 164559. [Google Scholar] [CrossRef]
  20. Wang, L.; Wang, Z.; Liang, H.; Huang, C. Parameter estimation of photovoltaic cell model with Rao-1 algorithm. Optik (Stuttgart) 2020, 210, 163846. [Google Scholar] [CrossRef]
  21. Jian, X.; Zhu, Y. Parameters identification of photovoltaic models using modified Rao-1 optimization algorithm. Optik (Stuttgart) 2021, 231, 166439. [Google Scholar] [CrossRef]
  22. Lekouaghet, B.; Boukabou, A.; Boubakir, C. Estimation of the photovoltaic cells/modules parameters using an improved Rao-based chaotic optimization technique. Energy Convers. Manag. 2021, 229, 113722. [Google Scholar] [CrossRef]
  23. Rao, R.V.; Pawar, R.B. Constrained design optimization of selected mechanical system components using Rao algorithms. Appl. Soft Comput. 2020, 89, 106141. [Google Scholar] [CrossRef]
  24. Rao, R.V.; Keesari, H.S. Rao algorithms for multi-objective optimization of selected thermodynamic cycles. Eng. Comput. 2020. [Google Scholar] [CrossRef]
  25. Venkata Rao, R.; Pawar, R.B. Optimal Weight Design of a Spur Gear Train Using Rao Algorithms. In Proceedings of the International Conference on Sustainable and Innovative Solutions for Current Challenges in Engineering & Technology, Gwalior, India, 2–3 November 2019; pp. 351–362. [Google Scholar]
  26. Grzywiński, M.; Dede, T. New Optimization Algorithms and their Application for 2d Truss Structures. Zesz. Nauk. Politech. Częstochowskiej. Bud. 2020, 175, 50–54. [Google Scholar] [CrossRef]
  27. Rao, R.V.; Pawar, R.B. Quasi-oppositional-based Rao algorithms for multi-objective design optimization of selected heat sinks. J. Comput. Des. Eng. 2020, 7, 830–863. [Google Scholar] [CrossRef]
  28. 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]
  29. Sharma, S.R.; Singh, B.; Kaur, M. Classification of Parkinson disease using binary Rao optimization algorithms. Expert Syst. 2021, 38, e12674. [Google Scholar] [CrossRef]
  30. Zabaiou, T.; Dessaint, L.; Kamwa, I. Preventive control approach for voltage stability improvement using voltage stability constrained optimal power flow based on static line voltage stability indices. IET Gener. Transm. Distrib. 2014, 8, 924–934. [Google Scholar] [CrossRef] [Green Version]
  31. Elattar, E.E. Modified harmony search algorithm for combined economic emission dispatch of microgrid incorporating renewable sources. Energy 2018, 159, 496–507. [Google Scholar] [CrossRef]
  32. Biswas, P.P.; Suganthan, P.N.; Mallipeddi, R.; Amaratunga, G.A.J. Optimal power flow solutions using differential evolution algorithm integrated with effective constraint handling techniques. Eng. Appl. Artif. Intell. 2018, 68, 81–100. [Google Scholar] [CrossRef]
  33. Birogul, S. Hybrid Harris Hawk Optimization Based on Differential Evolution (HHODE) Algorithm for Optimal Power Flow Problem. IEEE Access 2019, 7, 184468–184488. [Google Scholar] [CrossRef]
  34. Duong, T.L.; Nguyen, N.A.; Nguyen, T.T. A Newly Hybrid Method Based on Cuckoo Search and Sunflower Optimization for Optimal Power Flow Problem. Sustainability 2020, 12, 5283. [Google Scholar] [CrossRef]
  35. Farhat, I.A.; El-Hawary, M.E. Dynamic adaptive bacterial foraging algorithm for optimum economic dispatch with valve-point effects and wind power. IET Gener. Transm. Distrib. 2010, 4, 989. [Google Scholar] [CrossRef]
  36. Nwulu, N.I.; Xia, X. Optimal dispatch for a microgrid incorporating renewables and demand response. Renew. Energy 2017, 101, 16–28. [Google Scholar] [CrossRef]
  37. Rao, R.V. Rao algorithms: Three metaphor-less simple algorithms for solving optimization problems. Int. J. Ind. Eng. Comput. 2020, 11, 107–130. [Google Scholar] [CrossRef]
  38. Tizhoosh, H.R. Opposition-Based Learning: A New Scheme for Machine Intelligence. In Proceedings of the International Conference on Computational Intelligence for Modelling, Control and Automation and International Conference on Intelligent Agents, Web Technologies and Internet Commerce (CIMCA-IAWTIC’06), Vienna, Austria, 28–30 November 2005; Volume 1, pp. 695–701. [Google Scholar]
  39. Sharma, S.; Bhattacharjee, S.; Bhattacharya, A. Quasi-Oppositional Swine Influenza Model Based Optimization with Quarantine for optimal allocation of DG in radial distribution network. Int. J. Electr. Power Energy Syst. 2016, 74, 348–373. [Google Scholar] [CrossRef]
  40. Sultana, S.; Roy, P.K. Multi-objective quasi-oppositional teaching learning based optimization for optimal location of distributed generator in radial distribution systems. Int. J. Electr. Power Energy Syst. 2014, 63, 534–545. [Google Scholar] [CrossRef]
  41. Kharrich, M.; Mohammed, O.H.; Kamel, S.; Selim, A.; Sultan, H.M.; Akherraz, M.; Jurado, F. Development and Implementation of a Novel Optimization Algorithm for Reliable and Economic Grid-Independent Hybrid Power System. Appl. Sci. 2020, 10, 6604. [Google Scholar] [CrossRef]
  42. Yu, J.; Kim, C.-H.; Rhee, S.-B. Oppositional Jaya Algorithm With Distance-Adaptive Coefficient in Solving Directional Over Current Relays Coordination Problem. IEEE Access 2019, 7, 150729–150742. [Google Scholar] [CrossRef]
  43. Taha, I.B.M.; Elattar, E.E. Optimal reactive power resources sizing for power system operations enhancement based on improved grey wolf optimiser. IET Gener. Transm. Distrib. 2018, 12, 3421–3434. [Google Scholar] [CrossRef]
  44. Christie, R. Power Systems Test Case Archive, University of Washington. Available online: http://www.ee.washington.edu/research/pstca/ (accessed on 26 May 2021).
  45. Duman, S.; Rivera, S.; Li, J.; Wu, L. Optimal power flow of power systems with controllable wind-photovoltaic energy systems via differential evolutionary particle swarm optimization. Int. Trans. Electr. Energy Syst. 2020, 30, 1–28. [Google Scholar] [CrossRef]
  46. Hazra, J.; Sinha, A.K. A multi-objective optimal power flow using particle swarm optimization. Eur. Trans. Electr. Power 2011, 21, 1028–1045. [Google Scholar] [CrossRef]
  47. Warid, W.; Hizam, H.; Mariun, N.; Abdul-Wahab, N. Optimal Power Flow Using the Jaya Algorithm. Energies 2016, 9, 678. [Google Scholar] [CrossRef]
  48. Pena, I.; Martinez-Anido, C.B.; Hodge, B.-M. An Extended IEEE 118-Bus Test System With High Renewable Penetration. IEEE Trans. Power Syst. 2018, 33, 281–289. [Google Scholar] [CrossRef]
  49. Zhao, W.; Wang, L.; Zhang, Z. Atom search optimization and its application to solve a hydrogeologic parameter estimation problem. Knowl.-Based Syst. 2019, 163, 283–304. [Google Scholar] [CrossRef]
  50. Ghasemi, M.; Davoudkhani, I.F.; Akbari, E.; Rahimnejad, A.; Ghavidel, S.; Li, L. A novel and effective optimization algorithm for global optimization and its engineering applications: Turbulent Flow of Water-based Optimization (TFWO). Eng. Appl. Artif. Intell. 2020, 92, 103666. [Google Scholar] [CrossRef]
  51. Faramarzi, A.; Heidarinejad, M.; Mirjalili, S.; Gandomi, A.H. Marine Predators Algorithm: A nature-inspired metaheuristic. Expert Syst. Appl. 2020, 152, 113377. [Google Scholar] [CrossRef]
  52. Rezaei Adaryani, M.; Karami, A. Artificial bee colony algorithm for solving multi-objective optimal power flow problem. Int. J. Electr. Power Energy Syst. 2013, 53, 219–230. [Google Scholar] [CrossRef]
  53. Ramesh Kumar, A.; Premalatha, L. Optimal power flow for a deregulated power system using adaptive real coded biogeography-based optimization. Int. J. Electr. Power Energy Syst. 2015, 73, 393–399. [Google Scholar] [CrossRef]
  54. Mohamed, A.-A.A.; Mohamed, Y.S.; El-Gaafary, A.A.M.; Hemeida, A.M. Optimal power flow using moth swarm algorithm. Electr. Power Syst. Res. 2017, 142, 190–206. [Google Scholar] [CrossRef]
  55. Niknam, T.; Narimani, M.R.; Azizipanah-Abarghooee, R. A new hybrid algorithm for optimal power flow considering prohibited zones and valve point effect. Energy Convers. Manag. 2012, 58, 197–206. [Google Scholar] [CrossRef]
  56. El-Fergany, A.A.; Hasanien, H.M. Single and Multi-objective Optimal Power Flow Using Grey Wolf Optimizer and Differential Evolution Algorithms. Electr. Power Compon. Syst. 2015, 43, 1548–1559. [Google Scholar] [CrossRef]
Figure 1. Flowchart of Rao-2 algorithm.
Figure 1. Flowchart of Rao-2 algorithm.
Mathematics 09 01532 g001
Figure 2. Single-line diagram of the modified IEEE 30-bus test system.
Figure 2. Single-line diagram of the modified IEEE 30-bus test system.
Mathematics 09 01532 g002
Figure 3. Single-line diagram of IEEE 118-bus test system.
Figure 3. Single-line diagram of IEEE 118-bus test system.
Mathematics 09 01532 g003
Figure 4. The voltage profile of the MRao-2 for the best solutions of case 1.
Figure 4. The voltage profile of the MRao-2 for the best solutions of case 1.
Mathematics 09 01532 g004
Figure 5. Convergence characteristics of the proposed MRao-2 and other recent algorithms for case 1.
Figure 5. Convergence characteristics of the proposed MRao-2 and other recent algorithms for case 1.
Mathematics 09 01532 g005
Figure 6. Boxplot graph of best Fuel cost in 20 runs of the proposed MRao-2 and other recent algorithms for case 1.
Figure 6. Boxplot graph of best Fuel cost in 20 runs of the proposed MRao-2 and other recent algorithms for case 1.
Mathematics 09 01532 g006
Figure 7. The voltage profile of the MRao-2 for case 2.
Figure 7. The voltage profile of the MRao-2 for case 2.
Mathematics 09 01532 g007
Figure 8. Convergence characteristics curves of all algorithms for case 2.
Figure 8. Convergence characteristics curves of all algorithms for case 2.
Mathematics 09 01532 g008
Figure 9. Boxplot graph of best Fuel cost in 20 runs of the proposed MRao-2 and other recent algorithms for case 2.
Figure 9. Boxplot graph of best Fuel cost in 20 runs of the proposed MRao-2 and other recent algorithms for case 2.
Mathematics 09 01532 g009
Figure 10. The voltage profile of the MRao-2 for case 3.
Figure 10. The voltage profile of the MRao-2 for case 3.
Mathematics 09 01532 g010
Figure 11. Convergence characteristics of all methods for case 3.
Figure 11. Convergence characteristics of all methods for case 3.
Mathematics 09 01532 g011
Figure 12. Boxplot graph of best Fuel cost in 20 runs of the proposed MRao-2 and other recent algorithms for case 3.
Figure 12. Boxplot graph of best Fuel cost in 20 runs of the proposed MRao-2 and other recent algorithms for case 3.
Mathematics 09 01532 g012
Figure 13. The voltage profile of the MRao-2 for case 4.
Figure 13. The voltage profile of the MRao-2 for case 4.
Mathematics 09 01532 g013
Figure 14. Convergence characteristics of all methods for case 4.
Figure 14. Convergence characteristics of all methods for case 4.
Mathematics 09 01532 g014
Figure 15. The voltage profile of the MRao-2 for case 5.
Figure 15. The voltage profile of the MRao-2 for case 5.
Mathematics 09 01532 g015
Figure 16. Convergence characteristics of all methods for case 5.
Figure 16. Convergence characteristics of all methods for case 5.
Mathematics 09 01532 g016
Table 1. Limit setting for control variables of the all-test systems [4].
Table 1. Limit setting for control variables of the all-test systems [4].
IEEE 30-Bus SystemIEEE 118-Bus System
VariablesLower limitUpper limitLower limitUpper limit
Voltages for all generator bus0.95 p.u1.1 p.u0.94 p.u1.06 p.u
Voltages for all load bus0.95 p.u1.05 p.u0.95 p.u1.05 p.u
Tap setting0.9 p.u1.1 p.u0.9 p.u1.1 p.u
Reactive power of capacitor banks00.05 p.u00.3 p.u
Table 2. The location and values of the RES in the IEEE 118-bus test systems.
Table 2. The location and values of the RES in the IEEE 118-bus test systems.
Type of RESNo. of BusValue (MW)
biomass1218.2
wind31156
solar54264
hydro7677
hydro116286
Table 3. The parameter settings of different optimization techniques.
Table 3. The parameter settings of different optimization techniques.
AlgorithmsParameters Setting
Common settings
  • Population size: nPop = 30
  • Maximum iterations: Max_iter = 200 for IEEE 30-bus test system and Max_iter = 300 for IEEE 118-bus test system.
  • Number of independent runs: 20.
ASO
  • depth weight a = 50.
  • multiplier weight β = 0.2.
MPA
FADs = 0.2, P = 0.5, C = 0.05, e = 0.25
Table 4. Results of the proposed MRao-2 algorithm and other algorithms for case 1.
Table 4. Results of the proposed MRao-2 algorithm and other algorithms for case 1.
ASOTFWOMPARao-1Rao-2Rao-3MRao-2
PG1 (MW)176.9732177.2422176.8351179.8369177.887177.5088176.3625
PG2 (MW)48.9100648.6455848.6757549.4971249.3652448.7695949.07412
PG5 (MW)21.3021321.3680321.4598222.2152121.5478620.9415521.24651
PG8 (MW)20.925321.3559621.8862118.7738821.656421.5304621.37135
PG11 (MW)12.4541111.8647611.5440910.3834810.0079611.8091112.21261
PG13 (MW)12.0013712.0014812.024181212.0477512.003912.10508
V1 (p.u.)1.0800291.0799841.0822371.0786751.0843041.0806981.083304
V2 (p.u.)1.0809921.0300471.0832371.0278241.0943441.0999991.092657
V5 (p.u.)1.0280331.0826771.0314791.0857371.0312641.0282621.029766
V8 (p.u.)1.0343581.0354511.0376661.0334041.0375391.0364111.037062
V11 (p.u.)1.0064031.058731.0656921.0781671.0772431.0311841.059477
V13 (p.u.)1.0360551.0676771.0290761.0573871.0342431.0998241.046984
T11 (6–9)0.963650.9727270.9635451.0147861.0312080.9160341.002334
T12 (6–10)1.0145611.0123581.053310.9830260.91.0999790.953247
T15 (4–12)1.0569130.9944810.9897851.0010.9644181.0312750.971027
T36 (28–27)0.994030.9715731.0006750.9752130.9804590.9872510.971058
QC10 (MVAR)3.05264.97843.20350.57270.13620.005623.7024
QC12 (MVAR)3.59390.55944.6390.71861.32280.004262.0306
QC15 (MVAR)2.56114.6353.950254.92424.95672.2152
QC17 (MVAR)1.64443.78781.50663.37254.23380.07024.6995
QC20 (MVAR)1.98984.50014.86184.47743.14844.98713.859
QC21 (MVAR)3.41914.10613.59773.99930.25864.85574.8858
QC23 (MVAR)4.76180.001684.34760.8183.28470.04513.9984
QC24 (MVAR)1.12822.19954.56184.96924.92434.97414.8289
QC29 (MVAR)1.56460.44153.56862.19774.96852.37851.6698
Fuel cost ($/h)801.0005800.6477800.5804800.8944800.6166800.848800.4412
Emission (ton/h)0.2957360.2960490.2956440.2978210.2963130.2963840.295152
Power loss (MW)9.1778899.0834319.0368279.3121499.1238839.1634248.983817
Voltage deviation (p.u.)0.3348050.7494580.5753010.7073130.9166520.4693780.868108
Time (s)95.06342104.1479166.5552101.9174394.84023101.83725169.6059
Table 5. Simulation results of MRao-2 and other algorithms for Case 1.
Table 5. Simulation results of MRao-2 and other algorithms for Case 1.
AlgorithmMinMaxAverage
MRao-2800.4412800.553800.4872
Rao-2800.6166800.7965800.7118
Rao-1800.8944801.2647800.9678
Rao-3800.848800.9628800.9067
MPA800.5804800.8416800.6659
TFWO800.6477803.8754801.1159
ASO801.0005801.4358801.101
MGOA [11]800.4744NANA
ABC [52]800.6600800.8715801.8674
Jaya [47]800.4794800.4928800.5306
ARCBBO [53]800.5159800.6412800.9262
MSA [54]800.5099NANA
Hybrid SFLA SA [55]801.79NANA
HHO [33]801.4228NANA
HHODE [33]800.9959NANA
DE [56]801.23801.622801.282
Table 6. Results of the proposed MRao-2 algorithm and other algorithms for case 2.
Table 6. Results of the proposed MRao-2 algorithm and other algorithms for case 2.
ASOTFWOMPARao-1Rao-2Rao-3MRao-2
PG1 (MW)166.3103167.0352166.5015167.7043167.5941167.2709167.2508
PG2 (MW)45.8808746.2925646.0305947.3856645.7191447.1977546.42704
PG5 (MW)20.970920.6438220.4590520.9039320.611820.6900420.64984
PG8 (MW)15.6975615.6820615.1776313.7422915.1370514.4755415.27324
PG11 (MW)10.7972410.0000911.103941010.5395610.0081310
PG13 (MW)12.002621212.328511212.0388512.0452912
V1 (p.u.)1.0779671.0819661.07881.0778751.0800781.0800891.07852
V2 (p.u.)1.0723751.0062691.11.0944771.0516561.0633041.1
V5 (p.u.)1.0331461.0571911.0313881.0762211.0772621.05721.032235
V8 (p.u.)1.0317981.0367811.0385911.0388881.0398081.0406991.026295
V11 (p.u.)1.020981.0998261.0935791.0495871.046571.0783591.047772
V13 (p.u.)1.0425081.0222071.0141051.014951.0097771.0227991.062827
T11(6–9)0.9868740.9890941.0277450.995341.096460.9910780.98482
T12(6–10)1.0053781.10.9570090.9281920.9084951.0730450.977984
T15(4–12)0.9755540.9876070.9814130.9814910.9718420.9703770.981403
T36(28–27)1.0018870.993110.991950.9978221.0172731.0102521.001331
QC10 (MVAR)4.11564.75372.76514.79772.80594.93074.9494
QC12 (MVAR)2.84664.8213.86823.61571.41470.01710
QC15 (MVAR)3.41264.88180.52514.30051.29583.80490.0184
QC17 (MVAR)2.91064.29424.99940.33544.62243.12394.8752
QC20 (MVAR)2.38322.93944.69974.6914.3943.19544.8711
QC21 (MVAR)2.947850.37641.86473.312105
QC23 (MVAR)1.41591.91672.98071.02384.993755
QC24 (MVAR)2.698550.88893.94914.91914.70074.9522
QC29 (MVAR)2.73820.30912.04651.54144.27862.3022.282
Fuel cost ($/h)729.9074729.6002729.6347729.6406729.5025729.5657729.3429
Emission (ton/h)0.2878940.2884360.2881630.2884930.2891140.288280.288559
Power loss (MW)8.2710748.2648718.2126818.3416418.2459048.2930498.21248
Voltage deviation (p.u.)0.4879350.5871880.7230050.746430.5993030.5546580.890863
Time (s)96.3905101.40315154.300293.2644892.4016495.84038166.5166
Table 7. Results of the proposed method and other methods for case 3.
Table 7. Results of the proposed method and other methods for case 3.
ASOTFWOMPARao-1Rao-2Rao-3MRao-2
PG1 (MW)169.1157167.646168.4079166.1685168.162168.2884167.6707
PG2 (MW)47.1012246.3815646.7376846.2931946.3434946.3513346.43635
PG5 (MW)20.7724520.6894720.802120.2298820.6174820.7068120.82097
PG8 (MW)12.425715.2924213.259917.2830514.8019214.4544314.76838
PG11 (MW)10.90891010.938761010.0960510.2419410.22822
PG13 (MW)12.01361212.0033112.0253512.0053812.0084512.05377
V1 (p.u.)1.0711781.0807971.0827931.0888811.0828471.0811431.08205
V2 (p.u.)1.0911771.09251.0330381.0630131.0841061.0820921.083835
V5 (p.u.)1.0183461.0316451.0862761.0542941.0314561.0267071.032011
V8 (p.u.)1.0237941.0366611.0378181.0342091.0336351.0335711.03592
V11 (p.u.)1.0388971.0719951.0831391.0595271.0298081.0744681.029754
V13 (p.u.)1.0192251.0429841.0476331.0398931.0469661.0452771.04714
T11 (6–9)0.9660490.9659951.053690.9736161.0404381.0785131.06788
T12 (6–10)0.9701511.0999860.9393591.0164850.9060380.90.900135
T15 (4–12)0.960750.9840420.9579960.9619990.9849070.9881150.980633
T36 (28–27)1.0140581.0068991.0114241.018081.0177491.0100591.010374
QC10 (MVAR)3.35141.80781.9934.64490.06430.15010.0246
QC12 (MVAR)2.40554.52982.48460.5150.91833.21650.0275
QC15 (MVAR)3.077654.30234.58034.49134.92031.5989
QC17 (MVAR)3.328352.73114.23874.99644.72694.994
QC20 (MVAR)3.924802.51870.21831.94720.01494.8959
QC21 (MVAR)4.419950.243.2204554.9499
QC23 (MVAR)2.51120.7021.79234.99994.992403.431
QC24 (MVAR)4.587552.94471.95014.83434.99895
QC29 (MVAR)2.761302.76 × 10−500.002590.05140.0739
Fuel cost ($/h)731.4898730.6851731.0095731.0468730.6201730.688730.583
Emission (ton/h)0.2898020.2888850.2893410.2878740.2893450.2894160.288841
Power loss (MW)8.9491458.6209268.7550228.6053398.637878.6629018.589888
Voltage deviation (p.u.)0.5955550.6267410.736080.6932860.6958920.6659410.665648
Time (s)94.165398.40031153.330295.6141898.299797.24576164.5099
Table 8. Statistical results comparison of investigated cases for IEEE 30-bus system for different recent optimization algorithm.
Table 8. Statistical results comparison of investigated cases for IEEE 30-bus system for different recent optimization algorithm.
Case No.AlgorithmMinAverageMedianMaxSTD
Case 1MRao-2800.4412800.4872800.4769800.5530.038822
Rao-2800.6166800.7118800.7135800.79650.052478
Rao-1800.8944800.9678800.9277801.26470.111619
Rao-3800.848800.9067800.9167800.96280.0403
MPA800.5804800.6659800.6347800.84160.081797
TFWO800.6477801.1159800.855803.87540.975128
ASO801.0005801.101801.0422801.43580.152133
Case 2MRao-2729.3429729.4065729.4001729.46150.042289
Rao-2729.5025729.5599729.5596729.62050.040197
Rao-1729.6406729.6845729.6815729.74410.031135
Rao-3729.5657729.5888729.5903729.63610.021254
MPA729.6347729.674729.6771729.70950.024818
TFWO729.6002730.1646729.782732.10790.813312
ASO729.9074730.3542730.251731.5550.513813
Case 3MRao-2730.583730.6588730.6266730.81890.09241
Rao-2730.6201730.7573730.747730.93110.141165
Rao-1731.0468731.132731.1247731.23590.090685
Rao-3730.688730.8235730.8296730.98790.113336
MPA731.0095731.136731.14731.29270.111756
TFWO730.6851730.9124730.8677731.35530.23962
ASO731.4898731.8588731.6576732.95150.546641
Table 9. Optimal settings of control variables for case 4 using MRao-2.
Table 9. Optimal settings of control variables for case 4 using MRao-2.
VariablesValueVariablesValueVariablesValueVariablesValueVariablesValue
PG1 (MW)1.984061PG62 (MW)0.04968PG113 (MW)86.1052VG59 (p.u.)0.94707VG111 (p.u.)1.05221
PG4 (MW)0.351443PG65 (MW)343.880PG116 (MW)4.20199VG61 (p.u.)1.02331VG112 (p.u.)1.04184
PG6 (MW)1.344034PG66 (MW)340.152VG1 (p.u.)0.94VG62 (p.u.)0.95129VG113 (p.u.)1.02649
PG8 (MW)10.24637PG69 (MW)415.633VG4 (p.u.)1.00609VG65 (p.u.)0.94352VG116 (p.u.)0.96645
PG10 (MW)376.1126PG70 (MW)4.69474VG6 (p.u.)1.00546VG66 (p.u.)1.01735T8 (8–5)0.91057
PG12 (MW)76.80127PG72 (MW)7.50899VG8 (p.u.)0.94545VG69 (p.u.)1.03288T32 (25–26)1.09451
PG15 (MW)1.528393PG73 (MW)10.3911VG10 (p.u.)0.94035VG70 (p.u.)0.97696T36 (17–30)1.09266
PG18 (MW)46.72157PG74 (MW)5.8267VG12 (p.u.)0.99321VG72 (p.u.)1.03499T51 (37–38)0.9
PG19 (MW)0.067021PG76 (MW)20.4488VG15 (p.u.)1.01157VG73 (p.u.)0.98931T93 (59–63)1.00128
PG24 (MW)2.611653PG77 (MW)5.51401VG18 (p.u.)0.96454VG74 (p.u.)0.99958T95 (61–64)1.03762
PG25 (MW)196.2022PG80 (MW)451.524VG19 (p.u.)1.04577VG76 (p.u.)0.99539T102 (65–66)0.95931
PG26 (MW)280.9463PG85 (MW)0VG24 (p.u.)0.99640VG77 (p.u.)0.97826T107 (68–69)0.95758
PG27 (MW)98.34095PG87 (MW)0.95058VG25 (p.u.)0.97686VG80 (p.u.)1.01302T127 (80–81)1.05250
PG31 (MW)0.751755PG89 (MW)483.822VG26 (p.u.)0.94265VG85 (p.u.)0.97493QC34 (MVAR)3.111
PG32 (MW)18.9298PG90 (MW)2.75380VG27 (p.u.)1.01799VG87 (p.u.)0.94034QC44 (MVAR)29.931
PG34 (MW)0.070676PG91 (MW)0VG31 (p.u.)1.03403VG89 (p.u.)1.03117QC45 (MVAR)29.497
PG36 (MW)4.986125PG92 (MW)1.17943VG32 (p.u.)0.99471VG90 (p.u.)1.02089QC46 (MVAR)28.169
PG40 (MW)1.913409PG99 (MW)16.5592VG34 (p.u.)1.00824VG91 (p.u.)1.04970QC48 (MVAR)0
PG42 (MW)1.394682PG100 (MW)200.116VG36 (p.u.)0.99818VG92 (p.u.)1.01643QC74 (MVAR)24.96
PG46 (MW)13.76368PG103 (MW)23.1161VG40 (p.u.)0.99148VG99 (p.u.)1.02329QC79 (MVAR)28.765
PG49 (MW)209.701PG104 (MW)99.6802VG42 (p.u.)1.02358VG100 (p.u.)0.99312QC82 (MVAR)27.479
PG54 (MW)48.30631PG105 (MW)0.13269VG46 (p.u.)0.98153VG103 (p.u.)1.05004QC83 (MVAR)24.519
PG55 (MW)26.09714PG107 (MW)0.19020VG49 (p.u.)1.00041VG104 (p.u.)1.05559QC105 (MVAR)27.063
PG56 (MW)80.54259PG110 (MW)0.42630VG54 (p.u.)0.99326VG105 (p.u.)0.96614QC107 (MVAR)6.934
PG59 (MW)128.7814PG111 (MW)33.7688VG55 (p.u.)1.05871VG107 (p.u.)0.94274QC110 (MVAR)29.781
PG61 (MW)146.4049PG112 (MW)5.1539VG56 (p.u.)1.05977VG110 (p.u.)1.00997
Fuel cost ($/h) 131457.8
Power loss (MW) 96.68278
Voltage deviation (p.u.) 0.730363
Table 10. Results of the proposed MRao-2 algorithm and other algorithms for case 4.
Table 10. Results of the proposed MRao-2 algorithm and other algorithms for case 4.
AlgorithmASOTFWOMPARao-1Rao-2Rao-3MRao-2
Fuel cost ($/h)133,610.8132,132.2131,942.6131,817.9131,490.7131,793.1131,457.8
Power loss (MW)61.8333265.5547671.9440293.8593195.4661793.9522296.68278
Voltage deviation (p.u.)0.6587790.9610261.1525931.3282970.9989011.1922740.730363
Time (s)800.709809.0281022.262807.969804.5724806.711491160.264
Table 11. Optimal settings of control variables for case 5 using the proposed MRao-2.
Table 11. Optimal settings of control variables for case 5 using the proposed MRao-2.
VariablesValueVariablesValueVariablesValueVariablesValueVariablesValue
PG1 (MW)3.0911PG62 (MW)6.37571PG113 (MW)7.09147VG59 (p.u.)1.036427VG111 (p.u.)1.03604
PG4 (MW)7.265278PG65 (MW)298.824PG116 (MW)0VG61 (p.u.)0.956257VG112 (p.u.)0.97545
PG6 (MW)79.79656PG66 (MW)284.31VG1 (p.u.)1.01134VG62 (p.u.)1.054308VG113 (p.u.)1.04051
PG8 (MW)0.20039PG69 (MW)400.029VG4 (p.u.)1.03191VG65 (p.u.)0.974536VG116 (p.u.)0.97347
PG10 (MW)332.3392PG70 (MW)7.71916VG6 (p.u.)1.02025VG66 (p.u.)1.00127T8 (8–5)1.09856
PG12 (MW)73.21883PG72 (MW)0.27496VG8 (p.u.)0.94257VG69 (p.u.)1.020322T32 (25–26)0.90257
PG15 (MW)6.500848PG73 (MW)6.45688VG10 (p.u.)0.94115VG70 (p.u.)0.979919T36 (17–30)0.9
PG18 (MW)5.979357PG74 (MW)5.52285VG12 (p.u.)0.97438VG72 (p.u.)1.030921T51 (37–38)0.90084
PG19 (MW)1.346065PG76 (MW)2.53255VG15 (p.u.)1.05303VG73 (p.u.)1.005468T93 (59–63)1.09369
PG24 (MW)1.582226PG77 (MW)0.22016VG18 (p.u.)1.04361VG74 (p.u.)1.020992T95 (61–64)0.96853
PG25 (MW)159.4184PG80 (MW)363.967VG19 (p.u.)0.98928VG76 (p.u.)1.019236T102 (65–66)0.93325
PG26 (MW)215.2208PG85 (MW)0.07633VG24 (p.u.)0.96523VG77 (p.u.)1.034034T107 (68–69)0.91076
PG27 (MW)0.110372PG87 (MW)4.60698VG25 (p.u.)1.04943VG80 (p.u.)1.036756T127 (80–81)0.9
PG31 (MW)1.978596PG89 (MW)434.560VG26 (p.u.)1.00787VG85 (p.u.)1.049239QC34 (MVAR)0.20760
PG32 (MW)2.320654PG90 (MW)0.12767VG27 (p.u.)0.97993VG87 (p.u.)1.059658QC44 (MVAR)0.00941
PG34 (MW)0.120587PG91 (MW)17.5246VG31 (p.u.)0.98609VG89 (p.u.)1.010104QC45 (MVAR)0.26098
PG36 (MW)5.158081PG92 (MW)1.45348VG32 (p.u.)0.94097VG90 (p.u.)0.963199QC46 (MVAR)0.07600
PG40 (MW)32.66632PG99 (MW)4.11549VG34 (p.u.)0.94553VG91 (p.u.)1.042132QC48 (MVAR)0.24244
PG42 (MW)3.238611PG100 (MW)206.177VG36 (p.u.)1.00105VG92 (p.u.)1.040622QC74 (MVAR)0.2194
PG46 (MW)4.574268PG103 (MW)35.1167VG40 (p.u.)0.97223VG99 (p.u.)0.943471QC79 (MVAR)5.6 × 10−5
PG49 (MW)161.9397PG104 (MW)1.01542VG42 (p.u.)0.97289VG100 (p.u.)0.951227QC82 (MVAR)0.00622
PG54 (MW)28.01801PG105 (MW)15.1016VG46 (p.u.)0.98664VG103 (p.u.)1.004165QC83 (MVAR)0.27248
PG55 (MW)0.389909PG107 (MW)0VG49 (p.u.)1.00712VG104 (p.u.)0.987921QC105 (MVAR)0.03938
PG56 (MW)12.21136PG110 (MW)18.5235VG54 (p.u.)1.04523VG105 (p.u.)0.943759QC107 (MVAR)0.27336
PG59 (MW)108.0116PG111 (MW)35.5095VG55 (p.u.)1.05831VG107 (p.u.)0.960449QC110 (MVAR)0.23428
PG61 (MW)122.726PG112 (MW)2.19141VG56 (p.u.)0.96064VG110 (p.u.)1.00083
Fuel cost ($/h)100738.5
Power loss (MW)88.04623
Voltage deviation (p.u.)0.778536
Table 12. Results of the proposed MRao-2 algorithm and other algorithms for case 5.
Table 12. Results of the proposed MRao-2 algorithm and other algorithms for case 5.
AlgorithmASOTFWOMPARao-1Rao-2Rao-3MRao-2
Fuel cost ($/h)103,847.47101,747.68101,981.69101,981.17101,078.92101,297.12100,738.54
Power loss (MW)58.333385.06247571.16897489.99265190.29604691.00649788.04623
Voltage deviation (p.u.)0.6645742043877010.77129161.12270761.15951860.99230190.778536
Time (s)792.735802.827321013.509800.827803.4047798.44261136.06
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Hassan, M.H.; Kamel, S.; Selim, A.; Khurshaid, T.; Domínguez-García, J.L. A Modified Rao-2 Algorithm for Optimal Power Flow Incorporating Renewable Energy Sources. Mathematics 2021, 9, 1532. https://doi.org/10.3390/math9131532

AMA Style

Hassan MH, Kamel S, Selim A, Khurshaid T, Domínguez-García JL. A Modified Rao-2 Algorithm for Optimal Power Flow Incorporating Renewable Energy Sources. Mathematics. 2021; 9(13):1532. https://doi.org/10.3390/math9131532

Chicago/Turabian Style

Hassan, Mohamed H., Salah Kamel, Ali Selim, Tahir Khurshaid, and José Luis Domínguez-García. 2021. "A Modified Rao-2 Algorithm for Optimal Power Flow Incorporating Renewable Energy Sources" Mathematics 9, no. 13: 1532. https://doi.org/10.3390/math9131532

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop