Next Article in Journal
Recent Development of Smart Field Deployment for Mature Waterflood Reservoirs
Next Article in Special Issue
Innovative Hybrid Condensing Radiant System for Industrial Heating: An Energy and Economic Analysis
Previous Article in Journal
Barriers, Challenges, and Requirements for ICT Usage among Sub-Assistant Agricultural Officers in Bangladesh: Toward Sustainability in Agriculture
Previous Article in Special Issue
Weather Impact on Solar Farm Performance: A Comparative Analysis of Machine Learning Techniques
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Monte Carlo Simulation and a Clustering Technique for Solving the Probabilistic Optimal Power Flow Problem for Hybrid Renewable Energy Systems

1
Electrical Power and Machines Department, Faculty of Engineering, Ain Shams University, Cairo 11517, Egypt
2
The Key Laboratory of Smart Grid of Ministry of Education, Tianjin University, Tianjin 300072, China
3
Electrical Engineering Department, College of Engineering, King Saud University, Riyadh 11421, Saudi Arabia
4
Department of Electrical Engineering, University of Jaén, 23700 Linares, Spain
5
Electrical Engineering Department, Faculty of Engineering and Technology, Future University in Egypt, Cairo 11835, Egypt
*
Author to whom correspondence should be addressed.
Sustainability 2023, 15(1), 783; https://doi.org/10.3390/su15010783
Submission received: 14 November 2022 / Revised: 24 December 2022 / Accepted: 27 December 2022 / Published: 1 January 2023

Abstract

:
This paper proposes a new, metaheuristic optimization technique, Artificial Gorilla Troops Optimization (GTO), for a hybrid power system with photovoltaic (PV) and wind energy (WE) sources, solving the probabilistic optimum power flow (POPF) issue. First, the selected algorithm is developed and evaluated such that it applies to solve the classical optimum power flow (OPF) approach with the total fuel cost as the objective function. Second, the proposed algorithm is used for solving the POPF, including the PV and WE sources, considering the uncertainty of these renewable energy sources (RESs). The performance of the suggested algorithm was confirmed using the standard test systems IEEE 30-bus and 118-bus. Different scenarios involving different sets of the PV and WE sources and fixed and variable loads were considered in this study. The comparison of the obtained results from the suggested algorithm with other algorithms mentioned in this literature has confirmed the efficiency and performance of the proposed algorithm for providing optimal solutions for a hybrid power system. Furthermore, the results showed that the penetration of the PV and WE sources in the system significantly reduces the total cost of the system.

1. Introduction

The OPF is still a significant subject in the community of power-system researchers since it began almost half a century ago. The OPF is considered a nonlinear, multi-dimensional, and large-scale problem in the operation of power systems. The primary purpose of the OPF is to optimize a particular objective function by meeting a group of operational and physical restrictions mandated by equipment and power system restrictions. The objective function can be divided into single- and multi-objective functions. Examples of objective functions include the fuel costs for generators, their emission rates, the electricity grid’s losses, and the security index of the voltage. Equality and inequality constraints involve power-balance equations and limitations on all state and control variables. The control variables involve the active power of the generator, the bus voltage of the generator, the transformer tap ratios, and the VAR (volt–ampere reactive) compensators, whereas the state variables include the reactive power outputs from the generators, the bus load voltages, and the network line flow. Consequently, the electric utilities use the OPF issue as an essential tool to describe secure and economically advantageous operational conditions for power systems.
The earliest OPF problem was solved using traditional mathematical programming techniques, successfully proving their viability [1]. Conventional methods of optimization are used for solving the OPF problem, such as the method of Newton [1], the method of gradient projection [2], the method of linear programming [3], and the method of interior point [4]. The conventional optimization methods are accompanied by many difficulties reported in [5]. Due to the continuously developing optimization issues, several techniques have been established to solve the OPF; artificial intelligence techniques and meta-heuristic, search-based optimization methods have been developed for solving the OPF issue. Search-based optimization methods have been recently used for solving the OPF problem, such as the particle swarm optimizing algorithm (PSO) [6,7], genetic algorithms method (GA) [8], enhanced genetic algorithms method [9], differential evolution algorithm method [10,11], gravitational searching algorithm method (GSA) [12,13], improving colliding bodies algorithm [14], multi-phase searching optimization algorithm [15,16], improved PSO [17], fuzzy-based hybrid PSO approach [18], biogeography-based optimizing algorithm [19], black-hole optimization algorithm [20], harmony search optimization algorithm [21], imperialist competitive optimization algorithm [22], grey wolf optimization [23], PSO hybrid with GSA algorithm [24], and the bee colony optimization algorithm [25]. Several multi-objective functions for the OPF problem were introduced in [11,17,18,23].
Currently, there is an increase on the grid in the use of RESs such as solar and wind energy [26,27]. Although RESs have benefits such as lowering pollution and saving resources, the consequent rise in load uncertainty and associated uncertainty in power production have created new difficulties in the operation and distribution of power networks. To successfully integrate those sources into the grid and provide a secure and lucrative power market, it is critical to manage them properly [26,28]. Therefore, their stochastic nature must be considered while integrating these sporadic RESs into the grid. Solving the OPF problem has been significantly difficult because of the uncertainties of the added RESs to the system. Furthermore, solving the OPF is computationally intensive and impractical because it necessitates running numerous simulations to consider most of the possible operating conditions. Both traditional and intelligence-based techniques (deterministic techniques) for solving the OPF issue have been mentioned in the previous paragraph. Still, the probabilistic techniques must be considered to address the uncertainty of the RESs.
Probabilistic techniques can offer improved solutions and appropriate accuracy when considering uncertainties [29,30]. Therefore, it is preferred that the POPF problem is solved using a probabilistic approach rather than the deterministic point of view, as thoroughly reviewed by Ramadhani et al. in [31] and Prusty and Jena in [32,33]. In power systems with numerous PV and wind units, many probabilistic techniques are used in solving the OPF issue. To obtain the PDF of the PV system’s output power, the two-point estimate method (2PEM), dependent on the moments’ technique, was introduced in [34]. However, the moments’ method sometimes produces estimates which do not fall within the parameter space, resulting in the solution becoming unreliable. The Cornish–Fisher expansion was presented in [35] to handle the uncertainties of the PV sources Still, this method does not produce accurate estimations when handling problems that contain non-continuous return functions and complex structures [36]. A POPF problem with wind power inserted into the system was presented in [37], and the heuristic approach was used to calculate the PDF of the wind speed. However, real data must be available to calculate the PDF accurately. The kernel-density estimation technique estimated the wind speed probability distribution [38]. However, this approach is impractical since the density estimate depends on where the bins are when they are initially placed. The number of bins increases exponentially as the number of dimensions increases. According to the Latin hypercube random sampling technique, the mean–variance skewness methodology for stochastic and nonconvex OPF incorporating wind energy was developed in [39]. However, this approach is hampered by the sample points’ statistical dependencies, and it does not appear to be noticeably better than other random sample methods for sensitive analysis. To obtain the PDF of the power produced from a wind energy system, the Monte Carlo Simulation (MCS) and its variations were taken into consideration in [40,41]. The MCS technique was used to develop an OPF issue for a power system with PV and WE units [42].
This study formulates and solves the POPF issue with a hybrid power system that contains wind and solar energy sources. These are the primary contributions made in this paper:
  • Implement and solve the POPF approach while allowing RESs to become more integrated into the electricity grid using Artificial Gorilla Troops Optimization (GTO).
  • Obtain actual historical data for the summers of four years (2018, 2019, 2020, and 2021). The whole data are used to mimic a more accurate 24-h summer day and provide curve-fitting for each hour of data for PV and wind using the Beta and Weibull PDFs, respectively.
  • Combine the MCS with the K-means clustering method to reduce the significant computational time.
  • Apply the Elbow method to the K-means clustering method to find the optimal initial number of clusters and reduce the computational time.
  • Solve the POPF for a variable load of a weekend day in summer using the GTO.
The following portions of this paper are arranged: Section 2 presents the problem formulation, the POPF, and its restrictions and penalty terms. Section 3 introduces the mathematical models of the RESs. The Monte Carlo Simulation method combined with the K-means clustering method and the Elbow method is introduced in Section 4. Section 5 offers the Artificial Gorilla Troops optimization algorithm. The simulation results from the suggested optimization technique applied to the standard IEEE 30- and 118-bus systems are shown in Section 6, along with a comparison study on several optimization techniques reported in this paper. Finally, Section 7 concludes the whole study.

