Next Article in Journal
Modelling the Dynamic Interaction between Economic Policy Uncertainty and Commodity Prices in India: The Dynamic Autoregressive Distributed Lag Approach
Previous Article in Journal
Return on Advertising Spend Prediction with Task Decomposition-Based LSTM Model
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Developed Gorilla Troops Technique for Optimal Power Flow Problem in Electrical Power Systems

1
Department of Electrical Engineering, Faculty of Engineering, Suez University, Suez 43533, Egypt
2
Department of Electrical Engineering, Faculty of Engineering, Kafrelsheikh University, Kafrelsheikh 33516, Egypt
3
Department of Electrical Engineering, Faculty of Engineering, Damietta University, Damietta 34517, Egypt
4
Department of Electrical Engineering, College of Engineering, Taif University, Taif 21944, Saudi Arabia
5
Department of Electrical Engineering, Cairo University, Giza 12613, Egypt
*
Author to whom correspondence should be addressed.
Mathematics 2022, 10(10), 1636; https://doi.org/10.3390/math10101636
Submission received: 2 April 2022 / Revised: 29 April 2022 / Accepted: 9 May 2022 / Published: 11 May 2022

Abstract

:
This paper presents a developed solution based on gorilla troops optimization technique for OPFP in EPSs. The GTOT is motivated by gorillas’ group behaviors in which several methods are replicated, such as migration to an unfamiliar location, traveling to other gorillas, migration toward a specific spot, accompanying the silverback, and competing for adult females. The multi-dimension OPFP in EPSs is examined in this article with numerous optimizing objectives of fuel cost, power losses, and harmful pollutants. The system’s power demand and transmission losses must be met as well. The developed GTOT’s evaluation is conducted using an IEEE standard 30-bus EPS and practical EPS from Egypt. The created GTOT is employed in numerous evaluations and statistical analyses using many modern methods such as CST, GWT, ISHT, NBT, and SST. When compared to other similar approaches in the literature, the simulated results demonstrate the GTOT’s solution efficiency and robustness.

1. Introduction

The optimum operational analysis is critical in determining the projected financial return for electrical networks. The energy supply is shifting around the globe towards sustainability, low carbon content, and high efficiency [1]. The increased load demand acts as an urgent challenge for power system operators. The economic and environmental prospects of power generations in modern power systems are considered the weighty research targets and the key concern of electric utility operators. The OPFP is a non-linear, multi-model issue in EPSs for power system control and operation. Using OPFP, pecuniary and safe operating circumstances of EPSs can be elaborated [2]. The solution of OPFP is currently the principal strategy for controlling and operating the modern power grids [3]. The OPFP can optimize one or even more targets such as cost of fuel, EPS sources pollution, and system losses. These goals may be met while maintaining load flow balancing and keeping operating variables inside the corresponding limitations, including voltages restrictions, transmission network limits, valve constraints, and generator output limits [4].
Various standard mathematic methodologies were proposed to address the OPFP, such as semidefinite programming [5], non-linear programming [6], linear programming [7,8], quadratic programming [9,10], fuzzy linear programming [11], sequential unconstrained minimization technique [12], Newton-based method [13,14] and interior point approach [15,16,17]. A myriad of these approaches can effectively impose inequality restrictions and possess high convergence properties. Nevertheless, these conventional methods cannot generate the real optimal results because they rely on the initial settings, and consequently, they may get stuck in a local minimum. Additionally, every approach should be modeled with particular variants for OPFP, and they cannot deal with variables of discrete and integer natures smoothly. Hence, it is pivotal to develop metaheuristic techniques to overcome the mentioned disadvantages. The rapid growth of computers in the last two decades has led to a trend to solve diverse OPFP challenges using several heuristic (population-based) techniques [18,19]. Examples of these population-based heuristics are CBOA [20], BBO [21], PSO [22,23], HGWODE [24], GA [25], EMM [26], TLBO [27], and SAO [28].
In addition to that, recent techniques have been manifested to attain the solution of the large-scale OPFP: QMFT [29], COA [30], CSSO [31], and WCEMFT [32]. Moreover, a multi-group strategy was combined with the marine predators method to subdivide the original population into numerous separate groups in order to reduce the operation costs of power systems to maximize the economic advantages [33]. To tackle the economic dispatch difficulties of thermal generators, the DE method based on nondominated sorting was used to reduce pollution emissions and economic costs taking into account the dynamical schedule of thermal power units with consideration of ramp-rate, valve-point impact, and balance of power [34]. This method has been applied to two different systems with 13 and 40 thermal generating units.
Various augmentations of the algorithm strategies can be used to identify the best OPFP solution. An emended moth swarm algorithm (EMSA), in [35], has been presented to the OPFP with adjustment of quasi-opposition-based learning. Moreover, AGST, developed in [36], has been illustrated and applied with three objectives which are the fuel cost, emission, and losses taking into consideration different equality and inequality constraints. Additionally, ISSO was presented to minimize fuel costs, emissions, and power losses [37] by adjusting the movement technique of male and female spiders to acceptable ratios. In [38], a modified JAYA has been manifested by proposing modifying the equation for solutions that rely on the worst and best solutions, and technique has been applied to fuel cost, emission, voltage profile, and losses functions. Furthermore, IADE has been handled, in [39], with the self-adaptive penalty constraint technique and applied to the OPFP. To enhance exploration capability and the solution optimality convergence, quasi-oppositional-based learning has emerged with the Jaya technique in [40] to attain the OPFP solution. Moreover, an improved NSGA-III has been utilized with constraint management and decreasing selecting attempts to solve fuel costs, losses, and emission functions, as depicted in [41]. In [42], MRFO was implemented for EPSs to decrease the costs of fuel, losses, and pollution with/without the inclusion of voltage-source-converter stations.
Recently, a technique named gorilla troops optimization technique (GTOT) [43] proposed by (Benyamin Abdollahzadeh et al.) is developed in this article for multi-dimension OPFP in EPSs by adding valve constraint to the OPFP. GTOT is developed with five strategies to enlighten the exploitation and exploration of the optimization progression. To deal with the exploration phase, three strategies are verified: migration to a not recognized place, movement to other gorillas, and migration to a recognized location. Nevertheless, in the exploitation phase, two strategies are verified: follow the silverback and struggle for adult females. The superiority of this technique is that it has few parameters to be adjusted as well as it is simple to be implemented for engineering applications. The evaluation of GTOT quality is illustrated by applying it to various systems: IEEE standard 30 bus and practical WD Area. The results of the GTOT are compared with recent techniques and other existing techniques to demonstrate its efficacy and superiority between these techniques. The following are important contributions discussed in this work.
  • The designed GTOT is exploited to reduce different target functions for minimizing the fuel costs, power losses, and pollutant emissions related to EPSs and applied on the IEEE standard 30 bus and practical WD.
  • Multi-dimension operations with two or three objectives are developed in this work.
  • The developed GTOT outperforms a number of current approaches, including CST, GWT, ISHT, NBT, and SST.
  • Statistical analyses and stability assessments are developed in this work to demonstrate the capability of the proposed GTOT in handling the OPFP with different sizes and objective functions.
  • The simulation results of related techniques in the literature are compared with the developed GTOT to demonstrate the robustness and solution quality of GTOT.
  • Substantial consistency is accompanied by the proposed GTOT for handling the OPFP in EPSs.
The other portions of the whole work are as follows: Section 2 illustrates the GTOT approach. Section 3 establishes the OPFP construction, whereas Section 4 manifests the designed GTOT for OPFP. Furthermore, the simulated findings and discussions are denoted in Section 5, whilst the concluding notes are provided in Section 6.

2. Gorilla Troops Optimization Technique

The gorilla troops optimization technique (GTOT) simulates five strategic options to clarify the optimizing process’s exploitation and exploration, as manifested in the following paragraphs.

2.1. Exploration Phase