2. Problem Formulation

In this study, the proposed GTO method is applied to solve the classical OPF problem with its objective function implemented to reduce the generation cost. To solve the POPF, the algorithm’s structure is modified to include the uncertainty and stochastic nature of RESs and the variable load profiles. The following equations provide a formulation for the OPF problem:
Minimize :   f ( q , w ) = f 1 ( q , w ) , f 2 ( q , w ) , ..... , f N o b j
Subject   to :   g   ( q , w ) = 0
h ( q , w )     0
where q is the state variable, w denotes the control variable, f ( q , w ) denotes the objective function, h ( q , w ) denotes the inequality constraints and g ( q , w ) denotes the equality constraints.

2.1. Objective Function

The OPF issue in this study is to reduce the total fuel cost of conventional generators. An equation formulates the cost function in the quadratic form of the real power generated. The cost function can be mathematically formulated in Equations (4) and (5).
Minimize   F = h = 1 24 j = 1 N G C j , h ( P G j , h )
C j , h ( P G j , h ) = a j   P G j , h 2 + b j P G i , h + c i
where F represents the objective function, P G j , h denotes the power generated at bus ‘j’ at hour ‘h’, and N G represents the total number of conventional generators. The objective function is recomputed for each hour to obtain the optimal generation cost hourly.

2.2. Equality Constraints

The power-balance equation imposes equality constraints by requiring that active and reactive power generated must match the load demand and power losses. The equality constraints consist of a group of nonlinear power-flow equations that can be formulated in Equations (6) and (7).
P G i P D i = V i j = 1 N B V j [ G i j c o s ( δ i j ) + B i j s i n ( δ i j ) ]     i NB
Q G i Q D i = V i j = 1 N B V j [ G i j s i n ( δ i j ) B i j   o s ( δ i j ) ]     i NB
where P G i and Q G i represent the generation’s active and reactive power of the bus i , respectively. P D i and Q D i represent the load demand’s active and reactive power, respectively. NB denotes the total number of buses, G i j denotes the transfer conductance between i and j buses, and   B i j denotes the susceptance between i and j buses. The =   δ i     δ j . Finally, V i and V j are the voltages of bus i and bus j , respectively.

2.3. Inequality Constraints

The inequality constraints are imposed by the operating restrictions on the power system’s equipment and the security limitations on the lines and load buses.
  • Generator constraints:
P T G i m i n P T G i P T G i m a x ,           i = 1 , , NG
Q T G i m i n Q T G i Q T G i m a x ,           i = 1 , , NG
V G i m i n V G i V G i m a x ,           i = 1 , , NG
  • Security constraints:
V L p m i n V L p V L p m a x ,             p =   1 , , NPQ
S l q S l q m a x ,                                       q = 1 , ,   NTL
Equation (8) represents the thermal generator’s active power boundaries. Equation (9) represents the thermal generator’s reactive power capabilities. NG denotes the total number of thermal generators. Equation (10) represents the limits of voltage on generator buses (PV buses), while Equation (11) represents the limits of voltage on load buses (PQ buses). Equation (12) represents the capacity of the transmission line. NTL and NPQ denotes the number of lines and load buses in the network, respectively.
It is noteworthy that the active and reactive power equations’ equality constraints are automatically met when the power-flow problem is converted into a solution. The inequality constraints, such as the active power and the bus voltage of the generator (except for slack, which is regarded as linked to bus 1), are the control variables. The optimization algorithm selects possible values for such control variables, which are bounded by their limits. The other inequality constraints, such as the power of the slack generator, voltage limits of the load bus, reactive power output from the remaining generators, and the capacity of the transmission lines, require special considerations such that their values must not exceed the limits. Therefore, the objective function incorporates these inequality constraints as quadratic penalty factors. Accordingly, the new objective function is given in Equation (13) [43].
F = [ F C + λ P ( P TG 1 P TG 1 l i m ) 2 + λ V i = 1 NPQ ( V Li V Li l i m ) 2 + λ Q i = 1 NG ( Q TG i Q TG i l i m ) 2 + λ S i = 1 NTL ( S li S li l i m ) 2 ] n × 1
where λ P , λ V , λ Q , and   λ S represent penalty factors. The chosen values for all penalty factors are λ P = 100 , 000 , 000 , λ V = λ Q = 50 , 000 ,   a n d   λ S = 1000 .

3. Mathematical Modeling of the RES

The primary generation elements in the power system are wind, solar, and thermal generators. Therefore, solar and wind power are considered in solving the POPF problem [44]. However, due to the uncertain nature of the RESs (as mentioned earlier), the generation power from the RESs incorporates high uncertainties [45,46]. Consequently, it is crucial to precisely simulate the PV and WT generators in the manners described below.

3.1. Modeling the WE Power Generation

The wind speed variations are described using the Weibull PDF [36,47]. The probability of wind speed v (m/s) may be expressed as follows using Weibull PDF:
f ( v ) = ( k c ) ( v c ) ( k 1 ) exp [ ( v c ) k ] ,                               v 0
where c and k denote the Weibull distribution’s scale and shape factors, respectively. By using the stochastic variable wind speed, the power output from wind generators is determined as follows:
P w ( v ) = 0 v < v i n   Or   v v o u t P w r v     v i n v r     v i n v i n v < v r P w r v i n v < v r
where v , and v r represent current and rated wind speed, respectively, P wr represents rated output power, and v i n and v o u t represent cut-in and cut-out speed, respectively. The data obtained for wind speed was at the height of 33 ft (10 m). However, according to the Enercon E82-E4 product datasheet, a 3-MW wind turbine’s hub height is generally 84 m, so to obtain wind speed at that height, the method of Weibull wind speed distribution extrapolation is applied, which can be formulated as follows [48]:
C 2 = C 1 ( h 2 h 1 ) n
k 2 = k 1 1 0.0881 ln ( h 1 h r ) 1 0.0881 ln ( h 2 h r )
where h r is a 10 m reference height and n is a power. The following formula may be used to find the power n :
n = 0.37 0.0881 ln ( C 1 ) 1 0.0881 ln ( h 1 h r )
Figure 1 shows the Weibull PDF for the wind speed data over the equivalent 24-h day in summer. Table 1 shows the parameter of the Weibull PDF for the equivalent 24-h summer day of the real-time historical date such that the Weibull parameters are scale parameters (C) and shape parameters (K).

3.2. Modeling the PV Power Generation

Solar irradiance is very uncertain as it changes depending on several variables such as the time of day, month, season, weather, and the direction in which the solar generator faces the sun. According to the Beta PDF [36,49], the probability distribution for solar irradiation is as follows:
f ( R ) = Γ ( α + β ) Γ ( α ) Γ ( β ) R a 1 ( 1 R ) β
where f ( R ) is the Beta PDF of solar radiation. The incomplete gamma function is represented by Γ ( . ) . R represents the solar radiation [W/m2]. By using the stochastic variable solar irradiance, the output power of solar generators is determined as follows:
P p v ( R ) = { P p v , r ( R 2 R C R S T D )                           0 R R C P p v , r ( R R S T D )                                 R C R R S T D P p v , r                                                 R S T D R
where R C represents a certain radiation point and R S T D represents solar radiation within standard conditions. Figure 2 shows the Beta PDF for the solar irradiance data over the equivalent 24-h day in summer. Table 2 shows the parameter of the Beta PDF for the equivalent 24-h summer day of the real-time historical date such that the Beta parameters are shape parameter 1 (α) and shape parameter 2 (β).
In this paper, the wind turbine parameters were vin = 3 m/s, v o u t = 25 m s , and v r = 16   m / s . The rated power output for each turbine was P w r 3 MW; this value is presented in the Enercon E82-E4 product datasheet. For the PV generator, R C was set to be 120 W/ m 2 and the R S T D was set to be 1000 W/ m 2 . Real-time historical data was used for solar irradiance and wind speed. These data weres for the summer seasons of four years (2018, 2019, 2020, and 2021). The real-time historical data is presented in [50]. Whole data were used to mimic a more accurate 24-h summer day such that the curve fitting, either by Weibull or Beta PDF, was performed for each hour of that day.

4. Monte Carlo Simulation Combined with K-Means Clustering and Elbow Method

As was mentioned in the previous sections, the summer data for the last four years was represented by an equivalent 24-h day, and curve fitting was applied for each hour. For each hour there was a vast number of operating conditions that needed to be taken into consideration. Therefore, MCS was run for 8000 scenarios for each hour of these data and were used in the analysis. The MCS was then combined with K-means clustering and the Elbow method, as is presented in the following subsections.

4.1. Monte Carlo Simulation

To integrate the PV and WE sources into the power system, the power system must deal with all possible scenarios due to the uncertain nature of renewable energy. Accordingly, it is essential to use a stochastic technique instead of the deterministic one. A Monte Carlo Simulation (MCS) was used in this research study. It is also known as multiple probability simulation for the stochastic technique. MCS is a probabilistic simulation technique to estimate the possible outcomes for uncertain situations. It can also be used to obtain stochastic outcomes from random variables [51]. The MCS was chosen because it is the most suitable technique for large, complex systems with a high number of uncertainties [36]. After making curve fitting for each hour of the data over the equivalent summer day, the MCS was run with 8000 scenarios for each hour. Consequently, there were a lot of scenarios overall, and many iterations were required, so a clustering technique was used in this paper to reduce the substantial computational time. Figure 3 and Figure 4 show two examples of wind speed distribution and solar irradiance after running the MCS for 8000 scenarios for hour 10 with their scale and shape parameters.

4.2. K-Means Clustering

The MCS was combined with the K-means clustering method to reduce the overall number of scenarios and iterations [52]. K-means clustering is a partitioning clustering method in which the data points are sectionized into different sets (clusters), mentioned by the number K, in which each cluster depends on how similar the data points are [53] and is considered as an iterative algorithm within the initial number of clusters K, which must be manually determined by the user [54]. K-means clustering is performed in two steps:
  • Determine the best centroids or center points—K values—using an iterative process.
  • Set each data point to the closest K-center.
Figure 5 and Figure 6 show an example of the data for wind speed and solar irradiance at hour 19, the initial centroid points, the final locations of the centroids after 100 iterations, and each set of data belongs to each centroid, as during iteration the centroids’ location is changed to reach the best location. The trial-and-error method is used to determine the best number of iterations such that after 100 iterations the location of the centroids is not changed anymore.

4.3. Elbow Method

The main weakness of the K-Means Clustering method is that it randomly assumes the number of clusters. Therefore, a cluster optimization technique is required to obtain the optimal number of clusters. [54]. The Elbow method determines the best number of clusters such that K-means clustering is run for the data set with assumed clusters. The sum of square error (SSE) is calculated for each assumed number of clusters, and the most significant difference from the angle of the elbow (knee point) shows the best number of clusters [55]. Initially, it is assumed that there are between one to ten clusters, and then, for each number of clusters Elbow method is applied, an SSE is calculated. The calculations showed that the angle of the elbow (the most significant difference) is formed when three clusters are used. Accordingly, the optimal number of clusters is K = 3. From both Figure 7 and Figure 8, it is clear that the optimum number of clusters is three.

5. Proposed Method

The GTO technique was selected to solve the POPF problem for different scenarios. The GTO is a nature-inspired metaheuristics algorithm inspired by the gorilla troop’s social intelligence in nature [56]. Figure 9 presents the GTO flowchart for easier comprehension, and each step’s formulation algorithm is fully described in detail. The following mechanisms are a description of the many processes that the GTO algorithm employs for optimization tasks.

5.1. Exploration Phase

The exploration phase involves three primary mechanisms, which are: moving to other gorillas where this mechanism is selected when rand 0.5 , migrating to an unknown location where this mechanism is selected when rand   p , and migrating in the direction of a known location where this mechanism is selected when rand < 0.5 . Each of these three techniques is chosen based on a standard process. Where p is a parameter used to select the mechanism of migrating to an unknown location, each of these mechanisms presents a great ability of the GTO technique. The following equations simulate the three mechanisms utilized in the exploration stage [56].
G X ( t + 1 ) = { ( U B L B ) × r 1 + L B , rand < p ( r 2 C ) × X r ( t ) + L × H , rand 0.5 X ( i ) L × ( L × ( X ( t ) G X r ( t ) ) + r 3 × ( X ( t ) G X r ( t ) ) ) , rand < 0.5
C = F × ( 1 I t M a x I t )
F = cos ( 2 × r 4 ) + 1
L = C × l .
H = Z × X ( t )
Z = [ C , C ]

5.2. Exploitation Phase

The exploitation phase includes two behaviors: following the silverback and competing with adult females. It is possible to choose between them using the value of C calculated in Equation (22). Following the silverback method is chosen if C  W. This behavior can be modeled as follows:
G X ( t + 1 ) = L × M × ( X ( t ) X silverback ) + X ( t )
M = ( | 1 N i = 1 N G X i ( t ) | g ) 1 g
g = 2 L
However, if C  < W, the competition with adult females is selected. After some time, when adolescent gorillas reach puberty, they eventually engage in violent competition with other male gorillas in their group for the attention of adult females. This behavior is simulated as follows:
G X ( i ) = X silverback   ( X silverback × Q X ( t ) × Q ) × A
Q = 2 × r 5 1
A = β × E ,
E = { N 1 ,   rand   0.5 N 2 ,   rand   < 0.5
At the end of the exploitation phase, the cost of each GX solution is assessed, and if the cost of GX (t) is less than the cost of X (t), the GX (t) solution is adopted as the X (t) solution. The silverback is considered the best solution found throughout the whole population.

6. Simulation Results and Discussion

This paper proposed a solution for the OPF and POPF issues by applying the GTO algorithm. To verify the viability and performance of the suggested GTO-based OPF and POPF problem, the IEEE 30-bus and 118-bus systems were applied. Table 3 lists the details of these two power systems [36]. The effectiveness of the suggested algorithm is compared with GA (Genetic Algorithm) [57], PSO (Particle Swarm Optimization) [58], SFO (Sunflower Optimization) [59], HHO (Novel Harris Hawk Optimization) [60], and HFPSO (Hybrid Firefly Particle Swarm Optimization) [61] for a classical OPF. Algorithms used as competitors were the HHO and SFO for the POPF, including renewable energy. The control parameter of the OPF issue wasre the active power output from the thermal generators. The iteration number was selected to achieve good performance for the suggested GTO technique.
The selection of the controlling parameter of the GTO method was such as any metaheuristic optimization technique. The trial-and-error method was used to choose these parameters with many independent trials and finally to check the algorithm’s performance. Many various cases have been shown to demonstrate the efficacy of the proposed algorithm. All scenarios were ran for fixed and variable loads. The fixed load is the standard load for the standard test systems mentioned in this paper. The variable load is the load of an available summer weekday and is presented in [62]. Figure 10 and Figure 11 show an example of the variable load curve over a summer day at bus 15 for the IEEE 30-bus and IEEE 118 systems, respectively. To prove the efficacy of the proposed approach for OPF and POPF problems, three different scenarios were considered, as are shown in Table 4. The performance and efficacy of the proposed GTO algorithm have been confirmed by comparison with the other chosen approaches.

6.1. The IEEE 30-Bus System

The small-scale power system was used to verify the proposed algorithm’s performance. The classical OPF problem with no RESs and the POPF with PV & wind generators at the optimal bus locations were solved. The results were compared to those from other algorithms reported in this paper to confirm their viability. Finally, the proposed algorithm was used to investigate how adding PV and wind generators would affect the system’s overall operating costs.

6.1.1. Case 1: Classical OPF

In this case, the proposed technique was used for solving the classical OPF with the fixed load. Its results were then compared to the GA, PSO, SFO, HHO, and HFPSO to verify the performance of the suggested technique. The objective function was to reduce the thermal generator’s cost function with no renewable energy added to the system. For all algorithms, the sizes of the population were set at 30. The number of iterations for all algorithms was set at 2000. The optimized control variables and the objective function calculated by GTO are compared to the results from other algorithms in Table 5. Figure 12 shows a comparison of the conversion curve of the objective function for the different algorithms. It is clear from Figure 12 that the GTO outperforms the other techniques in finding the minimum cost with fewer iterations.

6.1.2. Case 2: POPF with RESs

In this case, the PV and wind generators were inserted into the optimal bus locations [64], as is shown in Table 6. The rating of the added PV and wind generators were 20 MW and 30 MW, respectively, and were selected such that the total capacity of the RESs represented 17.6% of the total load of the IEEE 30-bus systems. The sizes of the population for all algorithms were set as 15. The number of iterations for all algorithms was set at 200. The proposed technique was used for solving the POPF for fixed and variable loads. The suggested approach’s results were then compared to the other chosen algorithms such as the PSO and HHO. The time-varying load is shown in Figure 10 for the standard 30-bus system. Due to changes in irradiance and wind speed, the active power production from the wind and PV generators varied. Therefore, the RESs’ uncertainty was considered when forecasting the RESs’ output power. Figure 13 and Figure 14 show the convergence of the objective function for the proposed GTO algorithm against the HHO and PSO techniques under fixed and variable loading, respectively. The results indicated that the fuel cost calculated by the GTO is relatively less than the other two algorithms for fixed and variable loads. The results from the proposed approach are significantly superior to results from the other algorithms for fixed load, but for a variable load the results are very similar.

6.1.3. Case 3: Effects of Adding the RES on the Total Cost

After confirming that the suggested algorithm successfully founds the optimal results for either the classical OPF or the POPF, the effect of adding the RESs on the system’s total operating cost was considered. The proposed algorithm was used for solving the POPF problem considering the uncertainties of the RESs for fixed and time-varying loads. The ratings of the PV, rating of the wind generators, population size, and the number of iterations were kept the same as in the previous case study. Figure 15 and Figure 16 show the effect of adding the RESs to the optimal bus locations on the system’s total operating cost. For the fixed and variable loads, adding the PV generators to the system reduced the total cost from hour 7 to hour 20 (as the solar irradiance existed only during this period), while adding the wind generators reduced the total cost throughout the day. Extreme cost reduction occurred when adding both PV and wind generators simultaneously. Table 7 and Table 8 summarize the cost reduction percentage from adding PV and wind generators for each hour during the equivalent summer day with fixed and time variable loads, respectively.

6.2. The IEEE 118-Bus System

The proposed algorithm’s performance was evaluated using the large-scale power system. The classical OPF with no RESs and the POPF with PV and wind generators at the optimal bus locations were solved. The results of the suggested approach were compared with those of the other selected algorithms to confirm its viability. Then, the proposed algorithm was used to study the effect of inserting the PV and wind generators on the system’s total operating cost.

6.2.1. Case 4: Classical OPF

The proposed approach was used for solving the classical OPF with the fixed load and then comparing its results with the GA, PSO, SFO, HHO, and HFPSO methods to verify the effectiveness of the suggested technique. The objective function was to reduce the thermal generator’s cost function with no renewable energy added to the system. The sizes of the population for all algorithms were set at 30. The number of iterations in all algorithms was set as 2000. The best results of the control variables and the objective function calculated by GTO are compared to the results from other algorithms in Table 9. Figure 17 compares the conversion curve of the objective function for the different algorithms. Comparing other algorithms verified that the GTO algorithm is capable of finding a more advantageous solution.

6.2.2. Case 5: POPF with RESs

In this case, the PV and wind generators were inserted into the optimal bus locations [64], as is shown in Table 6. The rating of the added PV and wind generators were 250 MW and 500 MW, respectively. The total capacity of the RESs represents 17.6% of the total system load, such that the percentage of penetration of the RESs was kept the same for the standard 30-bus and 118-bus systems. The sizes of the population for all algorithms were set at 30. The number of iterations for all algorithms was set at 400. The proposed approach was used to solve the POPF, including the RESs, to minimize the fuel cost for fixed and variable loads and to compare the suggested approach with the other chosen algorithms, such as PSO and HHO. The time-varying load is shown in Figure 11 for the standard 118-bus system. Figure 18 and Figure 19 show the convergence curves of the objective function under fixed and variable loading, respectively. The results indicated that the fuel cost calculated by the GTO was less than the other two algorithms for fixed and variable loads, respectively. The results from the proposed approach were significantly superior to results from the other chosen algorithms mentioned in the literature for both fixed and variable loading conditions.

6.2.3. Case 6: Effects of Adding RESs on the Total Cost

After confirming the performance of the suggested approach in finding the optimal solution, whether for classical OPF or POPF in the large-scale system, the effect of adding the RESs on the overall system cost was considered. The proposed approach was used for solving the POPF problem considering the uncertainties of the RESs for fixed and time-varying loads. The ratings of PV generators, wind generators, the size of the population, and the number of iterations were kept the same as in the previous case studies. Figure 20 and Figure 21 show how adding the RESs to the optimal bus locations affects the overall system cost. For the fixed and variable loads, adding the PV generators to the system reduces the total cost from hour 7 to hour 20, as solar irradiance exists only during this period. Adding the wind generators reduces the total cost all over the day, and extreme cost reduction occurs when adding both PV and wind generators simultaneously. Table 10 and Table 11 show the cost reduction percentages from adding PV and wind generators for each hour during the equivalent summer day with fixed and variable time loads, respectively. The percentage reduction can be higher for higher RES penetration levels. These reductions happened when only 17.6% of DGs were inserted.

7. Conclusions

In this study, a classical and a probabilistic OPF issue were developed and solved for a hybrid power system that included PV and WE sources with fixed and variable loads. The proposed algorithm was intended to minimize the operational cost of a complex power system. To deal with the uncertainty of the RESs and solve the POPF problem, curve fitting was used for the historical data, applying the most suitable PDFs representing these data. The MCS was then run with many scenarios in combination with the K-means clustering method that minimized the significant computational time. Finally, the optimal number of clusters was calculated using the Elbow approach.
The classical OPF and the POPF problems were solved using the GTO approach. The proposed method was successfully used with different combinations of wind power generation units and solar power generation units in the IEEE 30-bus and 118-bus systems. The performance and efficacy of the proposed algorithm for producing a set of optimal solutions have been proven by comparing the results acquired by the suggested approach with the other optimization techniques. The results of the POPF problem show that inserting the RESs into the system has a significant reduction in the total generation cost. The percentage reduction can be higher for higher RES penetration levels. These reductions happened as only 17% of DGs were inserted. This is essential for the planning and operating of modern power systems that incorporate many alternate forms of energy. Future work will extend our POPF problem to include the cost of renewable energy.

Author Contributions

M.S.H., A.O.B. and H.M.H.: conceptualization and methodology; H.J., A.A. and M.A.: validation, formal analysis; T.A.: investigation, visualization; R.A.T. and F.J.: review and editing. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by King Saud University, Riyadh, Saudi Arabia.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Acknowledgments

This work was supported by the Researchers Supporting Project number (RSP2023R467), King Saud University, Riyadh, Saudi Arabia.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Sun, D.I.; Ashley, B.; Brewer, B.; Hughes, A.; Tinney, W.F. Optimal Power Flow by Newton Approach. IEEE Trans. Power Appar. Syst. 1984, PAS-103, 2864–2880. [Google Scholar] [CrossRef]
  2. Lee, K.Y.; Park, Y.M.; Ortiz, J.L. A United Approach to Optimal Real and Reactive Power Dispatch. IEEE Trans. Power Appar. Syst. 1985, PAS-104, 1147–1153. [Google Scholar] [CrossRef]
  3. Alsaç, O.; Bright, J.; Prais, M.; Stott, B. Further Developments in Lp-Based Optimal Power Flow. IEEE Trans. Power Syst. 1990, 5, 697–711. [Google Scholar] [CrossRef]
  4. Monoh, J.A.; Ei-Hawary, M.E.; Adapa, R. A Review of Selected Optimal Power Flow Literature to 1993. II. Newton, Linear Programming and Interior Point Methods. IEEE Trans. Power Syst. 1999, 14, 105–111. [Google Scholar] [CrossRef]
  5. Momoh, J.A.; Koessler, R.J.; Bond, M.S.; Stott, B.; Sun, D.; Papalexopoulos, A.; Ristanovic, P. Challenges to Optimal Power Flow. IEEE Trans. Power Syst. 1997, 12, 444–447. [Google Scholar] [CrossRef] [Green Version]
  6. Abido, M.A. Optimal Power Flow Using Particle Swarm Optimization. Int. J. Electr. Power Energy Syst. 2002, 24, 563–571. [Google Scholar] [CrossRef]
  7. Choudhury, D.; Patra, S. Multi Objective Optimal Power Flow Using Particle Swarm Optimization Technique. In Proceedings of the 2016 International Conference on Signal Processing, Communication, Power and Embedded System (SCOPES), Paralakhemundi, India, 3–5 October 2016; pp. 1261–1266. [Google Scholar] [CrossRef]
  8. Bakirtzis, A.G.; Biskas, P.N.; Zoumas, C.E.; Petridis, V. Optimal Power Flow by Enhanced Genetic Algorithm. IEEE Trans. Power Syst. 2002, 17, 229–236. [Google Scholar] [CrossRef]
  9. Optimal Power Flow Based on Linear Adapted Genetic Algorithm|Proceedings of the 9th WSEAS International Conference on Applications of Electrical Engineering. Available online: https://dl.acm.org/doi/abs/10.5555/1844259.1844291 (accessed on 18 September 2022).
  10. 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]
  11. Varadarajan, M.; Swarup, K.S. Solving Multi-Objective Optimal Power Flow Using Differential Evolution. IET Gener. Transm. Distrib. 2008, 2, 720–730. [Google Scholar] [CrossRef]
  12. Duman, S.; Güvenç, U.; Sönmez, Y.; Yörükeren, N. Optimal Power Flow Using Gravitational Search Algorithm. Energy Convers. Manag. 2012, 59, 86–95. [Google Scholar] [CrossRef]
  13. Jahan, M.S.; Amjady, N. Solution of Large-Scale Security Constrained Optimal Power Flow by a New Bi-Level Optimisation Approach Based on Enhanced Gravitational Search Algorithm. IET Gener. Transm. Distrib. 2013, 7, 1481–1491. [Google Scholar] [CrossRef]
  14. Bouchekara, H.R.E.H.; Chaib, A.E.; Abido, M.A.; El-Sehiemy, R.A. Optimal Power Flow Using an Improved Colliding Bodies Optimization Algorithm. Appl. Soft Comput. 2016, 42, 119–131. [Google Scholar] [CrossRef]
  15. El-Sehiemy, R.A.; Shafiq, M.B.; Azmy, A.M. Multi-Phase Search Optimisation Algorithm for Constrained Optimal Power Flow Problem. Int. J. Bio-Inspired Comput. 2014, 6, 275–289. [Google Scholar] [CrossRef]
  16. Pulluri, H.; Naresh, R.; Sharma, V. A Solution Network Based on Stud Krill Herd Algorithm for Optimal Power Flow Problems. Soft Comput. 2018, 22, 159–176. [Google Scholar] [CrossRef]
  17. Niknam, T.; Narimani, M.R.; Aghaei, J.; Azizipanah-Abarghooee, R. Improved Particle Swarm Optimisation for Multi-Objective Optimal Power Flow Considering the Cost, Loss, Emission and Voltage Stability Index. IET Gener. Transm. Distrib. 2012, 6, 515–527. [Google Scholar] [CrossRef]
  18. Liang, R.H.; Tsai, S.R.; Chen, Y.T.; Tseng, W.T. Optimal Power Flow by a Fuzzy Based Hybrid Particle Swarm Optimization Approach. Electr. Power Syst. Res. 2011, 81, 1466–1474. [Google Scholar] [CrossRef]
  19. Bhattacharya, A.; Chattopadhyay, P.K. Application of Biogeography-Based Optimisation to Solve Different Optimal Power Flow Problems. IET Gener. Transm. Distrib. 2011, 5, 70–80. [Google Scholar] [CrossRef]
  20. Bouchekara, H.R.E.H. Optimal Power Flow Using Black-Hole-Based Optimization Approach. Appl. Soft Comput. 2014, 24, 879–888. [Google Scholar] [CrossRef]
  21. Sivasubramani, S.; Swarup, K.S. Multi-Objective Harmony Search Algorithm for Optimal Power Flow Problem. Int. J. Electr. Power Energy Syst. 2011, 33, 745–752. [Google Scholar] [CrossRef]
  22. Optimal Power Flow Based on Imperialist Competitive Algorithm|Request PDF. Available online: https://www.researchgate.net/publication/295654369_Optimal_Power_Flow_Based_on_Imperialist_Competitive_Algorithm (accessed on 18 September 2022).
  23. 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]
  24. Radosavljević, J.; Klimenta, D.; Jevtić, M.; Arsić, N. Optimal Power Flow Using a Hybrid Optimization Algorithm of Particle Swarm Optimization and Gravitational Search Algorithm. Electr. Power Compon. Syst. 2015, 43, 1958–1970. [Google Scholar] [CrossRef]
  25. Adaryani, M.R.; 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]
  26. Morshed, M.J.; Fekih, A. A Fault-Tolerant Control Paradigm for Microgrid-Connected Wind Energy Systems. IEEE Syst. J. 2018, 12, 360–372. [Google Scholar] [CrossRef]
  27. Morshed, M.J.; Fekih, A. A New Fault Ride-through Control for DFIG-Based Wind Energy Systems. Electr. Power Syst. Res. 2017, 146, 258–269. [Google Scholar] [CrossRef]
  28. Li, G.; Zhang, R.; Jiang, T.; Chen, H.; Bai, L.; Cui, H.; Li, X. Optimal Dispatch Strategy for Integrated Energy Systems with CCHP and Wind Power. Appl. Energy 2017, 192, 408–419. [Google Scholar] [CrossRef]
  29. Yu, H.; Rosehart, W.D. An Optimal Power Flow Algorithm to Achieve Robust Operation Considering Load and Renewable Generation Uncertainties. IEEE Trans. Power Syst. 2012, 27, 1808–1817. [Google Scholar] [CrossRef]
  30. Ye, C.J.; Huang, M.X. Multi-Objective Optimal Power Flow Considering Transient Stability Based on Parallel NSGA-II. IEEE Trans. Power Syst. 2015, 30, 857–866. [Google Scholar] [CrossRef]
  31. Ramadhani, U.H.; Shepero, M.; Munkhammar, J.; Widén, J.; Etherden, N. Review of Probabilistic Load Flow Approaches for Power Distribution Systems with Photovoltaic Generation and Electric Vehicle Charging. Int. J. Electr. Power Energy Syst. 2020, 120, 106003. [Google Scholar] [CrossRef]
  32. Prusty, B.R.; Jena, D. A Critical Review on Probabilistic Load Flow Studies in Uncertainty Constrained Power Systems with Photovoltaic Generation and a New Approach. Renew. Sustain. Energy Rev. 2017, 69, 1286–1302. [Google Scholar] [CrossRef]
  33. Ullah, Z.; Wang, S.; Wu, G.; Hasanien, H.M.; Jabbar, M.W.; Qazi, H.S.; Tostado-Véliz, M.; Turky, R.A.; Elkadeem, M.R. Advanced Studies for Probabilistic Optimal Power Flow in Active Distribution Networks: A Scientometric Review. IET Gener. Transm. Distrib. 2022, 16, 3579–3604. [Google Scholar] [CrossRef]
  34. Aien, M.; Fotuhi-Firuzabad, M.; Rashidinejad, M. Probabilistic Optimal Power Flow in Correlated Hybrid Wind-Photovoltaic Power Systems. IEEE Trans. Smart Grid 2014, 5, 130–138. [Google Scholar] [CrossRef]
  35. Ruiz-Rodriguez, F.J.; Hernández, J.C.; Jurado, F. Probabilistic Load Flow for Photovoltaic Distributed Generation Using the Cornish–Fisher Expansion. Electr. Power Syst. Res. 2012, 89, 129–138. [Google Scholar] [CrossRef]
  36. Morshed, M.J.; Ben Hmida, J.; Fekih, A. A Probabilistic Multi-Objective Approach for Power Flow Optimization in Hybrid Wind-PV-PEV Systems. Appl. Energy 2018, 211, 1136–1149. [Google Scholar] [CrossRef]
  37. Rahmani, S.; Amjady, N. A New Optimal Power Flow Approach for Wind Energy Integrated Power Systems. Energy 2017, 134, 349–359. [Google Scholar] [CrossRef]
  38. Cao, J.; Yan, Z. Probabilistic Optimal Power Flow Considering Dependences of Wind Speed among Wind Farms by Pair-Copula Method. Int. J. Electr. Power Energy Syst. 2017, 84, 296–307. [Google Scholar] [CrossRef]
  39. Chen, J.J.; Wu, Q.H.; Zhang, L.L.; Wu, P.Z. Multi-Objective Mean–Variance–Skewness Model for Nonconvex and Stochastic Optimal Power Flow Considering Wind Power and Load Uncertainties. Eur. J. Oper. Res. 2017, 263, 719–732. [Google Scholar] [CrossRef]
  40. Zou, B.; Xiao, Q. Solving Probabilistic Optimal Power Flow Problem Using Quasi Monte Carlo Method and Ninth-Order Polynomial Normal Transformation. IEEE Trans. Power Syst. 2014, 29, 300–306. [Google Scholar] [CrossRef]
  41. Xiao, Q. Comparing Three Methods for Solving Probabilistic Optimal Power Flow. Electr. Power Syst. Res. 2015, 124, 92–99. [Google Scholar] [CrossRef]
  42. Shargh, S.; Khorshid ghazani, B.; Mohammadi-ivatloo, B.; Seyedi, H.; Abapour, M. Probabilistic Multi-Objective Optimal Power Flow Considering Correlated Wind Power and Load Uncertainties. Renew. Energy 2016, 94, 10–21. [Google Scholar] [CrossRef]
  43. Ghasemi, M.; Ghavidel, S.; Ghanbarian, M.M.; Gharibzadeh, M.; Azizi Vahed, A. Multi-Objective Optimal Power Flow Considering the Cost, Emission, Voltage Deviation and Power Losses Using Multi-Objective Modified Imperialist Competitive Algorithm. Energy 2014, 78, 276–289. [Google Scholar] [CrossRef]
  44. Shaheen, M.A.M.; Hasanien, H.M.; Mekhamer, S.F.; Qais, M.H.; Alghuwainem, S.; Ullah, Z.; Tostado-Véliz, M.; Turky, R.A.; Jurado, F.; Elkadeem, M.R. Probabilistic Optimal Power Flow Solution Using a Novel Hybrid Metaheuristic and Machine Learning Algorithm. Mathematics 2022, 10, 3036. [Google Scholar] [CrossRef]
  45. Jiang, P.; Liu, Z.; Niu, X.; Zhang, L. A Combined Forecasting System Based on Statistical Method, Artificial Neural Networks, and Deep Learning Methods for Short-Term Wind Speed Forecasting. Energy 2021, 217, 119361. [Google Scholar] [CrossRef]
  46. Reddy, Y.; Jithendranath, J.; Chakraborty, A.K.; Guerrero, J.M. Stochastic Optimal Power Flow in Islanded DC Microgrids with Correlated Load and Solar PV Uncertainties. Appl. Energy 2022, 307, 118090. [Google Scholar] [CrossRef]
  47. Li, S.; Gong, W.; Wang, L.; Gu, Q. Multi-Objective Optimal Power Flow with Stochastic Wind and Solar Power. Appl. Soft Comput. 2022, 114, 108045. [Google Scholar] [CrossRef]
  48. Gualtieri, G.; Secci, S. Methods to Extrapolate Wind Resource to the Turbine Hub Height Based on Power Law: A 1-h Wind Speed vs. Weibull Distribution Extrapolation Comparison. Renew. Energy 2012, 43, 183–200. [Google Scholar] [CrossRef]
  49. Kumari, B.A.; Vaisakh, K. Integration of Solar and Flexible Resources into Expected Security Cost with Dynamic Optimal Power Flow Problem Using a Novel DE Algorithm. Renew. Energy Focus 2022, 42, 48–69. [Google Scholar] [CrossRef]
  50. Andreas, A.; Stoffel, T. NREL Solar Radiation Research Laboratory (SRRL): Baseline Measurement System (BMS); Golden, Colorado (Data). NREL Report No. DA-5500-56488; 1981. Available online: https://midcdmz.nrel.gov/apps/sitehome.pl?site=BMS#DOI (accessed on 7 September 2022).
  51. Kim, S.; Hur, J. A Probabilistic Modeling Based on Monte Carlo Simulation of Wind Powered EV Charging Stations for Steady-States Security Analysis. Energies 2020, 13, 5260. [Google Scholar] [CrossRef]
  52. Liu, Y.; Guo, L.; Hou, R.; Wang, C.; Wang, X. A Hybrid Stochastic/Robust-Based Multi-Period Investment Planning Model for Island Microgrid. Int. J. Electr. Power Energy Syst. 2021, 130, 106998. [Google Scholar] [CrossRef]
  53. Syakur, M.A.; Khotimah, B.K.; Rochman, E.M.S.; Satoto, B.D. Integration K-Means Clustering Method and Elbow Method For Identification of The Best Customer Profile Cluster. IOP Conf. Ser. Mater. Sci. Eng. 2018, 336, 012017. [Google Scholar] [CrossRef]
  54. Umargono, E.; Suseno, J.E.; Gunawan, S.V. K-Means Clustering Optimization Using the Elbow Method and Early Centroid Determination Based on Mean and Median Formula. In Proceedings of the 2nd International Seminar on Science and Technology (ISSTEC 2019), Yogyakarta, Indonesia, 25–26 November 2019; Atlantis Press: Paris, France, 2020. [Google Scholar] [CrossRef]
  55. Liu, L.; Peng, Z.; Wu, H.; Jiao, H.; Yu, Y.; Zhao, J. Fast Identification of Urban Sprawl Based on K-Means Clustering with Population Density and Local Spatial Entropy. Sustainability 2018, 10, 2683. [Google Scholar] [CrossRef] [Green Version]
  56. Abdollahzadeh, B.; Gharehchopogh, F.S.; Mirjalili, S. Artificial Gorilla Troops Optimizer: A New Nature-Inspired Metaheuristic Algorithm for Global Optimization Problems. Int. J. Intell. Syst. 2021, 36, 5887–5958. [Google Scholar] [CrossRef]
  57. Osman, M.S.; Abo-Sinna, M.A.; Mousa, A.A. A Solution to the Optimal Power Flow Using Genetic Algorithm. Appl. Math. Comput. 2004, 155, 391–405. [Google Scholar] [CrossRef]
  58. Turkay, B.E.; Cabadag, R.I. Optimal Power Flow Solution Using Particle Swarm Optimization Algorithm. IEEE EuroCon 2013 2013, 1418–1424. [Google Scholar] [CrossRef]
  59. Shaheen, M.A.M.; Hasanien, H.M.; Mekhamer, S.F.; Talaat, H.E.A. Optimal Power Flow of Power Systems Including Distributed Generation Units Using Sunflower Optimization Algorithm. IEEE Access 2019, 7, 109289–109300. [Google Scholar] [CrossRef]
  60. Islam, M.Z.; Abdul Wahab, N.I.; Veerasamy, V.; Hizam, H.; Mailah, N.F.; Khan, A.; Sabo, A. Optimal Power Flow Using a Novel Harris Hawk Optimization Algorithm to Minimize Fuel Cost and Power Loss. 2019 IEEE Conf. Sustain. Util. Dev. Eng. Technol. CSUDET 2019, 2019, 246–250. [Google Scholar] [CrossRef]
  61. Khan, A.; Hizam, H.; bin Abdul Wahab, N.I.; Othman, M.L. Optimal Power Flow Using Hybrid Firefly and Particle Swarm Optimization Algorithm. PLoS ONE 2020, 15, e0235668. [Google Scholar] [CrossRef]
  62. Grigg, C.; Wong, P. The IEEE Reliability Test System -1996 a Report Prepared by the Reliability Test System Task Force of the Application of Probability Methods Subcommittee. IEEE Trans. Power Syst. 1999, 14, 1010–1020. [Google Scholar] [CrossRef]
  63. Index of /Data. Available online: http://motor.ece.iit.edu/data/ (accessed on 14 August 2022).
  64. 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]