In GTOT, every gorilla is denoted by a candidate solution, but at every optimizing operational phase, the global optimal solution is designated as a silverback. For the exploratory stage of development, three distinct methods are used. The first one is the movement to an unknown destination to raise GTOT exploration, while the second method is the movement of other gorillas to enhance the consistency between exploratory and exploitation. Moreover, the third method is the gorilla’s movement in the path of a recognized destination to raise GTOT capabilities to discover varied computation spaces. In this technique, the factor (Pr) should be supplied in the band [0:1] prior to the optimizing process. When a factor (Pr) is greater than a random number, the movement to an undetermined location strategy is selected [44]. Additionally, if a random number is more than or equal to 50%, a movement in the path of an identifiable place is decided, whereas if a random number is less than 50%, a movement in the path of a recognized site is selected. Those three exploratory tactics can be mathematically stated as follows:
G X ( g + 1 ) = { L L + r d 1 × ( U L L L ) , Pr > r a n d , H × L + X r ( g ) × ( r d 2 C ) , 0.5 r a n d , X ( g ) + ( X ( g ) G X r ( t ) ) × r d 3 ( X ( g ) G X r ( g ) × L 2 ) , 0.5 > r a n d
C = F × ( 1 I t e r / M a x I t e r ) ,
F = cos ( 2 × r d 4 ) + 1 ,
L = C × l
H = Z × X ( g )
Z = [ C , C ] .

2.2. Exploitation Phase

In the exploitation stage of GTOT, two methods are used: following the silverback and competing for female adults. Based on factor C and contrasting it to the variable (W) (which can be changed), one of the two methods is selected.
The leader of the gorillas’ group is the silverback that can make choices and directs the others to sources of food. If the C is greater than or equal to the value of W, this approach is chosen. Equation (7) can be used to illustrate this phenomenon.
G X ( g + 1 ) = L × M ( g ) × ( X ( g ) X s i v e r b a c k ) + X ( g )
M ( g ) = ( | ( 1 / N ) i = 1 N G X i ( g ) | 2 L ) ( 1 2 L )
If C is less than W, the next approach is competing for female adults, which is specialized for the evaluation stage. When adolescent gorillas reach adolescence, they engage in a violent rivalry with other males for the selection of female adults. This behavior is formulated as follows:
G X ( g ) = X s i l v e r b a c k ( X s i l v e r b a c k × Q X ( g ) × Q ) × A ,
Q = 2 × r d 5 1
A = β × E
E = { N 1 r a n d 0.5 N 2 r a n d < 0.5
At the end of the exploitation stage, the cost of GX(g) is compared to its counterpart X(g), and if the cost of GX(g) is less than X(g), the GX(g) solution replaces it and becomes the optimal option (silverback). Figure 1 depicts the major processes of the developed GTOT for extracting characteristics from solar cell models [44].

3. Problem Formulation

In OPFP, the dependent and independent variables are represented. To illustrate, the generators’ real power output and the reactive power injections of switching capacitors and reactors, voltages of the generators, tap changer settings, the number of on-load tap changers, generators, and reactive power sources, generator reactive power outputs, load bus voltage magnitudes, and transmission flow limits, number of transmission lines and load buses are the main pillars of OPFP. This problem can be expressed as follows:
Min   OJ = { OJ 1 ( x , y ) , OJ 2 ( x , y ) . , OJ m ( x , y ) }
Subject   to :   F ( x , y ) = 0
M ( x , y ) 0

3.1. Objectives

The primary goal is to calculate the OJ1 in dollars per hour as follows:
OJ 1 = k = 1 Ng C k × Pg k 2 + B k × Pg k + A k
Because of the constant change in steam valves in power plants, the valve-point load influence generates fluctuations in the FCs. As a consequence, the FCs formula is produced by integrating sinusoidal rectifications to the quadratic formula, and OJ2 can be represented as follows:
OJ 2 = k = 1 Ng C k × Pg k 2 + B k × Pg k + A k + | E k × ( sin ( F k ( P g k P g k min ) ) ) |
The second goal is to minimize OJ3 from the power plants, which can be formulated as:
OJ 3 = k = 1 Ng ( γ k × Pg k 2 + β k × Pg k + α k ) / 100 + ζ k × e λ k × Pg k
The third goal is to minimize the overall power loss throughout the transmission system, which is mathematically stated as:
OJ 4 = m = 1 Nb n = 1 Nb G mn × ( V m 2 + V n 2 2 ( V m × V n × cos   θ mn ) )

3.2. System Constraints

The load flow balance equations, Equations (20) and (21), manifest the equality constraints:
Pg j PL j V j × k = 1 Nb V k × ( G jk × cos   θ jk + B jk × sin   θ jk ) = 0 ,   j = 1 ,   ,   Nb
QL j V j × k = 1 Nb V k × ( G jk × sin θ jk B jk × cos θ jk ) = 0 ,   j = 1 , 2 ,   ,   Nb
Furthermore, the operating variables and the accompanying restrictions are written as follows:
Pg k min Pg k Pg k max ,   k = 1 ,   2 ,   ,   Ng
Vg k min Vg k Vg k max ,   k = 1 ,   2 ,   ,   Ng
Qg k min Qg k Qg k max ,   k = 1 ,   2 ,   ,   Ng
Tap Tr min Tap Tr Tap Tr max ,   Tr = 1 ,   2 ,   ,   Nt
Qc VAR min Qc VAR Qc VAR max ,   VAR = 1 ,   2 ,   ,   Nq
VL j min VL j VL j max ,   j = 1 ,   2 ,   ,   NPQ
| S fl | S fl max ,   fl = 1 ,   2 ,   ,   Nf

4. Developed Solution-Based GTOT for OPFP in EPSs

The equality and inequality constraints are indeed considered while handling the stated OPFP problem. To satisfy the equality conditions that describe power flow balance models, the NRA is applied. It depicts the steady-state operation of electric grids and meets the balance constraints. Consequently, the NRA is used by MATPOWER and represents a key framework for demonstrating three-phase systems [45].

4.1. Improvement of GTOT for Incorporating Operational Limitations of Independent Variables

The operational limitations of independent variables of Equations (22)–(26) may be rewritten as follows:
Pg k = { Pg k min if   Pg k Pg k min Pg k max if   Pg k Pg k max ,   k = 1 ,   2 ,   ,   Ng
Vg k = { Vg k min if   Vg k Vg k min Vg k max if   Vg k Vg k max ,   k = 1 ,   2 ,   ,   Ng
Qg k = { Qg k min if   Qg k Qg k min Qg k max if   Qg k Qg k max ,   k = 1 ,   2 ,   ,   Ng
Tap Tr = { Tap Tr min if   Tap Tr Tap Tr min Tap Tr max if   Tap Tr Tap Tr max ,   Tr = 1 ,   2 ,   ,   Nt
Qc VAR = { Qc VAR min if   Qc VAR Qc VAR min Qc VAR max if   Qc VAR Qc VAR max ,   VAR = 1 ,   2 ,   ,   Nq
As shown, the variables continue to reach their limitations, and if one of these surpasses ratings, they are regenerated randomly inside the appropriate constraints.

4.2. Improvement of GTOT for Incorporating Operational Limitations of Dependent Variables

Moreover, the target cost objective expands and penalizes the second category’s limitations. Therefore, if the gorilla’s location exceeds any of the appropriate constraints, it would be discarded in the next round. Such concepts may be used to construct the contemplated objective (OJ), as shown in Equation (34).
OJ = OJ j + Pen 1 NPQ Δ V LL 2 + Pen 2 Nq Δ Q GG 2 + Pen 3 N f Δ S FF 2 ,   j = 1 , . m
where ΔVLL, ΔQGG, and ΔSFF are presented as:
Δ V LL = { V L min V L if   V L < V L min V L max V L if   V L > V L max
Δ Q GG = { Q G min Q G if   Q G < Q G min Q G max Q G if   Q G > Q G max
Δ S FF = S F max S F   if   S F > S F max
Figure 2 displays the stages of the designed GTOT for OPFP in EPSs.
On the other side, in order to handle the model of multi-objectives, the different objective functions can be augmented using the weighted sum approach as follows:
O J = w 1 O J 1 O J 1 max + w 2 O J 2 O J 2 max + w 3 O J 3 O J 3 max + w 4 O J 4 O J 4 max
where
i = 1 4 w i = 1

5. Simulation Results

The developed GTOT is implemented on the standard IEEE 30-bus EPS, a practical Egyptian EPS called West Delta-EPS (WD-EPS). Thirty simulation runs are conducted based on the developed GTOT with peak iterations of 300 and gorillas’ group of 25 members. The first EPS is depicted in Figure 3, which consists of 41 transmission lines, 30 buses, 4 tap changers, 6 generators, and 9 reactive power devices. The complete data of this EPS are extracted from [46]. The highest and minimum generator voltages are 1.1 and 0.95 p.u., respectively. The second EPS is described in Figure 4, which consists of 52 buses. The highest and lowest generator voltages are 1.06 and 0.94 p.u., respectively. The developed GTOT and various other innovative techniques were presented to minimize the fuel generation costs such as CST [47], SST, NBT [48], and ISHT. MatlabR2017b is utilized to carry out the simulations using CPU (2.5 GHz) Intel(R)-Core (TM) i7-7200U and 8 GB of RAM.

5.1. Results of the First EPS

For this EPS, six scenarios are examined:
  • Scenario 1: OJ1 minimization of FGCs described in Equation (16);
  • Scenario 2: OJ2 minimization of FGCSs described in Equation (17);
  • Scenario 3: OJ3 minimization of PE described in Equation (18);
  • Scenario 4: OJ4 minimization of OPL described in Equation (19);
  • Scenario 5: Merging OJ1 and OJ3 as a multi-objective function;
  • Scenario 6: Merging OJ1, OJ3, and OJ4 as a multi-objective function.

5.1.1. Scenario 1

For this scenario, the proposed GTOT is implemented, and the results are shown in Table 1. In this table, the values of the voltages of the six generators (Vg 1, Vg 2, Vg 5, Vg 8, Vg 11, and Vg 13) started at 1.05, 1.04, 1.01, 1.01, 1.05, and 1.05, respectively, and ended at 1.1, 1.088, 1.0619, 1.0696, 1.1, and 1.0, respectively. In addition to this, the values of four tap changer settings (Tap 6–9, Tap 6–10, Tap 4–12, and Tap 28–27) started at 1.0780, 1.0690, 1.0320, and 1.0680, respectively, and ended at 1.0551, 0.90, 0.99, and 0.9669, respectively. Additionally, the values of all nine reactive power devices (Qc 10, Qc 12, Qc 15, Qc 17, Qc 20, Qc 21, Qc 23, Qc 24, and Qc 29) started at 0 and ended at 5.0, 5.0, 5.0, 5, 4.4549, 4.978, 2.7861, and 5.0, respectively. Furthermore, the values of all six generators’ real power output (Pg 1, Pg 2, Pg 5, Pg 8, Pg 11, and Pg 13) started at 99.24, 80.0, 50.0, 20.0, 20.0, and 20.0, respectively, and ended at 177.0191, 48.7234, 21.2921, 21.0921, 11.8996, and 12.0, respectively. As demonstrated in this table, the proposed GTOT reduces FGCs from 901.96 USD/h to 799.0831 USD/h compared to the initial case. This decrease is a proportion of 11.406%. In addition, Figure 5 depicts the convergent characteristic of the proposed GTOT, where it obtains the optimal solution in a short time with the effectiveness and robustness of the solution.
For this Scenario, Table 2 includes the comparison of reducing FGCs with a variety of other approaches. As shown, the developed GTOT obtains the minimum FGCs of 799.0831 USD/h, among other techniques.

5.1.2. Scenario 2

Taking into account the valve point impact, the developed GTOT is used to reduce FGCSs. For this scenario, the regarding results are shown in Table 3. In this table, the values of the voltages of the six generators (Vg 1, Vg 2, Vg 5, Vg 8, Vg 11, and Vg 13) started at 1.050, 1.040, 1.010, 1.010, 1.050, and 1.050, respectively, and ended at 1.1000, 1.0809, 1.0550, 1.0653, 1.0999, and 1.1000, respectively. In addition to this, the values of four tap changer settings (Tap 6–9, Tap 6–10, Tap 4–12, and Tap 28–27) started at 1.0780, 1.0690, 1.0320, and 1.0680, respectively, and ended at 1.1000, 0.9203, 1.0595, and 0.9936, respectively. Additionally, the values of all nine reactive power devices (Qc 10, Qc 12, Qc 15, Qc 17, Qc 20, Qc 21, Qc 23, Qc 24, and Qc 29) started at 0 and ended at 5.0000, 4.994, 4.8523, 5.0000, 5.0000, 5.0000, 3.7342, 4.5993, and 2.8053, respectively. Furthermore, the values of all six generators’ real power output (Pg 1, Pg 2, Pg 5, Pg 8, Pg 11, and Pg 13) started at 99.2400, 80.0000, 50.0000, 20.0000, 20.0000, and 20.0000, respectively, and ended at 194.7610, 47.7489, 19.0111, 10, 10.0000, and 12.0014, respectively. As shown, the developed GTOT reduces the FGCSs from 901.9600 USD/h in the initial scenario to 832.7696 USD/h in the final scenario. This reduction in cost represents a percentage of 7.6700%. Additionally, Figure 6 displays the convergent characteristic of the proposed GTOT, where it obtains the optimal solution in a short time with the effectiveness and robustness of the solution.

5.1.3. Scenario 3

As demonstrated in Table 4, the designed GTOT minimizes the PEs in the third scenario. In this table, the values of the voltages of the six generators (Vg 1, Vg 2, Vg 5, Vg 8, Vg 11, and Vg 13) started at 1.0500, 1.0400, 1.0100, 1.0100, 1.0500, and 1.0500, respectively, and ended at 1.1000, 1.0961, 1.0784, 1.0859, 1.1000 and 1.1000, respectively.
In addition to this, the values of four tap changer settings (Tap 6–9, Tap 6–10, Tap 4–12, and Tap 28–27) started at 1.0780, 1.0690, 1.0320, and 1.0680, respectively, and ended at 1.0696, 0.9001, 0.9864, and 0.9731, respectively. Additionally, the values of all nine reactive power devices (Qc 10, Qc 12, Qc 15, Qc 17, Qc 20, Qc 21, Qc 23, Qc 24, and Qc 29) started at zero and ended at 4.9999, 4.9999, 5.0000, 5, 4.3098, 4.9999, 2.3956, and 5.0000, respectively. Furthermore, the values of all six generators’ real power output (Pg 1, Pg 2, Pg 5, Pg 8, Pg 11, and Pg 13) started at 99.2400, 80.0000, 50.0000, 20.0000, 20.0000, and 20.0000, respectively, and ended at 63.9480, 67.4323, 50.0000, 35.0000, 30.0000, and 40.0000, respectively. It is illustrated from this table that the obtained PE value is 0.2046 ton/h. In addition to this, Figure 7 depicts the convergence properties of the generated GTOT for Scenario 3, where it obtains the optimal solution in a short time with the effectiveness and robustness of the solution. Table 5 compares it to other metaheuristics optimization techniques. It is illustrated from the table the developed GTOT attains the minimum PE objective of 0.2046 ton/h. It outperforms the other metaheuristics that are shown in the mentioned table.

5.1.4. Scenario 4

The proposed GTOT achieves the minimizing of the OPLs in the fourth scenario, as shown in Table 6. In this table, the values of the voltages of the six generators (Vg 1, Vg 2, Vg 5, Vg 8, Vg 11, and Vg 13) started at 1.0500, 1.0400, 1.0100, 1.0100, 1.0500, and 1.0500, respectively, and ended at 1.1000, 1.0975, 1.0797, 1.0868, 1.1000, and 1.1000, respectively. In addition to this, the values of four tap changer settings (Tap 6–9, Tap 6–10, Tap 4–12, and Tap 28–27) started at 1.0780, 1.0690, 1.0320, and 1.0680, respectively, and ended at 1.0675, 0.9000, 0.9872, and 0.9728, respectively. Additionally, the values of all nine reactive power devices (Qc 10, Qc 12, Qc 15, Qc 17, Qc 20, Qc 21, Qc 23, Qc 24, and Qc 29) started at 0 and ended at 5.0000, 5.0000, 5.0000, 5.0000, 4.999, 5, 1.4887, 5.0000, and 2.2640, respectively. Furthermore, the values of all six generators’ real power output (Pg 1, Pg 2, Pg 5, Pg 8, Pg 11, and Pg 13) started at 99.2400, 80.0000, 50.0000, 20.0000, 20.0000, and 20.0000, respectively, and ended at 51.2525, 80.0000, 50.0000, 35.0000, 30.0000, and 40.0000, respectively. It is illustrated from the table the acquired value of OPLs is 2.8525 MW, whereas the value of OPLs is 5.8324 MW in the initial scenario. This reduction in cost represents a percentage of 51.09%. Additionally, Figure 8 depicts the convergent characteristic of the designed GTOT for Scenario 4, where it obtains the optimal solution in a short time with the effectiveness and robustness of the solution.

5.1.5. Stability Assessment of the Developed GTOT for the First EPS

To make a detailed evaluation of the stability of the developed GTOT for the first EPS, the obtained objectives of the thirty runs are recorded. For each scenario, the related average objective is calculated, and a graph is plotted to describe the percentage of every objective value to IndOJk, so the closeness of every run compared to the mean can be described. Figure 9 describes the obtained indicators of the related objective percentages via the developed GTOT.
Ind O J k = O J k 1 30 k = 1 30 O J k ,     k = 1 , 2 , m
As it can be observed from the figure, the developed GTOT always has the ability to find a close percentage to 100% where its mean is near to its minimum value. The highest percentage of the index is 100.085% in the first scenario, while it reached 101.1680% in the second scenario. For the third scenario, the maximum index percentage is 101.0400, while it reached 100.05% in the fourth scenario. This demonstrates the high stability of the developed GTOT for all scenarios. Additionally, Table 7 indicates the statistical data for the four scenarios. As manifested in this table, the best, mean, and worst values obtained by the developed GTOT are very close, which illustrates the robustness of the developed GTOT.
Moreover, other statistical indices are conducted on the four scenarios, which are standard deviation, standard error, |Best-Worst|, |Mean-Worst|, and |Best-Mean|. The standard deviations for the four scenarios are 0.214, 1.8636, 0.0001, and 0.0150, while the standard errors are 0.0390, 0.3402, 0.0001, and 0.0150. Additionally, another important index, which is |Best-Mean|, represents the difference between the best and mean values obtained by the proposed GTOT. The values of |Best-Mean| are 0.0156%, 0.0750%, 0.1665%, and 2.1139%. These statistical indices illustrate the effectiveness and robustness of the developed GTOT.

5.1.6. Scenario 5 and Scenario 6

In the fifth scenario, two different objective functions are considered for the minimization of both the FGCs and PE. In the sixth scenario, three different objective functions are considered for the minimization of FGCs, PE, and OPL. For both cases, the proposed GTOT is applied, and the optimal settings of the control variables and the regarding objectives are shown in Table 8. In this table, the values of FGCs and PE in the fifth scenario started at 901.9600 and 0.2390, respectively, and ended at 890.1029 and 0.2127, respectively, when applying the GTOT on this system. In addition to this, the values of FGCs, PE, and OPL in the sixth scenario started at 901.9600, 0.2390, and 5.8324, respectively, and ended at 895.4292, 0.2123, and 4.6529, respectively.
Additionally, Table 9 indicates the statistical data for the fifth and sixth scenarios. As manifested in this table, the best, mean, and worst values obtained by the developed GTOT are very close, which illustrates the robustness of the developed GTOT. Moreover, other statistical indices are conducted on the four scenarios, which are standard deviation, standard error, |Best-Worst|, |Mean-Worst|, and |Best-Mean|, that illustrate the effectiveness and robustness of the developed GTOT.
Additionally, Table 9 indicates the statistical data for the fifth and sixth scenarios. As manifested in this table, the standard deviations for the four scenarios are 0.0909 and 0.0043, while the standard errors are 0.0166 and 0.0008. Additionally, the values of |Best-Mean| obtained by the proposed GTOT are 1.4701% and 3.0743%. These statistical indices illustrate the effectiveness and robustness of the developed GTOT.

5.2. Results of the Second EPS

For this EPS, the three scenarios listed below are studied:
  • Scenario 7: OJ1 minimization described in Equation (16);
  • Scenario 8: OJ4 minimization described in Equation (19);
  • Scenario 9: Merging OJ1 and OJ4 as a multi-objective function.

5.2.1. Scenario 7

For this case, the designed GTOT is implemented, and the results are shown in Table 10. In this table, the values of the voltages of the eight generators (Vg 1, Vg 2, Vg 3, Vg 4, Vg 5, Vg 6, Vg 7, and Vg 8) started at 1 and ended at 1.0600, 1.0590, 1.0599, 1.0599, 1.0599, 1.0599, 1.0455, and 1.0517, respectively. In addition to this, the values of all eight generators’ real power output (Pg 1, Pg 2, Pg 3, Pg 4, Pg 5, Vg 6, Pg 7, and Pg 8) started at 85.6900, 157.4000, 139.3100, 113.6900, 166.4800, 31.7100, 92.000, and 122.4900, respectively, and ended at 189.5676, 10.0000, 214.6980, 180.4253, 10.0000, 234.0139, 56.3042, and 32.1957, respectively. As illustrated, the proposed GTOT reduces FGCs from 25,098.7000 USD/h to 22,953.42472 USD/h in comparison with the initial scenario. This decrease is a percentage of 8.54%. Furthermore, Figure 10 depicts the convergent characteristic of the proposed GTOT, where it obtains the optimal solution in a short time with the effectiveness and robustness of the solution.
For such a scenario, the created GTOT is contrasted to a number of other novel approaches used in this instance, as shown in Table 11. As can be observed, the produced GTOT beats all other strategies in terms of minimizing FGCs, with the developed GTOT obtaining the smallest FGCs of 22,953.4247 USD/h.

5.2.2. Scenario 8

The proposed GTOT achieves the minimizing of the OPLs in the eighth scenario, as shown in Table 12. In this table, the values of the voltages of the eight generators (Vg 1, Vg 2, Vg 3, Vg 4, Vg 5, Vg 6, Vg 7, and Vg 8) started at 1 and ended at 1.0595, 1.0600, 1.0600, 1.0600, 1.0600, 1.0600, 1.0600, and 1.0600, respectively. In addition to this, the values of all eight generators’ real power output (Pg 1, Pg 2, Pg 3, Pg 4, Pg 5, Vg 6, Pg 7, and Pg 8) started at 85.6900, 157.4000, 139.3100, 113.6900, 166.4800, 31.7100, 92.0000, and 122.4900, respectively, and ended at 60.4617, 58.8194, 180.6455, 130.7554, 117.9838, 105.4722, 156.5709, and 86.2761, respectively. The proposed GTOT, as demonstrated, reduces the OPLs from 19.0150 MW to 7.2353 MW compared with the initial scenario. This decrease reflects a 61.95 percent reduction. In addition, Figure 11 depicts the related convergent characteristic of the proposed GTOT for Scenario 8, where it obtains the optimal solution in a short time with the effectiveness and robustness of the solution.

5.2.3. Stability Assessment of the GTOT for the Second EPS

For this EPS, similarly, the obtained objectives of the thirty runs are recorded. For every scenario, the estimated indicators of the percentages of the objectives via the proposed GTOT are displayed in Figure 12.
As seen, the developed GTOT always has the ability to find close percentage to 100% where its mean is near to its minimum. For the first scenario, the highest indicator percent is 100.0000167%, while the minimum index percent is 99.9999%. The maximum index percent is 100.123%, while the minimum index percent is 99.9862%. This demonstrates the high stability of the developed GTOT for all scenarios.
Additionally, Table 13 indicates the statistical data for the seventh and eighth scenario. As manifested in this table, the standard deviations for the two scenarios are 7.3505 and 1.28 × 10−5 while the standard errors are 1.3420 and 2.33 × 10−6. Additionally, the values of |Best-Mean| obtained by the proposed GTOT are 0.0137% and 0.0002%. These statistical indices illustrate the effectiveness and robustness of the developed GTOT.

5.2.4. Scenario 9

The designed GTOT achieves the minimization of both the FGCs and OPL in the ninth scenario, as shown in Table 14. In this table, the values of FGCs and OPL in the ninth scenario have started with 25,098.7000 and 19.0150, respectively, and ended with 24,586.3700 and 7.3036, respectively.
In addition, Figure 13 depicts the convergent characteristic of the designed GTOT for Scenario 9, where it obtains the optimal solution in a short time with the effectiveness and robustness of the solution. Moreover, Table 15 indicates the statistical data for the ninth scenario. As manifested in this table, the standard deviation for this scenario is 1.9551E-08, while the standard error is 3.5696 × 10−9. Additionally, the value of |Best-Mean| obtained by the proposed GTOT is 3.4413 × 10−6%. These statistical indices illustrate the effectiveness and robustness of the developed GTOT.

6. Conclusions

In this paper, a methodology centered on the gorilla troops optimization technique (GTOT) is developed for optimal power flow problem (OPFP) in electrical power systems (EPSs). The assessment of the designed GTOT is carried out utilizing an IEEE specified 30 bus EPS and actual WD-EPS from Egypt. Nine different scenarios are evaluated, each with a different goal function of fuel expense, transmission losses, and harmful pollutants. Significant decreases in the objective goals are achieved for all tested circumstances. The main outcomes of this paper are developed as follows:
  • Multi-dimension objectives combining two and three objectives for both systems are developed in this work.
  • Their percentages of reduction for the single objectives are reached (11.406%, 7.67%, 14.39%, 51.09%, 8.54%, and 61.95%) for the six single objective scenarios in comparison to the initial circumstance.
  • The GTOT is employed in different evaluations and statistical analyses with many modern methods such as GWT, CST, SST, NBT, and ISHT.
  • The developed GTOT always has the ability to find a close percentage to 100% where its average is near to its minimum for both EPSs.
  • When developed GTOT compared to other similar approaches in the literature, the simulated results demonstrate the designed GTOT’s solution validity and stability.
  • The developed GTOT derives considerable stability for all scenarios.
Considering the high efficacy of the suggested algorithm in the OPFP application in this paper, it is preferred that the proposed algorithm be tested in the future for resolving the OPFP with high penetration of renewable energies in power grids. It may also be designed for AC-DC electrical systems with the incorporation of modern voltage source converters.

Author Contributions

Conceptualization, A.G. and R.E.-S.; Data curation, A.S. and A.E.; Formal analysis, A.S., R.E.-S., A.E. and H.T.D.; Funding acquisition, E.E.; Investigation, R.E.-S. and A.E.; Methodology, A.G.; Resources, A.G., E.E. and H.T.D.; Software, A.S.; Supervision, R.E.-S. and H.T.D. All authors have read and agreed to the published version of the manuscript.

Funding

Taif University Researchers Supporting Project number (TURSP-2020/86), Taif University, Taif, Saudi Arabia.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

List of Acronyms

AGTAdaptive GT
ARBTAdaptive real biogeography-based technique
AGSTAdaptive group search technique
BBOBiogeography-based optimization
BHBTBlack-hole-based technique
CBOAColliding bodies optimization algorithm
COACoyote optimization algorithm
CSSOChaotic salp swarm optimizer
CSTCrow search technique
DEDifferential evolution
DHSTDifferential harmony search technique
EMMElectromagnetism-like mechanism
EPSsElectrical power systems
EMRFTEnhanced manta ray foraging technique
EMSAEmended moth swarm algorithm
FGCsFuel generation costs
FGCSsFGC with sinusoids
GAGenetic algorithm
GTOTGorilla troops optimization technique
GTGrasshopper technique
GWTGrey wolf technique
HGWODEHybridization of GWT and DE
ICTImperialist competitive technique
IEOTImproved electromagnetism-like technique
IMFTImproved moth-flame technique
INSGA-IIIImproved non-dominated sorting genetic algorithm
ISHTImproved spotted-hyena technique
ISSTImproved social spider technique
IADEAdaptive differential evolution
JFSTJellyfish search technique
KHTKrill herd technique
MCSTModified crow search technique
NBTNovel bat technique
MRFTManta-ray foraging technique
MSTMoth swarm technique
OPFPOptimal power flow problem
OPLOverall power loss
PEProduced emissions
PSOParticle swarm optimization
QCMFTQuantum computing and moth flame technique
SAOSimulated annealing optimization
SOSTSymbiotic organisms search technique
SSTSalp swarm technique
TLTTeaching-learning technique
WCEMFTCombination of water cycle with moth flame technique
WDWest delta
WD-EPSWest Delta-EPS

List of Variables

ALevel of violence in a fight
XrThe current group position of gorilla
LLVariables’ minimum bound
X(g)Vector of gorilla location in the g iteration
GX(g + 1)Vector of gorilla location in the g + 1 iteration
rand, rd1, rd2, rd3Random values ranging from 0 to 1
PrMigrating coefficient
GXrCandidate group position of gorilla
ULVariables’ maximum bound
IterPresent iteration number
MaxIterMaximum iteration number
rd4Random value inside the bound [0:1]
lRandom values between −1 and 1
X(g)Vector of gorilla location
QForce of impact
rd5Random value within bound [0:1]
βPre-optimization value
EViolence efficacy
Vg1, Vg2, …, VgNg)Voltages of the generators
Tap1, Tap2, … TapNtTap changer settings
NtNumber of on-load tap changers
Qg1, Qg2, …, QgNgGenerator reactive power outputs
Pg1, Pg2, …, PgNgGenerators’ real power output
OJInvestigated vector of several m targets
OJ1Costs of fuel generation in dollars per hour
PgkReal power output in megawatts of generator
OJ2Costs of fuel generation with sinusoids
θPhase angle
GmnConductance of a line between buses m and n
QLPower consumption in its reactive components
GjkMutual conductance of line between bus j and k
VLjLoad voltage at bus j
OJjEach objective function
NRANewton–Raphson approach
Pen3Penalty coefficient for any violation in line flow
NgNumber of on-load generators
NqNumber of on-load reactive power sources,
SF1, …, SFNFTransmission flow limits
ZRandom values between [−c:c]
XsilverbackThe best solution which is the silverback
NPopulation of gorillas
ALevel of violence in a fight
VL1, …, VLNPQLoad bus voltage magnitudes
NPQThe number of load buses,
xIndependent variables
yDependent variables
mVector of several targets
k; Ck, Bk, and AkCost factors of generator k
NFNumber of transmission lines
Qc1, Qc2, …, QcNqReactive power injections of switching capacitors
P g k min Lowest limitation of generator k
Ek and FkGenerator k’s sinusoid cost factors
OJ3Produced ton/hr emissions from the power plants
γk, βk, αk, ξk, and λkEmission factors of generator k
NbNumber of buses
VVoltage
PLPower consumption in its active components
BjkMutual susceptance of a line between bus j and k
SflPower flow via line
Pen1Penalty coefficient for violation in load voltage
Pen2Penalty coefficient for violation in reactive power output from generators
IndOJkMean value

References

  1. Trivedi, I.N.; Jangir, P.; Parmar, S.A.; Jangir, N. Optimal Power Flow with Voltage Stability Improvement and Loss Reduction in Power System Using Moth-Flame Optimizer. Neural Comput. Appl. 2018, 30, 1889–1904. [Google Scholar] [CrossRef]
  2. Buch, H.; Trivedi, I.N.; Jangir, P. Moth Flame Optimization to Solve Optimal Power Flow with Non-Parametric Statistical Evaluation Validation. Cogent Eng. 2017, 4, 1286731. [Google Scholar] [CrossRef]
  3. 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]
  4. Montoya, O.D. A Convex OPF Approximation for Selecting the Best Candidate Nodes for Optimal Location of Power Sources on DC Resistive Networks. Eng. Sci. Technol. Int. J. 2020, 23, 527–533. [Google Scholar] [CrossRef]
  5. Bai, X.; Wei, H. A Semidefinite Programming Method with Graph Partitioning Technique for Optimal Power Flow Problems. Int. J. Electr. Power Energy Syst. 2011, 33, 1309–1314. [Google Scholar] [CrossRef]
  6. Dommel, H.W.; Tinney, W.F. Optimal Power Flow Solutions. IEEE Trans. Power Appar. Syst. 1968, PAS-87, 1866–1876. [Google Scholar] [CrossRef]
  7. Crisan, O.; Mohtadi, M.A. Efficient Identification of Binding Inequality Constraints in the Optimal Power Flow Newton Approach. IEE Proc. C Gener. Transm. Distrib. 1992, 139, 365–370. [Google Scholar] [CrossRef]
  8. Mota-Palomino, R.; Quintana, V.H. Sparse Reactive Power Scheduling by a Penalty Function-Linear Programming Technique. IEEE Trans. Power Syst. 1986, 1, 31–39. [Google Scholar] [CrossRef]
  9. Granelli, G.P.; Montagna, M. Security-Constrained Economic Dispatch Using Dual Quadratic Programming. Electr. Power Syst. Res. 2000, 56, 71–80. [Google Scholar] [CrossRef]
  10. Burchett, R.C.; Happ, H.H.; Vierath, D.R. Quadratically Convergent Optimal Power Flow. IEEE Trans. Power Appar. Syst. 1984, PAS-103, 3267–3275. [Google Scholar] [CrossRef]
  11. El-Sehiemy, R.A.; El Ela, A.A.A.; Shaheen, A. A Multi-Objective Fuzzy-Based Procedure for Reactive Power-Based Preventive Emergency Strategy. Int. J. Eng. Res. Afr. 2015, 13, 91–102. [Google Scholar] [CrossRef]
  12. Rahli, M.; Pirotte, P. Optimal Load Flow Using Sequential Unconstrained Minimization Technique (SUMT) Method under Power Transmission Losses Minimization. Electr. Power Syst. Res. 1999, 52, 61–64. [Google Scholar] [CrossRef]
  13. 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]
  14. Santos, A.; da Costa, G.R.M. Optimal-Power-Flow Solution by Newton’s Method Applied to an Augmented Lagrangian Function. IEE Proc. Gener. Transm. Distrib. 1995, 142, 33–36. [Google Scholar] [CrossRef]
  15. Yan, X.; Quintana, V.H. Improving an Interior-Point-Based off by Dynamic Adjustments of Step Sizes and Tolerances. IEEE Trans. Power Syst. 1999, 14, 709–716. [Google Scholar] [CrossRef]
  16. Yan, W.; Yu, J.; Yu, D.C.; Bhattarai, K. A New Optimal Reactive Power Flow Model in Rectangular Form and Its Solution by Predictor Corrector Primal Dual Interior Point Method. IEEE Trans. Power Syst. 2006, 21, 61–67. [Google Scholar] [CrossRef]
  17. Momoh, J.A.; Zhu, J.Z. Improved Interior Point Method for off Problems. IEEE Trans. Power Syst. 1999, 14, 1114–1120. [Google Scholar] [CrossRef]
  18. Reddy, S.S.; Bijwe, P.R. Efficiency Improvements in Meta-Heuristic Algorithms to Solve the Optimal Power Flow Problem. Int. J. Emerg. Electr. Power Syst. 2016, 17, 631–647. [Google Scholar] [CrossRef]
  19. Chaib, A.E.; Bouchekara, H.R.E.H.; Mehasni, R.; Abido, M.A. Optimal Power Flow with Emission and Non-Smooth Cost Functions Using Backtracking Search Optimization Algorithm. Int. J. Electr. Power Energy Syst. 2016, 81, 64–77. [Google Scholar] [CrossRef]
  20. 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. J. 2016, 42, 119–131. [Google Scholar] [CrossRef]
  21. Kumar, A.R.; 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]
  22. Basu, M. Modified Particle Swarm Optimization for Nonconvex Economic Dispatch Problems. Int. J. Electr. Power Energy Syst. 2015, 69, 304–312. [Google Scholar] [CrossRef]
  23. Singh, R.P.; Mukherjee, V.; Ghoshal, S.P. Particle Swarm Optimization with an Aging Leader and Challengers Algorithm for the Solution of Optimal Power Flow Problem. Appl. Soft Comput. J. 2016, 40, 161–177. [Google Scholar] [CrossRef]
  24. 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]
  25. Bouchekara, H.R.E.H.; Chaib, A.E.; Abido, M.A. Optimal Power Flow Using GA with a New Multi-Parent Crossover Considering: Prohibited Zones, Valve-Point Effect, Multi-Fuels and Emission. Electr. Eng. 2018, 100, 151–165. [Google Scholar] [CrossRef]
  26. El-Hana Bouchekara, H.R.; Abido, M.A.; Chaib, A.E. Optimal Power Flow Using an Improved Electromagnetism-like Mechanism Method. Electr. Power Compon. Syst. 2016, 44, 434–449. [Google Scholar] [CrossRef]
  27. Ghasemi, M.; Ghavidel, S.; Gitizadeh, M.; Akbari, E. An Improved Teaching-Learning-Based Optimization Algorithm Using Lévy Mutation Strategy for Non-Smooth Optimal Power Flow. Int. J. Electr. Power Energy Syst. 2015, 65, 375–384. [Google Scholar] [CrossRef]
  28. Ziane, I.; Benhamida, F.; Graa, A. Simulated Annealing Algorithm for Combined Economic and Emission Power Dispatch Using Max/Max Price Penalty Factor. Neural Comput. Appl. 2017, 28, 197–205. [Google Scholar] [CrossRef]
  29. Dabba, A.; Tari, A.; Meftali, S. Hybridization of Moth Flame Optimization Algorithm and Quantum Computing for Gene Selection in Microarray Data. J. Ambient Intell. Humaniz. Comput. 2020, 12, 2731–2750. [Google Scholar] [CrossRef]
  30. El-Ela, A.A.A.; El-Sehiemy, R.A.; Shaheen, A.M.; Ellien, A.R. Optimal Allocation of Distributed Generation Units Correlated with Fault Current Limiter Sites in Distribution Systems. IEEE Syst. J. 2020, 15, 2148–2155. [Google Scholar] [CrossRef]
  31. Bentouati, B.; Javaid, M.S.; Bouchekara, H.R.E.H.; El-Fergany, A.A. Optimizing Performance Attributes of Electric Power Systems Using Chaotic Salp Swarm Optimizer. Int. J. Manag. Sci. Eng. Manag. 2020, 15, 165–175. [Google Scholar] [CrossRef]
  32. Khalilpourazari, S.; Khalilpourazary, S. An Efficient Hybrid Algorithm Based on Water Cycle and Moth-Flame Optimization Algorithms for Solving Numerical and Constrained Engineering Optimization Problems. Soft Comput. 2019, 23, 1699–1722. [Google Scholar] [CrossRef]
  33. Pan, J.S.; Shan, J.; Chu, S.C.; Jiang, S.J.; Zheng, S.G.; Liao, L. A Multigroup Marine Predator Algorithm and Its Application for the Power System Economic Load Dispatch. Energy Sci. Eng. 2021. [Google Scholar] [CrossRef]
  34. Bai, Y.; Wu, X.; Xia, A. An Enhanced Multi-Objective Differential Evolution Algorithm for Dynamic Environmental Economic Dispatch of Power System with Wind Power. Energy Sci. Eng. 2021, 9, 316–329. [Google Scholar] [CrossRef]
  35. Bentouati, B.; Khelifi, A.; Shaheen, A.M.; El-Sehiemy, R.A. An Enhanced Moth-Swarm Algorithm for Efficient Energy Management Based Multi Dimensions OPF Problem. J. Ambient Intell. Humaniz. Comput. 2020, 12, 9499–9519. [Google Scholar] [CrossRef]
  36. Daryani, N.; Hagh, M.T.; Teimourzadeh, S. Adaptive Group Search Optimization Algorithm for Multi-Objective Optimal Power Flow Problem. Appl. Soft Comput. J. 2016, 38, 1012–1024. [Google Scholar] [CrossRef]
  37. Nguyen, T.T. A High Performance Social Spider Optimization Algorithm for Optimal Power Flow Solution with Single Objective Optimization. Energy 2019, 171, 218–240. [Google Scholar] [CrossRef]
  38. 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]
  39. Li, S.; Gong, W.; Wang, L.; Yan, X.; Hu, C. Optimal Power Flow by Means of Improved Adaptive Differential Evolution. Energy 2020, 198, 117314. [Google Scholar] [CrossRef]
  40. Warid, W.; Hizam, H.; Mariun, N.; Wahab, N.I.A. A Novel Quasi-Oppositional Modified Jaya Algorithm for Multi-Objective Optimal Power Flow Solution. Appl. Soft Comput. 2018, 65, 360–373. [Google Scholar] [CrossRef]
  41. Zhang, J.; Wang, S.; Tang, Q.; Zhou, Y.; Zeng, T. An Improved NSGA-III Integrating Adaptive Elimination Strategy to Solution of Many-Objective Optimal Power Flow Problems. Energy 2019, 172, 945–957. [Google Scholar] [CrossRef]
  42. Elattar, E.E.; Shaheen, A.M.; Elsayed, A.M.; El-Sehiemy, R.A. Optimal Power Flow with Emerged Technologies of Voltage Source Converter Stations in Meshed Power Systems. IEEE Access 2020, 8, 166963–166979. [Google Scholar] [CrossRef]
  43. 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]
  44. Ginidi, A.; Ghoneim, S.M.; Elsayed, A.; El-Sehiemy, R.; Shaheen, A.; El-Fergany, A. Gorilla Troops Optimizer for Electrically Based Single and Double-Diode Models of Solar Photovoltaic Systems. Sustainability 2021, 13, 9459. [Google Scholar] [CrossRef]
  45. Zimmerman, R.D. Matpower [Software]. Available online: https://Matpower.Org (accessed on 1 August 2021).
  46. Liu, Y.; Gong, D.; Sun, J.; Jin, Y. A Many-Objective Evolutionary Algorithm Using a One-by-One Selection Strategy. IEEE Trans. Cybern. 2017, 47, 2689–2702. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  47. Askarzadeh, A. A Novel Metaheuristic Method for Solving Constrained Engineering Optimization Problems: Crow Search Algorithm. Comput. Struct. 2016, 169, 1–12. [Google Scholar] [CrossRef]
  48. Horng, S.C.; Lin, S.S. Bat Algorithm Assisted by Ordinal Optimization for Solving Discrete Probabilistic Bicriteria Optimization Problems. Math. Comput. Simul. 2019, 166, 346–364. [Google Scholar] [CrossRef]
  49. Shaheen, A.M.; El-Sehiemy, R.A.; Elsayed, A.M.; Elattar, E.E. Multi-Objective Manta Ray Foraging Algorithm for Efficient Operation of Hybrid AC/DC Power Grids with Emission Minimisation. IET Gener. Transm. Distrib. 2021, 15, 1314–1336. [Google Scholar] [CrossRef]
  50. El-Sehiemy, R.; Elsayed, A.; Shaheen, A.; Elattar, E.; Ginidi, A. Scheduling of Generation Stations, OLTC Substation Transformers and VAR Sources for Sustainable Power System Operation Using SNS Optimizer. Sustainability 2021, 13, 11947. [Google Scholar] [CrossRef]
  51. Shaheen, A.M.; El-Sehiemy, R.A. Application of Multi-Verse Optimizer for Transmission Network Expansion Planning in Power Systems. In Proceedings of the International Conference on Innovative Trends in Computer Engineering ITCE 2019, Aswan, Egypt, 2–4 February 2019; pp. 371–376. [Google Scholar] [CrossRef]
  52. Taher, M.A.; Kamel, S.; Jurado, F.; Ebeed, M. An Improved Moth-Flame Optimization Algorithm for Solving Optimal Power Flow Problem. Int. Trans. Electr. Energy Syst. 2019, 29, e2743. [Google Scholar] [CrossRef]
  53. 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]
  54. Duman, S. Symbiotic Organisms Search Algorithm for Optimal Power Flow Problem Based on Valve-Point Effect and Prohibited Zones. Neural Comput. Appl. 2017, 28, 3571–3585. [Google Scholar] [CrossRef]
  55. Ghanizadeh, A.J.; Mokhtari, M.; Abedi, M.; Gharehpetian, G.B. Optimal Power Flow Based on Imperialist Competitive Algorithm. Int. Rev. Electr. Eng. 2011, 6, 4–12. [Google Scholar]
  56. Alhejji, A.; Hussein, M.E.; Kamel, S.; Alyami, S. Optimal Power Flow Solution with an Embedded Center-Node Unified Power Flow Controller Using an Adaptive Grasshopper Optimization Algorithm. IEEE Access 2020, 8, 119020–119037. [Google Scholar] [CrossRef]
  57. Bouchekara, H.R.E.H. Optimal Power Flow Using Black-Hole-Based Optimization Approach. Appl. Soft Comput. J. 2014, 24, 879–888. [Google Scholar] [CrossRef]
  58. Shaheen, A.M.; El-Sehiemy, R.A.; Elattar, E.E.; Abd-Elrazek, A.S. A Modified Crow Search Optimizer for Solving Non-Linear OPF Problem with Emissions. IEEE Access 2021, 9, 43107–43120. [Google Scholar] [CrossRef]
  59. 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]
  60. Jeddi, B.; Einaddin, A.H.; Kazemzadeh, R. A Novel Multi-Objective Approach Based on Improved Electromagnetism-like Algorithm to Solve Optimal Power Flow Problem Considering the Detailed Model of Thermal Generators. Int. Trans. Electr. Energy Syst. 2017, 27, e2293. [Google Scholar] [CrossRef]
  61. Yang, X.S. Bat Algorithm: Literature Review and Applications. Int. J. Bio-Inspired Comput. 2013, 5, 141–149. [Google Scholar] [CrossRef] [Green Version]
  62. Shaheen, A.M.; El-Sehiemy, R.A.; Ginidi, A.R.; Ghoneim, S.S.M.; Alharthi, M.M. Multi-Objective Jellyfish Search Optimizer for Efficient Power System Operation Based on Multi-Dimensional OPF Framework. Energy 2021, 237, 121478. [Google Scholar] [CrossRef]
  63. 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]
  64. Shabanpour-Haghighi, A.; Seifi, A.R.; Niknam, T. A Modified Teaching-Learning Based Optimization for Multi-Objective Optimal Power Flow Problem. Energy Convers. Manag. 2014, 77, 597–607. [Google Scholar] [CrossRef]
  65. Shaheen, A.M.; Elsayed, A.M.; El-Sehiemy, R.A.; Ghoneim, S.S.M.; Alharthi, M.M.; Ginidi, A.R. Multi-Dimensional Energy Management Based on an Optimal Power Flow Model Using an Improved Quasi-Reflection Jellyfish Optimization Algorithm. Eng. Optim. 2022, 1–23. [Google Scholar] [CrossRef]