Figure 1. Weibull PDF of the wind data for the summer season.
Figure 1. Weibull PDF of the wind data for the summer season.
Sustainability 15 00783 g001
Figure 2. Beta PDF of the PV data for the summer season.
Figure 2. Beta PDF of the PV data for the summer season.
Sustainability 15 00783 g002
Figure 3. Wind speed variation in (m/s) for hour 10 (c = 5.2076, k = 2.6783).
Figure 3. Wind speed variation in (m/s) for hour 10 (c = 5.2076, k = 2.6783).
Sustainability 15 00783 g003
Figure 4. Solar irradiance in (kW/m2) at hour 10 (α = 8.67, β = 7.6126).
Figure 4. Solar irradiance in (kW/m2) at hour 10 (α = 8.67, β = 7.6126).
Sustainability 15 00783 g004
Figure 5. Example of wind speed data at hour 19 after running the MCS for 8000 scenarios: (a) the initial centroid points and (b) the final locations of the centroids, and each set of data belonging to each centroid.
Figure 5. Example of wind speed data at hour 19 after running the MCS for 8000 scenarios: (a) the initial centroid points and (b) the final locations of the centroids, and each set of data belonging to each centroid.
Sustainability 15 00783 g005
Figure 6. Example of the data ofor solar irradiance at hour 19 after running the MCS for 8000 scenarios: (a) the initial centroid points and (b) the final locations of the centroids, and each set of data belonging to each centroid.
Figure 6. Example of the data ofor solar irradiance at hour 19 after running the MCS for 8000 scenarios: (a) the initial centroid points and (b) the final locations of the centroids, and each set of data belonging to each centroid.
Sustainability 15 00783 g006
Figure 7. SSE for wind speed data with the number of clusters at hour 14.
Figure 7. SSE for wind speed data with the number of clusters at hour 14.
Sustainability 15 00783 g007
Figure 8. SSE for solar irradiance data with the number of clusters at hour 14.
Figure 8. SSE for solar irradiance data with the number of clusters at hour 14.
Sustainability 15 00783 g008
Figure 9. Flowchart of the Gorilla Troops Optimizer [56].
Figure 9. Flowchart of the Gorilla Troops Optimizer [56].
Sustainability 15 00783 g009
Figure 10. Example of variable load curve for the 30-bus system at bus 15.
Figure 10. Example of variable load curve for the 30-bus system at bus 15.
Sustainability 15 00783 g010
Figure 11. Example of variable load curve for the 118-bus system at bus 15.
Figure 11. Example of variable load curve for the 118-bus system at bus 15.
Sustainability 15 00783 g011
Figure 12. Convergence curve of the objective function using the GTO vs. different algorithms for a 30-bus system.
Figure 12. Convergence curve of the objective function using the GTO vs. different algorithms for a 30-bus system.
Sustainability 15 00783 g012
Figure 13. Fuel cost calculated using different algorithms for a fixed load for the 30 bus system.
Figure 13. Fuel cost calculated using different algorithms for a fixed load for the 30 bus system.
Sustainability 15 00783 g013
Figure 14. Fuel cost calculated using different algorithms for variable load for the 30 bus system.
Figure 14. Fuel cost calculated using different algorithms for variable load for the 30 bus system.
Sustainability 15 00783 g014
Figure 15. Effect of adding the RES on the total cost for fixed loads for the 30 bus system.
Figure 15. Effect of adding the RES on the total cost for fixed loads for the 30 bus system.
Sustainability 15 00783 g015
Figure 16. Effect of adding the RES on the total cost for time-varying loads for the 30 bus system.
Figure 16. Effect of adding the RES on the total cost for time-varying loads for the 30 bus system.
Sustainability 15 00783 g016
Figure 17. Convergence curve of the objective function using the GTO vs. different algorithms for the 118-bus system.
Figure 17. Convergence curve of the objective function using the GTO vs. different algorithms for the 118-bus system.
Sustainability 15 00783 g017
Figure 18. Fuel cost calculated using different algorithms for a fixed load for the 118 bus system.
Figure 18. Fuel cost calculated using different algorithms for a fixed load for the 118 bus system.
Sustainability 15 00783 g018
Figure 19. Fuel cost calculated using different algorithms for a variable load for the 118 bus system.
Figure 19. Fuel cost calculated using different algorithms for a variable load for the 118 bus system.
Sustainability 15 00783 g019
Figure 20. Effect of adding the RESs on the total cost of the IEEE 118-bus system for fixed loads.
Figure 20. Effect of adding the RESs on the total cost of the IEEE 118-bus system for fixed loads.
Sustainability 15 00783 g020
Figure 21. Effect of adding the RESs on the total cost of the IEEE 118-bus system for variableloads.
Figure 21. Effect of adding the RESs on the total cost of the IEEE 118-bus system for variableloads.
Sustainability 15 00783 g021
Table 1. The Weibull parameters of the equivalent 24-h summer day for wind data.
Table 1. The Weibull parameters of the equivalent 24-h summer day for wind data.
HourCKHourCK
17.2743.043136.7933.036
27.2572.854146.9683.036
37.4172.921157.2882.998
47.4443.146167.3722.806
57.5042.862177.3573.102
67.2142.858187.4562.821
76.8522.547197.2782.845
85.8432.072207.0082.475
95.1272.309216.8872.475
105.2082.678226.9492.638
115.7933.232236.9842.771
126.4393.149247.2792.716
Table 2. The Beta parameters of the equivalent 24-h summer day for the PV data.
Table 2. The Beta parameters of the equivalent 24-h summer day for the PV data.
HourαβHourαβ
100130.4120.044
200140.3720.055
300150.9280.426
400161.7261.639
500172.1853.603
600182.3677.990
73.540119.773193.83731.290
810.90074.130200.53417.101
910.49721.7722100
108.6707.6132200
115.8872.6292300
122.1590.4962400
Table 3. Key features of the three studied systems.
Table 3. Key features of the three studied systems.
Characteristics30-Bus Test System118-Bus Test System
ValueDetailValueDetail
Number of buses30-bus[43]118-bus[63]
Generators6Buses-location: 1, 2,
5, 8, 11 and 13
54Buses-location: 1, 4, 6, 8, 10, 12, 15, 18, 19, 24, 25, 26, 27, 31, 32, 34, 36,40, 42, 46, 49, 54, 55, 56, 59, 61, 62, 65, 66, 69, 70, 72, 73, 74, 76,77, 80, 85, 87, 89, 90, 91, 92, 99, 100, 103, 104, 105, 107, 110,111, 112, 113 and 116
Branches41 186
Transformers4Branches: 11, 12,
15 and 36
9Branches: 8, 32, 36, 51, 93, 95, 102, 107 and 127
Loads21 99
Connected load (MVA)283.4 + j126.2 4242 + j1438
Load losses (MVA)5.28 + j23.14 132.86 + j783.79
Bus voltage limits[0.9–1.1] [0.9–1.1]
Table 4. Scenarios of the OPF.
Table 4. Scenarios of the OPF.
Scenario No.The Scenario Details
1Solve the classical OPF (with no RESs) for fixed loads and compare the results of the proposed technique with the other chosen approaches.
2Add the PV & Wind generators at the optimal bus location, solve the POPF, and compare the result of the proposed algorithm with other algorithms using fixed and variable loads.
3Show the effect of adding the PV & wind generators on the total fuel cost using the proposed algorithm with fixed and variable loads.
Table 5. Comparison of GTO with different algorithms case 1.
Table 5. Comparison of GTO with different algorithms case 1.
GTOGAPSOSFOHHOHFPSO
P G 1 (MW)197.2527194.4922197.2210195.7589196.624197.2172
P G 2 (MW)44.7962836.0319844.697839.7489942.1152244.68869
P G 3 (MW)20.434521.0880820.419120.7484521.4644420.41206
P G 4 (MW)10.0006712.3306610.138813.4211212.0058710.15811
P G 5 (MW)1013.855651011.9625710.0177410
P G 6 (MW)1216.107981212.4815112.0555812
Min Cost($/hr)915.78184918.96676915.78142916.5774915.96791915.78142
Table 6. Optimal bus location for the RES for different test systems.
Table 6. Optimal bus location for the RES for different test systems.
IEEE 30-BusIEEE 118-Bus
Optimal bus for PV4114
Optimal bus for Wind2115
Table 7. Cost Reduction Percentages resulting from adding PV and wind generators for a fixed load for the 30 bus system.
Table 7. Cost Reduction Percentages resulting from adding PV and wind generators for a fixed load for the 30 bus system.
Hour123456789101112
PV0.00%0.00%0.00%0.00%0.00%0.00%0.06%0.88%2.31%3.76%4.88%5.72%
Wind2.97%2.91%3.05%3.04%3.10%2.87%2.53%1.83%1.30%1.38%1.88%2.27%
PV & Wind2.97%2.91%3.05%3.04%3.10%2.87%2.67%2.74%3.64%5.06%6.55%7.51%
Hour131415161718192021222324
PV6.25%6.06%4.77%3.65%2.68%1.65%0.63%0.11%0.00%0.00%0.00%0.00%
Wind2.60%2.75%2.97%3.01%3.02%3.11%2.90%2.70%2.63%2.69%2.74%2.91%
PV & Wind7.56%7.66%7.39%6.61%5.75%4.77%3.64%2.95%2.63%2.69%2.74%2.91%
Table 8. Cost Reduction Percentages resulting from adding PV and wind generators for a variable load for the 30 bus system.
Table 8. Cost Reduction Percentages resulting from adding PV and wind generators for a variable load for the 30 bus system.
Hour123456789101112
PV0.00%0.00%0.00%0.00%0.00%0.00%0.06%0.90%2.26%3.87%4.88%5.68%
Wind3.20%3.24%3.46%3.57%3.55%3.30%2.81%1.90%1.26%1.43%1.88%2.36%
PV & W3.20%3.24%3.46%3.57%3.55%3.30%2.89%2.78%3.55%5.12%6.58%7.46%
Hour131415161718192021222324
PV6.35%6.09%4.82%3.60%2.60%1.78%0.70%0.07%0.00%0.00%0.00%0.00%
Wind2.62%2.72%2.98%3.00%2.96%3.18%2.98%2.62%2.68%2.61%2.58%3.05%
PV & Wind7.64%7.49%7.40%6.56%5.75%4.91%3.70%2.88%2.68%2.61%2.58%3.05%
Table 9. Comparison of the GTO with different algorithms, Case 4.
Table 9. Comparison of the GTO with different algorithms, Case 4.
GTOGAPSOSFOHHOHFPSO
P G 1 (MW)26.1884838.69563080.8049833.5554625.46572
P G 2 (MW)034.54459037.3556613.12340
P G 3 (MW)3.13187540.67364010.770515.9628292.065198
P G 4 (MW)044.69058046.483317.852590
P G 5 (MW)401.3321243.0178415.8368210.9861396.2438400.7185
P G 6 (MW)86.4442179.9837389.9027938.3384895.761286.33017
P G 7 (MW)25.0588551.942755.3577122.219521.62338722.81037
P G 8 (MW)040.09035016.525783.90375514.5435
P G 9 (MW)25.1382148.08774037.957643.13442521.63433
P G 10 (MW)2.65 ×10−830.05467062.2666417.827990
P G 11 (MW)193.7335139.6534200.6964137.652140.3687193.4682
P G 12 (MW)279.574168.6507289.5222167.6169309.3616279.1499
P G 13 (MW)11.1609837.95601053.0932516.5113410.41423
P G 14 (MW)7.29993520.562237.61437525.173638.7642797.290661
P G 15 (MW)15.562538.14864047.9047428.852314.68148
P G 16 (MW)7.75990644.6341936.103747.3214930.8046.87235
P G 17 (MW)13.2405845.0793337.2912569.9302928.0797712.45803
P G 18 (MW)52.096738.98866071.7034710.7741451.73578
P G 19 (MW)45.620443.32827082.6471719.3090945.43208
P G 20 (MW)19.1521934.0685419.8327747.9430423.7026919.14443
P G 21 (MW)194.3681123.5074201.957220.9543205.6901194.3044
P G 22 (MW)49.598458.7138351.2170643.5834929.9560149.59079
P G 23 (MW)32.6131241.3744461.3623734.856943.59176832.43649
P G 24 (MW)33.4010851.23699063.353626.23091133.22536
P G 25 (MW)149.9672107.3912153.979782.20485168.4252149.9155
P G 26 (MW)148.3587111.358152.3196111.5377162.9175148.2991
P G 27 (MW)043.39223074.012920.8022410
P G 28 (MW)352.8442257.211362.4883181.7175319.5687352.6833
P G 29 (MW)350.0555232.6245360.3861153.2511264.4179349.9061
P G 30 (MW)454.4951335.8225466.4657364.7503458.2573454.3115
P G 31 (MW)039.08945059.0570235.495170
P G 32 (MW)043.714116.91305523.687313.7866130
P G 33 (MW)042.8028211.9030655.4700917.885530
P G 34 (MW)15.9060348.36927022.819191.57605915.61905
P G 35 (MW)19.0892446.80627067.1778914.8872718.93601
P G 36 (MW)044.07293019.7574516.678510
P G 37 (MW)432.5556284.9051441.0368340.4575413.9175432.4178
P G 38 (MW)042.07106036.193691.3071140
P G 39 (MW)3.62269816.80306015.010341.9983343.620793
P G 40 (MW)495.5841311.9643497.4787320.7231547.9216495.508
P G 41 (MW)052.28653041.3323133.268190
P G 42 (MW)047.19072055.131771.3733830
P G 43 (MW)053.90083055.0457426.083280
P G 44 (MW)044.12449054.943543.8089790
P G 45 (MW)231.3747131.5375229.8034192.9504228.3779231.3408
P G 46 (MW)38.3906544.3191237.4051649.808940.0792738.3863
P G 47 (MW)047.6864506.30923510.274070
P G 48 (MW)4.35359342.00289064.332851.1729264.309747
P G 49 (MW)29.4959347.1543921.0547833.542251.51865929.46746
P G 50 (MW)6.67616848.7612610018.560247.120696.644204
P G 51 (MW)35.07454.0131232.2667630.6500419.7720635.07286
P G 52 (MW)40.8957357.990373.08744226.4268729.1109140.8769
P G 53 (MW)035.42681041.835733.1172570
P G 54 (MW)053.13364024.8533218.98480
Min Cost($/hr)130,159.80628137,112.90305130,615.18496138,281.50269131,470.33551130,156.68222
Table 10. Cost Reduction Percentages resulting from adding PV and wind generators for a fixed load of the 118 bus system.
Table 10. Cost Reduction Percentages resulting from adding PV and wind generators for a fixed load of the 118 bus system.
Hour123456789101112
PV0.00%0.00%0.00%0.00%0.00%0.00%0.04%0.93%2.47%4.00%5.13%6.02%
Wind4.09%4.11%4.26%4.29%4.31%4.08%3.62%2.61%1.83%1.89%2.60%3.21%
PV & Wind4.09%4.11%4.26%4.29%4.31%4.08%3.67%3.59%4.36%5.84%7.56%8.72%
Hour131415161718192021222324
PV6.59%6.39%5.10%3.86%2.82%1.76%0.72%0.10%0.00%0.00%0.00%0.00%
Wind3.62%3.77%4.12%4.22%4.20%4.26%4.13%3.73%3.63%3.74%3.76%4.07%
PV & Wind8.75%8.82%8.77%8.01%7.04%6.13%4.94%3.99%3.63%3.74%3.76%4.07%
Table 11. Cost Reduction Percentages resulting from adding PV and wind generators for a variable load of the 118 bus system.
Table 11. Cost Reduction Percentages resulting from adding PV and wind generators for a variable load of the 118 bus system.
Hour123456789101112
PV0.00%0.00%0.00%0.00%0.00%0.00%0.10%1.21%2.80%4.21%5.20%6.01%
Wind5.86%6.49%6.69%7.03%6.82%6.69%5.33%3.26%2.11%2.00%2.63%3.23%
PV & Wind5.86%6.49%6.69%7.03%6.82%6.69%5.48%4.57%5.04%6.17%7.64%8.74%
Hour131415161718192021222324
PV6.69%6.43%5.07%4.00%3.03%1.83%0.81%0.15%0.00%0.00%0.00%0.00%
Wind3.70%3.81%4.13%4.38%4.45%4.48%4.49%4.06%3.98%4.02%4.40%5.46%
PV & Wind8.88%8.82%8.74%8.29%7.41%6.45%5.35%4.38%3.98%4.02%4.40%5.46%
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.

Share and Cite

MDPI and ACS Style

Hashish, M.S.; Hasanien, H.M.; Ji, H.; Alkuhayli, A.; Alharbi, M.; Akmaral, T.; Turky, R.A.; Jurado, F.; Badr, A.O. Monte Carlo Simulation and a Clustering Technique for Solving the Probabilistic Optimal Power Flow Problem for Hybrid Renewable Energy Systems. Sustainability 2023, 15, 783. https://doi.org/10.3390/su15010783

AMA Style

Hashish MS, Hasanien HM, Ji H, Alkuhayli A, Alharbi M, Akmaral T, Turky RA, Jurado F, Badr AO. Monte Carlo Simulation and a Clustering Technique for Solving the Probabilistic Optimal Power Flow Problem for Hybrid Renewable Energy Systems. Sustainability. 2023; 15(1):783. https://doi.org/10.3390/su15010783

Chicago/Turabian Style

Hashish, Mohamed S., Hany M. Hasanien, Haoran Ji, Abdulaziz Alkuhayli, Mohammed Alharbi, Tlenshiyeva Akmaral, Rania A. Turky, Francisco Jurado, and Ahmed O. Badr. 2023. "Monte Carlo Simulation and a Clustering Technique for Solving the Probabilistic Optimal Power Flow Problem for Hybrid Renewable Energy Systems" Sustainability 15, no. 1: 783. https://doi.org/10.3390/su15010783

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