Figure 1. Main steps of the GTOT.
Figure 1. Main steps of the GTOT.
Mathematics 10 01636 g001
Figure 2. Developed solution-based GTOT for OPFP in EPSs.
Figure 2. Developed solution-based GTOT for OPFP in EPSs.
Mathematics 10 01636 g002
Figure 3. IEEE 30-bus EPS [42,49].
Figure 3. IEEE 30-bus EPS [42,49].
Mathematics 10 01636 g003
Figure 4. Real WD-EPS [50,51].
Figure 4. Real WD-EPS [50,51].
Mathematics 10 01636 g004
Figure 5. Convergence feature of developed GTOT for Scenario 1.
Figure 5. Convergence feature of developed GTOT for Scenario 1.
Mathematics 10 01636 g005
Figure 6. Convergence feature of the developed GTOT for Scenario 2.
Figure 6. Convergence feature of the developed GTOT for Scenario 2.
Mathematics 10 01636 g006
Figure 7. Convergence feature of the developed GTOT for Scenario 3.
Figure 7. Convergence feature of the developed GTOT for Scenario 3.
Mathematics 10 01636 g007
Figure 8. Convergence feature of the developed GTOT for Scenario 4.
Figure 8. Convergence feature of the developed GTOT for Scenario 4.
Mathematics 10 01636 g008
Figure 9. Obtained objectives percentages by means of the designed GTOT.
Figure 9. Obtained objectives percentages by means of the designed GTOT.
Mathematics 10 01636 g009aMathematics 10 01636 g009b
Figure 10. Convergence feature of developed GTOT for Scenario 7.
Figure 10. Convergence feature of developed GTOT for Scenario 7.
Mathematics 10 01636 g010
Figure 11. Convergence feature of the developed GTOT for Scenario 8.
Figure 11. Convergence feature of the developed GTOT for Scenario 8.
Mathematics 10 01636 g011
Figure 12. Estimated objective percentages via the designed GTOT.
Figure 12. Estimated objective percentages via the designed GTOT.
Mathematics 10 01636 g012
Figure 13. Convergence feature of the developed GTOT for Scenario 9.
Figure 13. Convergence feature of the developed GTOT for Scenario 9.
Mathematics 10 01636 g013
Table 1. Simulation outcomes based on the designed GTOT for the first scenario.
Table 1. Simulation outcomes based on the designed GTOT for the first scenario.
VariablesInitialFirst Scenario
Voltage setting of the generators (p.u)Gen 11.05001.1000
Gen 21.04001.0880
Gen 51.01001.0619
Gen 81.01001.0696
Gen 111.05001.1000
Gen 131.05001.1000
Output powers of the generators (MW)Gen 199.2400177.0191
Gen 280.000048.7234
Gen 550.000021.2921
Gen 820.000021.0921
Gen 1120.000011.8995
Gen 1320.000012.0000
Tap setting of the transformers (p.u)Tr 6–91.07801.0551
Tr 6–101.06900.9000
Tr 4–121.03200.9900
Tr 28–271.06800.9668
Output reactive powers of the VAR sources ar buses (MVAr)Bus 100.00005.0000
Bus 120.00005.0000
Bus 150.00005.0000
Bus 170.00005.0000
Bus 200.00004.4549
Bus 210.00004.9780
Bus 230.00002.7861
Bus 240.00005.0000
Bus 290.00002.6571
Cost_Pg901.9600799.0831
Losses5.83248.6263
Table 2. Comparison for Scenario 1.
Table 2. Comparison for Scenario 1.
TechniqueFGCs (USD/h)TechniqueFGCs (USD/h)
Developed GTOT799.0831IMFT [52]800.3848
GWT [53]800.4330SOST [54]801.5733
TLT [27]800.4212ICT) [55]801.843
GT [56]800.9728DHST [57]802.2966
MCST [58]799.3332GA [41]802.1962
BHBT [57]799.9217AGT [56]800.0212
MST [59]800.5099CST [47] 799.8266
IEOT [60]799.688EMRFT [42]798.9888
NBT [61]799.7516JFST [62]799.1065
Table 3. Simulation outcomes based on the designed GTOT for the second scenario.
Table 3. Simulation outcomes based on the designed GTOT for the second scenario.
VariablesInitialSecond Scenario
Voltage setting of the generators (p.u)Gen 11.05001.1000
Gen 21.04001.0809
Gen 51.01001.0550
Gen 81.01001.0653
Gen 111.05001.0999
Gen 131.05001.1000
Output powers of the generators (MW)Gen 199.2400194.7610
Gen 280.000047.7489
Gen 550.000019.0111
Gen 820.000010.0000
Gen 1120.000010.0000
Gen 1320.000012.0014
Tap setting of the transformers (p.u)Tr 6–91.07801.1000
Tr 6–101.06900.9203
Tr 4–121.03201.0595
Tr 28–271.06800.9936
Output reactive powers of the VAR sources ar buses (MVAr)Bus 100.05.0000
Bus 120.04.9949
Bus 150.04.8523
Bus 170.05.0000
Bus 200.05.0000
Bus 210.05.0000
Bus 230.03.7342
Bus 240.04.5993
Bus 290.02.8053
Cost_Pg901.9600832.7696
Losses5.832410.1201
Table 4. Simulation outcomes based on the designed GTOT for the third scenario.
Table 4. Simulation outcomes based on the designed GTOT for the third scenario.
VariablesInitialThird Scenario
Voltage setting of the generators (p.u)Gen 11.05001.1000
Gen 21.04001.0961
Gen 51.01001.0784
Gen 81.01001.0859
Gen 111.05001.1000
Gen 131.05001.1000
Output powers of the generators (MW)Gen 199.240063.9480
Gen 280.000067.4323
Gen 550.000050.0000
Gen 820.000035.0000
Gen 1120.000030.0000
Gen 1320.000040.0000
Tap setting of the transformers (p.u)Tr 6–91.07801.0696
Tr 6–101.06900.9001
Tr 4–121.03200.9864
Tr 28–271.06800.9731
Output reactive powers of the VAR sources ar buses (MVAr)Bus 100.00004.9999
Bus 120.00004.9999
Bus 150.00005.0000
Bus 170.00005.0000
Bus 200.00004.3098
Bus 210.00004.9999
Bus 230.00002.3956
Bus 240.00005.0000
Bus 290.00002.3154
Cost_Pg901.9600943.5287
Losses5.83242.9803
Emissions0.23900.2046
Table 5. Comparison for Scenario 3.
Table 5. Comparison for Scenario 3.
TechniquePEs (tonne/h)TechniquePEs (ton/h)
Developed GTOT0.2046AGT [56]0.2048
Stud KHT [63]0.2048GT [56]0.2049
ARBT [21]0.2048Modified TLT [64]0.2049
KHT [63]0.2049EMRFT [42]0.2048
CST [58]0.2051NBT [58]0.2052
JFST [62]0.2047MCST [58]0.2049
Table 6. Simulation outcomes based on the designed GTOT for the fourth scenario.
Table 6. Simulation outcomes based on the designed GTOT for the fourth scenario.
VariablesInitialFourth Scenario
Voltage setting of the generators (p.u)Gen 11.05001.1000
Gen 21.04001.0975
Gen 51.01001.0797
Gen 81.01001.0868
Gen 111.05001.1000
Gen 131.05001.1000
Output powers of the generators (MW)Gen 199.240051.2525
Gen 280.000080.0000
Gen 550.000050.000
Gen 820.000035.0000
Gen 1120.000030.0000
Gen 1320.000040.0000
Tap setting of the transformers (p.u)Tr 6–91.07801.0675
Tr 6–101.06900.9000
Tr 4–121.03200.9872
Tr 28–271.06800.9728
Output reactive powers of the VAR sources ar buses (MVAr)Bus 100.00005.0000
Bus 120.00005.0000
Bus 150.00005.0000
Bus 170.00005.0000
Bus 200.00004.9999
Bus 210.00005.0000
Bus 230.00001.4887
Bus 240.00005.0000
Bus 290.00002.2640
Cost_Pg901.9600967.0722
Losses5.83242.8525
Table 7. Statistical data based on the designed GTOT for the 4 scenarios.
Table 7. Statistical data based on the designed GTOT for the 4 scenarios.
Statistical IndicesScenario 1Scenario 2Scenario 3Scenario 4
Best799.0831832.81440.20462.8525
Mean799.2081833.43940.20502.9128
Worst799.8904843.18960.20723.1655
Standard deviation0.21401.86360.00080.0824
Standard error0.03900.34020.00010.0150
|Best-Worst|0.1010%1.2458%1.2350%10.9711%
|Mean-Worst|0.0853%1.1698%1.0667%8.6738%
|Best-Mean|0.0156%0.0750%0.1665%2.1139%
Table 8. Simulation outcomes based on the designed GTOT for the fifth and sixth scenario.
Table 8. Simulation outcomes based on the designed GTOT for the fifth and sixth scenario.
VariablesInitialFifth ScenarioSixth Scenario
Voltage setting of the generators (p.u)Gen 11.05001.10001.0057
Gen 21.04001.09601.0045
Gen 51.01001.07711.0003
Gen 81.01001.08811.0111
Gen 111.05001.10001.0007
Gen 131.05001.05461.0018
Output powers of the generators (MW)Gen 199.24001.05531.0137
Gen 280.00001.10000.9097
Gen 550.00001.10000.9814
Gen 820.00001.10000.9741
Gen 1120.00006.243 × 10−95.0000
Gen 1320.00000.00005.0000
Tap setting of the transformers (p.u)Tr 6–91.07805.00005.0000
Tr 6–101.06904.62215.0000
Tr 4–121.03200.00005.0000
Tr 28–271.06805.00005.0000
Output reactive powers of the VAR sources ar buses (MVAr)Bus 100.00005.00005.0000
Bus 120.00005.00005.0000
Bus 150.00005.00004.9517
Bus 170.000082.132781.8371
Bus 200.000062.796862.4782
Bus 210.000037.461138.7375
Bus 230.000035.000035.0000
Bus 240.000030.000030.0000
Bus 290.000040.000040.0000
Cost_Pg901.9600890.1029895.4292
Losses5.83243.99064.6529
Emissions0.23900.21270.2123
Fitness1.00000.77050.6691
Table 9. Simulation outcomes of the designed GTOT for the fifth and sixth scenario.
Table 9. Simulation outcomes of the designed GTOT for the fifth and sixth scenario.
Statistical IndicesScenario 5Scenario 6
Best0.77050.6691
Mean0.78190.6896
Worst0.79140.7473
Standard deviation0.09090.0043
Standard error0.01660.0008
|Best-Worst|2.7057%11.6914%
|Mean-Worst|1.2176%8.3600%
|Best-Mean|1.4701%3.0743%
Table 10. Simulation outcomes based on the designed GTOT for the seventh scenario.
Table 10. Simulation outcomes based on the designed GTOT for the seventh scenario.
VariablesInitial Fifth Scenario
Voltage setting of the generators (p.u)Gen 11.00001.0600
Gen 21.00001.0599
Gen 31.00001.0599
Gen 41.00001.0599
Gen 51.00001.0599
Gen 61.00001.0599
Gen 71.00001.0455
Gen 81.00001.05173
Output powers of the generators (MW)Gen 185.6900189.5676
Gen 2157.40010.0000
Gen 3139.3100214.6980
Gen 4113.6900180.4253
Gen 5166.480010.0000
Gen 631.7100234.0139
Gen 792.000056.3042
Gen 8122.490032.1957
FGCs (USD/h)25,098.700022,953.4247
OPLs (MW)19.015037.4550
Table 11. Comparison for Scenario 7.
Table 11. Comparison for Scenario 7.
TechniqueFGCs (USD/h)TechniqueFGCs (USD/h)
Developed GTOT22,953.4247ISHT [65]22,958.7800
NBT [48]22,960.8100CST [47]22,959.3600
SST [65]22,965.5900MCST [47]22,955.5500
GWT [65]22,957.7200
Table 12. Simulation outcomes based on the designed GTOT for the eighth scenario.
Table 12. Simulation outcomes based on the designed GTOT for the eighth scenario.
VariablesInitialSixth Scenario
Voltage setting of the generators (p.u)Gen 11.00001.0595
Gen 21.00001.0600
Gen 31.00001.0600
Gen 41.00001.0600
Gen 51.00001.0600
Gen 61.00001.0600
Gen 71.00001.0600
Gen 81.00001.0600
Output powers of the generators (MW)Gen 185.690060.4617
Gen 2157.400058.8194
Gen 3139.3100180.6455
Gen 4113.6900130.7554
Gen 5166.4800117.9838
Gen 631.7100105.4722
Gen 792.0000156.5709
Gen 8122.490086.2761
FGCs (USD/h)25,098.700024,773.0865
OPLs (MW)19.01507.2353
Table 13. Simulation outcomes based on the GTOT for the seventh and eighth scenarios.
Table 13. Simulation outcomes based on the GTOT for the seventh and eighth scenarios.
Statistical IndicesScenario 7Scenario 8
Best22,953.42007.2353
Mean22,956.58007.2353
Worst22,984.94007.2353
Standard deviation7.35051.28 × 10−5
Standard error1.34202.33 × 10−6
|Best-Worst|0.1373%0.0003%
|Mean-Worst|0.1235%0.0001%
|Best-Mean|0.0137%0.0002%
Table 14. Simulation outcomes based on the designed GTOT for Scenario 9.
Table 14. Simulation outcomes based on the designed GTOT for Scenario 9.
VariablesInitialNinth Scenario
Voltage setting of the generators (p.u)Gen 11.00001.0600
Gen 21.00001.0600
Gen 31.00001.0600
Gen 41.00001.0600
Gen 51.00001.0599
Gen 61.00001.0600
Gen 71.00001.0599
Gen 81.00001.0600
Output powers of the generators (MW)Gen 185.690067.2453
Gen 2157.400051.3626
Gen 3139.3100183.2907
Gen 4113.6900133.4820
Gen 5166.4800108.3223
Gen 631.7100123.8325
Gen 792.0000148.2581
Gen 8122.490081.2601
FGCs (USD/h)25,098.700024,586.3700
OPLs (MW)19.01507.3036
Fitness1.00000.6818
Table 15. Simulation outcomes based on the designed GTOT for the seventh and eighth scenario.
Table 15. Simulation outcomes based on the designed GTOT for the seventh and eighth scenario.
Statistical IndicesScenario 9
Best0.6818
Mean0.6818
Worst0.6818
Standard deviation1.9551 × 108
Standard error3.5696 × 109
|Best-Worst|6.1814 × 106%
|Mean-Worst|2.7401 × 106%
|Best-Mean|3.4413 × 106%
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Shaheen, A.; Ginidi, A.; El-Sehiemy, R.; Elsayed, A.; Elattar, E.; Dorrah, H.T. Developed Gorilla Troops Technique for Optimal Power Flow Problem in Electrical Power Systems. Mathematics 2022, 10, 1636. https://doi.org/10.3390/math10101636

AMA Style

Shaheen A, Ginidi A, El-Sehiemy R, Elsayed A, Elattar E, Dorrah HT. Developed Gorilla Troops Technique for Optimal Power Flow Problem in Electrical Power Systems. Mathematics. 2022; 10(10):1636. https://doi.org/10.3390/math10101636

Chicago/Turabian Style

Shaheen, Abdullah, Ahmed Ginidi, Ragab El-Sehiemy, Abdallah Elsayed, Ehab Elattar, and Hassen T. Dorrah. 2022. "Developed Gorilla Troops Technique for Optimal Power Flow Problem in Electrical Power Systems" Mathematics 10, no. 10: 1636. https://doi.org/10.3390/math10101636

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