You are currently viewing a new version of our website. To view the old version click .
Energies
  • Article
  • Open Access

9 May 2023

Optimal Allocation and Size of Renewable Energy Sources as Distributed Generations Using Shark Optimization Algorithm in Radial Distribution Systems

,
,
and
1
Electrical Engineering Department, Faculty of Engineering, Jazan University, Jazan 45142, Saudi Arabia
2
Electric Power and Machine Department, Faculty of Engineering, Zagazig University, Zagazig 44519, Egypt
3
Computer Science Department, Faculty of Computer Science and Information Technology, Jazan University, Jazan 45142, Saudi Arabia
4
Electrical & Electronics Engineering Technology Department, Royal Commission Yanbu Colleges & Institutes, Yanbu Industrial City 46452, Saudi Arabia
This article belongs to the Special Issue Advanced Technologies in Renewable Energy Generation Systems

Abstract

The need for energy has significantly increased in the world in recent years. Various research works were presented to develop Renewable Energy Sources (RESs) as green energy Distributed Generations (DGs) to satisfy this demand. In addition, alleviating environmental problems caused by utilizing conventional power plants is diminished by these renewable sources. The optimal location and size of the DG-RESs significantly affect the performance of Radial Distribution Systems (RDSs) through the fine bus voltage profile, senior power quality, low power losses, and high efficiency. This paper investigates the use of PV (photovoltaic) and (Wind Turbine) WT systems as a DG source in RDSs. This investigation is presented via the optimal location and size of the PV and WT systems, which are the most used DG sources. This optimization problem aims to maximize system efficiency by minimizing power losses and improving both voltage profile and power quality using White Shark Optimization (WSO). This algorithm emulates the attitude of great white sharks when foraging using their senses of hearing and smell. It confirms the balance between exploration and exploitation to discover optimization that is considered as the main advantage of this approach in attaining the global minimum. To assess the suggested approach, three common RDSs are utilized, namely, IEEE 33, 69, and 85 node systems. The results prove that the applied WSO approach can find the best location and size of the RESs to reduce power loss, ameliorate the voltage profile, and outlast other recent strategies. Adding more units provides a high percentage of reducing losses by at least 93.52% in case of WTs, rather than 52.267% in the case of PVs. Additionally, the annual saving increased to USD 74,371.97, USD 82,127.257, and USD 86,731.16 with PV penetration, while it reached USD 104,872.96, USD 116,136.57, and USD 155,184.893 with WT penetration for the 33, 69, and 85 nodes, respectively. In addition, a considerable enhancement in the voltage profiles with the growth of PV and WT units was confirmed. The ability of the suggested WSO for feasible implementation was validated and inspected by preserving the restrictions and working constraints.

1. Introduction

Owing to being the cheapest and easiest to construct, radial distributed systems (RDSs) are frequently employed in sparsely populated areas. In these systems, a single power source provides electricity to many customers; yet, they have several drawbacks [1]. One of these disadvantages is that a power outage, short circuit, or damaged power line will cut off energy to the entire line and that power cannot be restored until it is rectified. Another drawback is the increasing power losses that would reduce the efficiency, which has a detrimental effect on the economy [2].
Using compensators is one of the primary remedies for these disadvantages [1,2,3,4]. Many compensators are used in RDSs to ameliorate voltage profile, improve power quality, reduce power loss, and increase the reserve of generation [3,4]. The principle of operation for these compensators is to support the reactive power of the system. Inserting some distributed generations (DGs), especially those that are based on renewable energy sources (RESs), is another important approach. DGs are distributed, flexible, and more adaptable technologies that are positioned near the load. They reduce the power transmitted through the transmission lines, which results in a reduction in the amount of power lost in the transmission lines and an increase in efficiency. One of the primary benefits of adopting DG-RESs is to provide customers with reliable, cost-effective, and environmentally friendly power [5].
RESs’ integration into the electrical grid has emerged as a critical remedy for the increasing load demand as well as environmental concerns. Many RESs were incorporated into the electrical grid, including Solar PV, wind, and fuel cells [6]. Using RESs as DG benefits the functioning of the electricity system in three ways: environmentally, economically, and technically [7,8]. Additionally, the quality of the distribution power systems may be improved by installing RESs in the appropriate place with a sufficient capacity, which can boost the voltage profile and reduce network power losses [8,9,10,11].
Studies have shown that integrating DGs in improper locations and with good sizes might cause a reverse flow of power toward the distribution substation. The system may experience overloads as a result, increasing system losses [12]. Several studies in this area have recently concentrated on proposing an optimal location and size of DG implantation methods. These studies focused on proposing an approach for selecting the optimal size of the DG in distribution systems, for example, novel power stability indexes [13], lowest voltage buses [14], most sensitive buses [15], and solving multi-objective functions [16]. Most of these works used some optimization techniques to solve the optimal location and size issues for DGs. Genetic Algorithm [17], Particle Swarm Optimization [18,19], Modified Bacterial Foraging Optimization [20], Bat Approach [21], Invasive Weed Optimization [22], Water Cycle Algorithm [23], Ant Colony Algorithm [24,25], Modified Teaching–Learning-based Optimization Algorithm [26], Hybrid Big Bang–Big Crunch Approach [27], Gray Wolf Optimization [28], Cuckoo Search Algorithm [29,30,31], Heuristic Methods [32], Chaotic Symbiotic Organisms Search Algorithm [33], and Marine Predators Optimizer [34] were introduced to deal with the DG placement process. Using three typical radial systems, IEEE 33 [35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51], 69 [52,53,54,55,56,57,58,59,60,61], and 85 [62,63,64,65] systems, these studies attempted to identify the optimum position and size of DGs in RDSs taking voltage support and minimal power losses into consideration. These studies were successful in determining the ideal position and size, while taking into consideration the voltage level and power losses. The option still exists to address this optimization problem using more recent optimization methods than those described in [35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65]. As a result, the current work presents a novel optimization approach for figuring out the best placement and size of DGs in RDSs, while taking into account reducing net losses and enhancing voltage profiles under all requirements and limitations for the optimization assignment. This new optimization approach is called White Shark Optimizer (WSO) [66,67].
WSO is one of the most recent nature-inspired algorithms that emulates the successful behavior of white sharks when foraging in the depths of the ocean to survive while depending on their senses of smell and hearing [68]. WSO has distinct advantages for optimization tasks, such as flexibility in dealing with various types of problems, simplicity, robustness, speed, and accuracy to find solutions [69]. It confirms its supremacy in various fields, which are addressed in [70,71,72,73]. The optimization of RESs via WSO has not been believed yet. This motivates us to promote WSO to handle this task. It is applied to detect the optimum allocations and capacity of DG in RDSs. The results of the WSO are compared with distinct algorithms to discover its notability in resolving the process of optimum allocations and the capacity of DGs, thus lowering the real power losses and attenuating the voltage profiles.
The contributions of this article are as follows:
  • The most advisable values of the weight factors of the developed objective function are discovered.
  • WSO as a successful optimization tool to handle the issue of the optimum position and size of PVs and WTs in RDSs is adopted to reduce power losses and reinforce the system voltage profile.
  • The economic charge is examined to find the power losses and net savings after placing the DGs in the standard IEEE 33, 69, and 85 point systems. Moreover, the voltage stability index (VSI) is inspected for all RDSs.
  • The sensibleness of the method for real implementation has been validated and investigated by calculation of the losses and voltage profile before and after installing the DG strategy with achieving the restrictions and working constraints.
This article is arranged as follows: the suggested WSO is discussed in Section 2; then, the developed objective function is addressed in Section 3; the outcomes and discussion are developed in Section 4, and finally, Section 5 presents the conclusion.

2. White Shark Optimizer

This section explains the proposed WSO mathematical models for foraging and prey-tracking. Although the senior white shark can mark prey in the depths of the ocean, there is no understanding of the position of the food resource in a specific investigation.

2.1. Inspiration

The WSO algorithm simulates the dynamic attitude of white sharks as they possess many intrinsic features. White sharks are among the most adaptable predators as they are distinguished hunters with powerful muscles, amazing eyesight, well-contrasted vision with a strong sense of smell, giant jaws, and sharp, pointed teeth. The shark ambushes its prey and tries to dash its prey using sudden and powerful deadly blows. Great white sharks adopt collective behavior when hunting prey using their distinct swimming methods and senses, such as smelling the odor of their prey and good hearing.

2.2. Track Victim

White sharks, similar to any living creature, roam the ocean looking for prey and change their positions according to the location of their prey using all their senses to track and locate them. Figure 1 shows some of their combined and integrated senses.
Figure 1. Various white shark’s senses.
First, great white sharks possess an amazing sense of hearing that they utilize to explore large spaces when looking for prey using their strong sense of smell to scout the whole zone and every potential location of the victim [66,67,68,69,70].

2.3. Exploration

Great white sharks use their unfamiliar sense of hearing to search for prey in large areas, as they hear through the two sidelines along their bodies. These duo lines may distinguish any variations in the water pressure as evidence of the prey’s movements. The water pressure changes caused by the turbulence created by prey attract the sharks’ attention to swim towards it. Sharks possess organs that detect the tiny electromagnetic fields generated by the locomotion of prey taking into account the speed and drift of the waves during their turbulent movements, so they can accurately detect the site of the prey in addition to its size. Then, the shark moves towards the prey in an undulating movement that can be represented by the following arithmetical formulation [66]:
v = x f
where v is the wave motion speed, x is the wavelength that indicates the distance covered in an undulating motion that a white shark travels to complete a whole revolution, and f symbolizes the frequency of the wave activity that equals the inverse of the number of revolutions per second.

2.4. Exploitation

Great white sharks use their strong sense of smell to explore possible places in their field to find prey, and when the white shark approaches its victim, its sense of smell functions in an exceptional manner. When the shark approaches, its sense of smell develops exponentially to precisely determine the location of its prey; the following constant acceleration motion equation may be employed [66]:
x = x i + v i Δ t + 1 2 a ( Δ t ) 2
where x is the updated white shark location, x i is the initial location, v i is the premier velocity, Δ t is the time interval between the new and initial white shark locations, and a is a fixed acceleration factor.
Most prey leave behind their scent after leaving a location; therefore, great white sharks cannot find their prey when this smell is present. They must randomly search nearby and distant areas using their distinct senses, such as sight, hearing, and smell [70,71,72,73].

2.5. Algorithm Steps

White sharks must search the ocean depths on a large scale to locate their prey using three behaviors:
(1) Their activity toward their prey depends on the frequency of the waves that occur due to the turbulent motion caused by the prey, taking advantage of the senses of hearing and smell.
(2) Randomly seeking prey in the depths of the ocean, where great white sharks’ move toward the location of prey while remaining close to it.
(3) The attitude of the white shark in determining the nearest prey.
The great white shark employs a school-fish attitude and moves toward the closest ideal prey.

2.6. Initialization of WSO

The approach starts by assuming a random set of initial solutions at the beginning of the used optimization process as a population-based approach. The population size of n white sharks where each white shark location indicates an elected solution is expressed by Equation (3) [66]:
ω = [ ω 1 1 ω 2 1 ω d 1 ω 1 2 ω 2 2 ω d 2 ω 1 n ω 2 n ω d n ]
where ω represents the site of white sharks in the inspection area, d defines a variable number for the process, and ω d i assigns the site of the i t h white shark in the d t h dimension. The premier population is determined by the following equation [72]:
ω j i = l j + r × ( u j l j )
where ω j i is the i t h white shark in j t h , u j and l j symbolize the superior and minimal limits of the inspection area in the j t h size, and r is a random value in [0–1].
The benefit of every elected solution for every novel white shark position was evaluated based on the fitness charge function. If the location was better than the current one, the current location was renewed, unless the white shark stayed in its location.

2.7. Movement Speed toward Prey

The survival instinct of white sharks makes them spend most of their time tracking and hunting prey using all methods of hunting based on their unusual senses, such as hearing, sight, and smell. The white shark locates its prey based on the frequency of the waves caused by the prey while moving; the white shark exhibits an undulating movement towards the prey represented by the following formula [72]:
v k + 1 i = μ [ v k i + p 1 ( ω g b e s t k ω k i ) × c 1 + p 2 ( ω b e s t v k i ω k i ) × c 2 ]
where i = 1 , 2 , . . , n , is the index of white sharks for n populations, v k + 1 i is the i t h white shark’s new speed vector in the ( k + 1 ) t h step, v k i is the i t h white shark’s actual speed vector in the k t h step, ω g b e s t k is the comprehensive best location vector observed at a great distance by any white shark in the k t h generation, ω k i is the i t h white shark’s actual location vector in the k t h step, ω b e s t v k i is the i t h best discovered location vector marked for the herd, and v i is the i t h index vector of the white sharks with a superior location, as in Equation (6), where c 1 and c 2 are regularly random values with the domain [0–1]; p 1 and p 2 are the white shark’s values that control ω g b e s t k and ω b e s t v k i , as shown in Equations (7) and (8), μ is the shrinkage agent used to analyze the white shark’s convergence attitude, as in Equation (9).
v = [ n × r a n d ( 1 , n ) ] + 1
where r a n d ( 1 , n ) is a regularly random vector with the domain [0–1].
p 1 = p m a x + ( p m a x p m i n ) × e ( 4 k / K ) 2
p 2 = p m i n + ( p m a x p m i n ) × e ( 4 k / K ) 2
where k and K are the instant and supreme generations, respectively, p m i n and p m a x are the initial and dependent velocities for the perfect movements of the white sharks. The amounts of p m i n and p m a x are set as 0.5 and 1.5, respectively [72].
μ = 2 | 2 τ τ 2 4 τ |
where τ is the acceleration value that is set to be 4.125 [72].

2.8. Movement toward Optimum Kill

Great white sharks spend a great amount of their time locating their prey, and when the motion of the waves is caused by their prey or if they smell it, they head towards it; however, in some cases, the prey vacates its site, leaving behinds its smell, and then the white shark moves randomly, according to the following formula [72,73]:
ω k + 1 i = { ω k i ¬ ω o + u a + l b ;     r a n d < m v ω k i + v k i / f ;     r a n d m v
where ω k + 1 i is the new vector location of the i t h white shark in the ( k + 1 ) t h generation, ¬ is a negation operator, and a and b are presented in Equations (11) and (12) as one-dimensional binary vectors. l and u are the minimum and maximum limits of the search era. ω o is defined as a logical vector, as presented by Equation (13). is a bitwise XOR operation. The frequency of the wave movement f is defined by Equation (14). r a n d is a random value with the domain [0–1]; m v is the motion force that increases with iterations and is defined by Equation (15) [72].
a = s g n ( ω k i u ) > 0
b = s g n ( ω k i l ) > 0
ω o = ( a , b )
f = f m i n + f m a x f m i n f m a x + f m i n
where f m i n and f m a x are the lower and superior frequencies of the wave movement, and are taken as 0.07 and 0.75, respectively, after testing [72,73].
m v = 1 ( a 0 + e ( K / 2 k ) / a 1 )
where a 0 and a 1 are positive values that represent the exploration and exploitation of nature [72].

2.9. Motion toward the Great White Shark

A great white shark’s location close to its prey is evaluated by the following equation [66]:
ω k + 1 i = ω g b e s t k + r 1 D ω s g n ( r 2 0.5 )     r 3 < S s
where ω k + 1 i is the new i t h white shark’s location regarding the prey, s g n ( r 2 0.5 ) indicates either 1 or −1 for the search direction, the parameters r 1 ,   r 2 ,   and   r 3 are random values that fill in [0, 1], D ω is the distance between white shark and its prey and is presented in Equation (17), and S s indicates the strength of the senses of sight and smell, which are realized as displayed in Equation (18) [72,73].
D ω = | r a n d × ( ω g b e s t k ω k i ) |
where ω k i is the white shark’s current location regarding ω g b e s t k .
S s = | 1 e ( a 2 × k / K ) |
where a 2 is a positive value that represents the exploration and exploitation factors and is taken as 0.0005 [72].

2.10. Fish-School Attitude

To imitate the nature of the school of white sharks, the first two optimal resolutions were maintained, and then the location of the other white sharks was updated regarding the best locations, according to the following formula [66]:
ω k + 1 i = ω k i + ω k + 1 i 2 × r a n d
Equation (19) shows that white sharks position themselves in accordance with the best site, very close to the prey. The great white sharks reach their location and thus the best position of the great white sharks is somewhere within the investigation zone, very close to the optimum prey. The flowchart of the WSO is shown in Figure 2.
Figure 2. Flowchart of WSO.

3. Objective Charge Function

The developed objective charge function was exercised to reduce the power losses and to improve the voltage profiles and VSIs. The DG sites and their capacities can be found optimally by resolving the subsequent objective charge function [10]:
F t = w 1 o f 1 + w 2 o f 2 + w 3 o f 3
where o f 1 displays the minimization in real losses, and it can be realized as shown in the subsequent equation:
o f 1 = i = 1 L ( P L i n e l o s s ( i ) ) a f t e r D G i = 1 L ( P L i n e l o s s ( i ) ) b e f o r e D G
o f 2 offers the refinement of the voltage profiles and it may be extracted using the following equation:
o f 2 = i = 1 N | V i V i , r e f | a f t e r D G i = 1 N | V i V i , r e f | b e f o r e D G
o f 3 presents the amelioration of the VSI. Then, it can be addressed as:
o f 3 = 1 V S I ( k ) a f t e r D G
where the VSI is organized as Equation (2):
V S I ( k ) = | V i | 4 4 ( P k X i k Q k R i k ) 2 4 ( P k R i k + Q k X i k ) | V i | 2
w 1 , w 2 , and w 3 are weighting factors. The sum of the weights specific to all sharks can add up to one [10], as can be observed in the following equation:
w 1 + w 2 + w 3 = 1
To provide the most suitable values of three weighted parameters, various settings for these parameters were obtained, where w 1 should be greater than w 2 and w 3 , as discussed in [42]. The most appropriate values of these parameters were discovered by installing a single DG in a 33-node RDS, and then the optimization process via WSO was performed. The results for various weighting parameters and the corresponding values of the cost function are presented in Table 1. The best cost function was found when the weighting parameters were 0.5, 0.1, and 0.4. This result is proven, compared with the setting in [42]. Therefore, these values were used for all the systems in this study.
Table 1. Effect of various values of the weighting parameters in Equation (20).

3.1. Equality and Inequality Restrictions

Equation (20) is optimized while achieving the following equality and inequality restrictions.

3.1.1. Equality Restriction

Power-conservation restrictions
The algebraic expression for the incoming and outgoing power flows over the RDSs could be equalized [10]; thus:
P S w i n g + i = 1 N D G P D G ( i ) = i = 1 L P L i n e l o s s ( i ) + q = 1 N P d ( q )
Q S w i n g + i = 1 N D G Q D G ( i ) = i = 1 L Q L i n e l o s s ( i ) + q = 1 N Q d ( q )

3.1.2. Inequality Restrictions

Voltage restriction
The rate of voltage at every node must be restricted by the following Equation:
V m i n | V i | V m a x
where V m i n , V m a x are considered as 0.90 and 1.05 p.u, respectively, as specified in [3,4].
DG limit restrictions
To prohibit an inverse power flow, the installed size of DGs in the grid were restricted so as not to exceed the power provided by the substation [10].
i = 1 N D G P D G ( i ) 3 4 × [ i = 1 L P L i n e l o s s ( i ) + q = 1 N P d ( q ) ]
i = 1 N D G Q D G ( i ) 3 4 × [ i = 1 L Q L i n e l o s s ( i ) + q = 1 N Q d ( q ) ]
P D G m i n P D G ( i ) P D G m a x
Q D G m i n Q D G ( i ) Q D G m a x
Line Capacity Restriction
The power of any line should be less than its rating amount, as shown by Equations (1) and (2)
S L i S L i ( r a t e d )

4. Outcomes and Discussion

The superiority of the developed WSO was investigated for distinct RDSs. The outcomes of 33, 69, and 85 bus RDSs are discussed in detail, below. The developed approach was executed via MATLAB.

4.1. The 33-Node Test System

The first studied case through WSO was a 33-node system. Figure 3 displays the schema of the system that contains prime feeders and three sides. This system possesses a net demand of 3720 kW and 2300 kVar at a voltage scale of 12.66 kV. The superiority of the developed WSO to detect the best allocations and capacity of PVs and WTs was proved, compared to those found in [35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51]. Table 1 explains the influences of establishing various figures of PVs and WTs on system attitudes.
Figure 3. IEEE 33-node distribution grid.
In Figure 4, the voltage profile is promoted after using the developed WSO to obtain the optimum placements and capacities of PVs and WTs. It was clear that the power loss, percentage reduction, yearly savings, charge of losses, and VSIs improved by increasing the number of DGs, as presented in Table 2. If the energy loss charge of USD 0.06 was selected in the investigation, the cost of losses and annual energy savings were USD 54,027.212 and USD 56,863.87 via the suggested WSO by the penetration of 2600 kW for bus 6, while they were USD 34,238.95 and USD 76,652.129 for 2550 kVA with a power factor of 0.825. Additionally, the results are better for the WT rather than PV penetration due to the attainability of reactive power generation, as presented in Table 2.
Figure 4. Voltage profiles of the 33-node grid for various values of DGs.
Table 2. Outcomes for the 33-node grid.

4.1.1. Outcomes for Establishing 1 Unit in the 33-Node Grid

For a single DG establishment, the optimum siting and capacity were obtained using WSO, as presented in Table 3. Node 6 is the best site for PV establishment with a capacity of 2600 kW, while a capacity of 2550 kVA with a p.f of 0.825 was required for the WT establishment. The power losses were diminished to 102.7915 kW with a percentage reduction of 51.28%, and the lower voltage exceeded from 0.9134 to 0.9525 p.u using PV. Additionally, much better results were obtained using a WT rather than PV. The cost of losses and annual savings for both the PV and WT are presented in Table 2. The developed WSO can discover less power losses than other algorithms [35,36,37,38,39,40,41,42,43] from 0.2615 to 39.5485 kW. Likewise, the corresponding values represented the enhancement level from 0.2537% to 27.78% for the PV-type system. Furthermore, these values ranged from 2.6874 to 16.2874 kW and the corresponding values represent the enhancement level from 3.96% to 20% for the WT-type system, as compared with [41,42,44]. Additionally, the effect of DGs establishing voltage profiles is introduced in Figure 4.
Table 3. Outcomes for establishing 1 DG in the 33-node grid.

4.1.2. Outcomes for Establishing Two DGs in the 33-Node System

The validation of the suggested WSO for searching the optimum site and capacity of DGs with two units of penetration was inspected. Nodes 13 and 30 were the best sites for the DG composition. The power losses were reduced to 82.6 kW with a percentage of 60.85%, and the lower voltage increased to 0.9732 p.u for the PV with capacities of 850 and 1191.1 kW, respectively. Additionally, inserting two WTs with capacities of 945 and 1550 kVA with p.f values of 0.9 and 0.73, respectively, reduced losses to 28.4 kW with a percentage of 86.54%, and the lower bus voltage increased to 0.9803 p.u. The yearly savings were USD 67,476.52 and USD 95,964.04 for the PV and WT, respectively, as recorded in Table 2. Moreover, the suggested approach provided the best outcomes in terms of power loss, reduced percentage of losses, and lower voltages, as compared to [35,36,38,42,43,44], as shown in Table 4. Furthermore, the effect of the composition of two PVs and WTs on the voltage profiles is presented in Figure 4.
Table 4. Outcomes for establishing 2 units in the 33-node grid.

4.1.3. Outcomes for Establishing Three DGs in 33-Node System

The efficacy of the suggested WSO for detecting the optimum siting and capacity of DGs for three locations of PVs and WTs was investigated. Nodes 13, 24, and 30 were the best locations for the DG compositions. With capacities of 790, 1070, and 1080 kW for the PV-type system, the power losses were reduced to 69.4808 kW with a percentage of 67.068%. With capacities of 800, 1100, and 1200 kVA for the WT-type system with p.f values of 0.88, 0.9, and 0.73, respectively, the power losses were reduced to 11.45 kW with a percentage of 94.57%, which was much better than the PV installation. The yearly savings were USD 104,872.96 for the WT, which was better than USD 74,371.9715 for the PV system, as presented in Table 2. The lower voltage increased to 0.985 p.u with the WT, while it was 0.9726 p.u with the PV system. Moreover, the suggested approach produced the best outcome in terms of reducing power loss, improving the percentage of losses, and enhancing lower voltages, as recorded in Table 5, compared to [42,43,44,45,46,47,48,49,50,51]. Furthermore, the effect of DG installations on the voltage profiles is presented in Figure 4.
Table 5. Outcomes for establishing three DGs in 33-node grid.

4.2. Simulation Results for the IEEE-69 Bus RDS

The second studied case via the WSO approach was a 69-bus system. Figure 5 displays the system graph that consists of major feeders and seven branches. This system has a net load of 3800 kW and 2690 kVAr at 12.6 kV. It is clear that the power loss reduced while the percentage reduction, yearly saving, voltage, and VSI improved with increasing numbers of DGs, as presented in Table 6. Additionally, the systems with WT penetrations presented superior results than with the PV penetration, due to the use of both active and reactive powers.
Figure 5. IEEE 69-node distribution grid.
Table 6. Outcomes for the 69-node grid.

4.2.1. Outcomes for Establishing One DG in the 69-Node Grid

For a single DG composition, the optimal allocation and capacity were obtained via the WSO. Table 6 summarizes the developed outcomes for installing a single DG. Node 61 was the best site for the DG composition. With a capacity of 1890 kW for the PV-type system, a reduction in the real power losses to 81.5033 kW occurred, which indicated a 63.766% reduction. The yearly saving was USD 75,390.325 and the minimum voltage increased to 0.9685 p.u. For the WT-type system with a capacity of 2250 kVA with a p.f of 0.82, the power loss decreased to 23.1551 kW with educed reduction to 89.7%, a net saving of USD 106,058.14, and a voltage lowered to 0.9718 p.u, as reported in Table 6. Additionally, the developed WSO presented better outcomes in terms of power losses and the percentage minimizations of power losses, as recorded in Table 7, compared to [35,42,43,44,52,53,54,55,56,57,58]. Furthermore, the effect of the DG composition on the voltage profiles is presented in Figure 6.
Table 7. Outcomes for establishing one DG in the 69-node grid.
Figure 6. Voltage profile of the 69-node grid.

4.2.2. Outcomes for Establishing Two DGs in the 69-Node Grid

For two DG compositions, the optimal site and capacity were achieved by the WSO, as shown in Table 8. Nodes 17 and 61 were the best sites for PV compositions with capacities of 525 and 1775 kW, respectively. The power loss reduced to 70.4556 kW, with a percentage minimization of 68.678%. For WTs with capacities of 680 and 1795 kVA and p.f values of 0.83 and 0.814, respectively, the power loss reduced to 6.98 kW with percentage losses of 96.89%. The yearly savings increased to USD 81,196.996 and USD 114,559.77 and the lower voltage was updated to 0.9828 p.u and 0.9851 for PVs and WTs, respectively, as displayed in Table 6. Additionally, the developed WSO discovered less power losses than the others presented in Table 8, increasing from 0.2944 to 13.7774 kW. Likewise, the corresponding values enhanced from 0.4161% to 16.356% for the PV-type system. Moreover, these values ranged from 0.21 to 16.25 kW, and the corresponding values enhanced from 2.92% to 69.8% for the WT-type system. Furthermore, the effect of DG penetration on the voltage profiles is presented in Figure 6.
Table 8. Outcomes for establishing two DGs in the 69-node grid.

4.2.3. Outcomes of the 69-Bus System and Three DGs

The optimum site and capacity values were obtained using WSO, as seen in Table 9, for three DG installations. Nodes 11, 17, and 61 were the best sites for DG compositions with sizes of 480, 380, and 1740 kW for PV and 528, 527, and 1800 kVA with p.f values of 0.81, 0.83, and 0.814 for WTs. The power losses decreased to 68.6857 and 3.98 kW, with percentage increases of 69.465% and 98.23% for PVs and WTs, respectively. The yearly saving increased to USD 82,127.257 and USD 116,136.57 and the lower voltage was updated to 0.9836 and 0.9878 p.u for PVs and WTs, respectively, as presented in Table 6. Compared with [42,43,44,45,46,47,48,49,59,60,61], WSO produces better outcomes in terms of power losses and the percentage attenuation of power, as indicated in Table 9. Furthermore, the effect of DG compositions on voltage profiles is presented in Figure 6.
Table 9. Outcomes for establishing three DGs in the 69-node system.

4.3. The 85-Node Test System

Figure 7 presents a graph of the 85-bus system. The loss without compensation was 315.714 kW. The lower voltage was 0.8743 p.u. at node 54. The yearly charge was calculated as USD 165,939.3. The optimal locations, sizing of the PVs and WTs, minimum voltage, VSI, cost of losses, and yearly savings are presented in Table 10 for various numbers of PVs and WTs. It was obvious that the power loss, percentage reduction, annual saving, voltage, and VSI improved with increasing the numbers of PVs and WTs, as presented in Table 10. Additionally, the level of enhancement was better in the case of WT penetration than the PV due to the generation of complex power. Table 11 shows a comparison between the developed algorithm and other recent works. It is clear that the implementation of WSO is more distinguished in solving the studied optimization process, compared with [43,62,63,64,65]. Furthermore, the effects of DG compositions on voltage profiles are presented in Figure 8.
Figure 7. The graph of the 85-node grid.
Table 10. Outcomes for the 85-node grid.
Table 11. Outcomes for establishing various DGs in the 85-node grid.
Figure 8. Voltage profile of the 85-node grid.

5. Conclusions

In this article, the WSO was applied successfully to obtain the optimal site and capacity of DGs in distinct RDSs. The process was designed as an optimization case concerned with power losses, voltage profiles, and VSIs. The outcomes were compared to those found using other approaches. The main conclusions of this paper were:
  • A multi-objective function was developed with an accurate choice of weighting factors to reduce the net power losses and improve the voltage profiles and VSIs of various RDSs.
  • WT installation provides much better results compared with PVs.
  • As the number of penetrated DGs was increased to three units, the percentages of power losses increased to 94.57%, 98.23%, and 93.52% for WTs, while these percentages were 67.068%, 69.465%, and 52.267% for PVs for 33, 69, and 85, respectively.
  • With the increasing number of penetrated DGs, the rate of improvement in the percentage of loss reductions decreased. These rates were 63.766, 4.912, and 0.787 for PV, which was less than 89.7, 7.19, and 1.34, respectively, for WTs used for the 69-node system.
  • The notability of WSO was assured, compared to other recent studies, in terms of power losses. The enhancement reached 27.78%, 70%, and 39.27% for the three used systems.
The implementation of the developed approach to considerable-level RDSs with other RESs and unbalanced systems is the future concern of this study.

Author Contributions

Methodology, E.S.A.; software, S.M.A.E. and S.H.H.; validation, M.I.M. and S.M.A.E.; formal analysis, E.S.A. and S.H.H.; investigation, E.S.A., M.I.M. and S.M.A.E.; writing—original draft, E.S.A. and S.M.A.E.; writing—review and editing, M.I.M. All authors have read and agreed to the published version of the manuscript.

Funding

The authors declare no funding.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

Abbreviations

DGDistributed Generation
WSOWhite Shark Optimization
PVPhotovoltaic
WTWind Turbine
GAGenetic Approach
PSOParticle Swarm Optimization
EVPSOEscape Velocity Particle Swarm Optimization
PSOPCParticle Swarm Optimization with Passive Congregation
AEPSOArea Extension with Particle Swarm Optimization
ADPSOAdaptive Dissipative Particle Swarm Optimization
DAPSODynamic Adaptation of Particle Swarm Optimization
ALOAAnt Lion Optimization Algorithm
QOSIMBO_QQuasi-Oppositional Swine Influenza Model-Based Optimization with Quarantine
QOCSOSQuasi-Oppositional Chaotic Symbiotic Organisms Search
CSCAChaotic Sine Cosine Approach
HHOHarris Hawks Optimizer
SFSAStochastic Fractal Search Algorithm
QOTLBOQuasi-Oppositional Teaching–Learning-Based Optimization
GWOGray Wolf Optimization
IGWOImproved Gray Wolf Optimization
ABCArtificial Bee Colony
CSACuckoo Search Approach
SGASimple Genetic Algorithm
MTLBOModified Teaching–Learning-Based Optimization
BB-BCBig Bang–Big Crunch
SFSAStochastic Fractal Search Algorithm
IHHOImproved Harris Hawks Optimizer
BFOABacterial Foraging Optimization Algorithm
LSFSALoss Sensitivity Factor-Simulated Annealing
CABCChaotic Artificial Bee Colony
WOAWhale Optimization Algorithm
WCAWater Cycle Algorithm
MFFModified Firefly
ROARider Optimization Algorithm
HGSOHenry Gas Solubility Optimization
COACoyote Optimization Algorithm
ECOAEnhanced Coyote Optimization Algorithm
SFOSunflower Optimization
VSIVoltage Stability Index
NRNot Reported

References

  1. Ali, E.S.; Abd-Elazim, S.M.; Abd-Elaziz, A.Y. Improved Harmony Algorithm and Power Loss Index for Optimal Locations and Sizing of Capacitors in Radial Distribution Systems. Int. J. Electr. Power Energy Syst. 2016, 80, 252–263. [Google Scholar] [CrossRef]
  2. Abd-Elaziz, Y.; Ali, E.S.; Abd-Elazim, S.M. Flower Pollination Algorithm for Optimal Capacitor Placement and Sizing in Distribution Systems. Electr. Power Compon. Syst. 2016, 44, 544–555. [Google Scholar] [CrossRef]
  3. Ali, E.S.; Abd-Elazim, S.M. Optimal Locations and Sizing of Capacitors in Radial Distribution Systems Using Mine Blast Algorithm. Electr. Eng. 2018, 100, 1–9. [Google Scholar]
  4. Abd-Elazim, S.M.; Ali, E.S. Optimal Network Restructure via Improved Whale Optimization Approach. Int. J. Commun. Syst. 2021, 34, e4617. [Google Scholar]
  5. Rao, R.S.; Ravindra, K.; Satish, K.; Narasimham, S.V.L. Power Loss Minimization in Distribution System Using Network Reconfiguration in the Presence of Distributed Generation. IEEE Trans. Power Syst. 2013, 28, 317–325. [Google Scholar] [CrossRef]
  6. Elraouf, M.O.A.; Aljohani, M.; Mosaad, M.I.; Fattah, T.A.A. Mitigating Misfire and Fire-through Faults in Hybrid Renewable Energy Systems Utilizing Dynamic Voltage Restorer. Energies 2022, 15, 5769. [Google Scholar] [CrossRef]
  7. Bawazir, R.O.; Cetin, N.S. Comprehensive Overview of Optimizing PV-DG Allocation in Power System and Solar Energy Resource Potential Assessments. Energy Rep. 2020, 6, 173–208. [Google Scholar] [CrossRef]
  8. Kiehbadroudinezhad, M.; Merabet, A.; Abo-Khalil, A.G.; Salameh, T.; Ghenai, C. Intelligent and Optimized Microgrids for Future Supply Power from Renewable Energy Resources: A Review. Energies 2022, 15, 3359. [Google Scholar] [CrossRef]
  9. Mosaad, M.I. Grid-Connected PV System Statistics and Evaluation; Review. YJES 2022, 19, 1–10. [Google Scholar] [CrossRef]
  10. Ali, E.S.; Abd-Elazim, S.M.; Abd-Elaziz, A. Ant Lion Optimization Algorithm for Renewable Distributed Generations. Energy 2016, 116, 445–458. [Google Scholar] [CrossRef]
  11. Alhejji, A.K.; Salem, F.; Mosaad, M.I. Optimal Location and Size of SVC Devices in Interconnected Electrical Power System Using Quadratic Adaptive Bacterial Foraging Algorithm. In Proceedings of the 2018 IEEE International Conference on Electro/Information Technology (EIT), Rochester, MI, USA, 3–5 May 2018; pp. 0817–0821. [Google Scholar] [CrossRef]
  12. Smallwood, L. Distributed Generation in Autonomous and Nonautonomous Micro Grids. In Proceedings of the IEEE Rural Electric Power Conference, Colorado Springs, CO, USA, 5–7 May 2002; pp. D1–D6. [Google Scholar]
  13. Aman, M.; Jasmon, G.B.; Mokhlis, H.; Bakar, A.H. Optimal Placement and Sizing of a DG based on A New Power Stability Index and Line Losses. Int. J. Electr. Power Energy Syst. 2012, 43, 1296–1304. [Google Scholar] [CrossRef]
  14. Moravej, Z.; Akhlaghi, A. A Novel Approach based on Cuckoo Search for DG Allocation in Distribution NetWork. Int. J. Electr. Power Energy Syst. 2013, 44, 672–679. [Google Scholar] [CrossRef]
  15. Chakravorty, M.; Das, D. Voltage Stability Analysis of Radial Distribution Networks. Int. J. Electr. Power Energy Syst. 2001, 23, 129–135. [Google Scholar] [CrossRef]
  16. Khalesi, N.; Rezaei, N.; Haghifam, M.R. DG Allocation with Application of Dynamic Programming for Loss Reduction and Reliability Improvement. Int. J. Electr. Power Energy Syst. 2011, 33, 288–295. [Google Scholar] [CrossRef]
  17. Gopu, P.; Naaz, S.; Aiman, K. Optimal Placement of Distributed Generation using Genetic Algorithm. In Proceedings of the International Conference on Advances in Electrical, Computing, Communication and Sustainable Technologies (ICAECT), Bhilai, India, 19–20 February 2021; pp. 1–6. [Google Scholar]
  18. Syahputra, R.; Robandi, I.; Ashari, M. PSO Based Multiobjective Optimization for Reconfiguration of Radial Distribution Network. Int. J. Appl. Eng. Res. 2015, 10, 14573–14586. [Google Scholar]
  19. Ali, E.S.; El-Sehiemy, R.A.; El-Ela, A.A.A.; Kamel, S.; Khan, B. Optimal Planning of Uncertain Renewable Energy Sources in Unbalanced Distribution Systems by a Multi-Objective Hybrid PSO–SCO Algorithm. IET Renew. Power Gener. 2022, 16, 2111–2124. [Google Scholar] [CrossRef]
  20. Devi, S.; Geethanjali, M. Application of Modified Bacterial Foraging Optimization Algorithm for Optimal Placement and Sizing of Distributed Generation. Expert Syst. Appl. 2014, 41, 2772–2781. [Google Scholar] [CrossRef]
  21. Prakash, R.; Lokeshgupta, B.; Sivasubramani, S. Multi-Objective Bat Algorithm for Optimal Placement and Sizing of DG. In Proceedings of the 20th National Power Systems Conference (NPSC), Tiruchirappalli, India, 14–16 December 2018; pp. 1–6. [Google Scholar]
  22. Sudharani, D.; Subrahmanyam, N.; Sydulu, M. Multiobjective Invasive Weed Optimization An Application to Optimal Network Reconfiguration in Radial Distribution systems. Int. J. Electr. Power Energy Syst. 2015, 73, 932–942. [Google Scholar] [CrossRef]
  23. Mohamed, A.; Ali, S.; Alkhalaf, S.; Senjyu, T.; Hemeida, A.M. Optimal Allocation of Hybrid Renewable Energy System by Multi-Objective Water Cycle Algorithm. Sustainability 2019, 11, 6550. [Google Scholar] [CrossRef]
  24. Omar, S.; Manan, M.N.A.; Siam, M.N.M.; Samat, A.A.A.; Daud, K.A. Optimum Location of DG for Loss Reduction with Ant Colony Algorithm. In Proceedings of the First International Conference on Electrical Energy and Power Engineering (ICEEPE 2020), Penang, Malaysia, 25–26 August 2020; Volume 1045, pp. 1–12. [Google Scholar]
  25. Fetanat, A.; Khorasaninejad, E. Size Optimization for Hybrid Photovoltaic-Wind Energy System Using Ant Colony Algorithm for Continuous Domains based Integer Programming. Appl. Soft Comput. 2015, 31, 196–209. [Google Scholar] [CrossRef]
  26. García, J.A.M.; Mena, A.J.G. Optimal Distributed Generation Location and Size Using a Modified Teaching–Learning based Optimization Algorithm. Int. J. Electr. Power Energy Syst. 2013, 50, 65–75. [Google Scholar] [CrossRef]
  27. Ahmadi, S.; Abdi, S. Application of the Hybrid Big Bang-Big Crunch Algorithm for Optimal Sizing of a Stand-Alone Hybrid PV/Wind/Battery System. Sol. Energy 2016, 134, 366–374. [Google Scholar] [CrossRef]
  28. Ansari, M.M.; Guo, C.; Shaikh, M.S.; Chopra, N.; Haq, I.; Shen, L. Planning for Distribution System with Grey Wolf Optimization Method. J. Electr. Eng. Technol. 2020, 15, 1485–1499. [Google Scholar] [CrossRef]
  29. Nguyen, T.T.; Truong, A.V. Distribution Network Reconfiguration for Power Loss Minimization and Voltage Profile Improvement Using Cuckoo Search Algorithm. Int. J. Electr. Power Energy Syst. 2015, 68, 233–242. [Google Scholar] [CrossRef]
  30. Nguyen, T.T.; Truong, A.V.; Phung, T.A. A Novel Method based on Adaptive Cuckoo Search for Optimal Network Reconfiguration and Distributed Generation Allocation in Distribution Network. Int. J. Electr. Power Energy Syst. 2016, 78, 801–815. [Google Scholar] [CrossRef]
  31. Kumar, J.S.; Raja, S.C.; Nesamalar, J.J.D.; Venkatesh, P. Optimizing Renewable based Generations in AC/DC Microgrid System Using Hybrid Nelder-Mead-Cuckoo Search Algorithm. Energy 2018, 158, 204–215. [Google Scholar] [CrossRef]
  32. Purlu, M.; Turka, B.E. Optimal Allocation of Renewable Distributed Generations Using Heuristic Methods to Minimize Annual Energy Losses and Voltage Deviation Index. IEEE Power Energy Soc. Sect. 2022, 10, 21455–21474. [Google Scholar] [CrossRef]
  33. Saha, S.; Mukherjee, V. A Novel Multiobjective Chaotic Symbiotic Organisms Search Algorithm to Solve Optimal DG Allocation Problem in Radial Distribution System. Int. Trans. Electr. Energy Syst. 2019, 29, e2839. [Google Scholar] [CrossRef]
  34. Bayoumi, S.A.; El-Sehiemy, R.A.; Abaza, A. Effective PV Parameter Estimation Algorithm Based on Marine Predators Optimizer Considering Normal and Low Radiation Operating Conditions. Arab. J. Sci. Eng. 2022, 47, 3089–3104. [Google Scholar] [CrossRef]
  35. Hassan, A.; Fahmy, F.; Nafeh, A.; Abuelmagd, M. Genetic Single Objective Optimisation for Sizing and Allocation of Renewable DG Systems. Int. J. Sustain. Energy 2017, 36, 545–562. [Google Scholar] [CrossRef]
  36. Manafi, H.; Ghadimi, N.; Ojaroudi, M.; Farhadi, P. Optimal Placement of Distributed Generations in Radial Distribution Systems Using Various PSO and DE Algorithms. Elektron. Ir Elektrotechnika 2013, 19, 53–57. [Google Scholar] [CrossRef]
  37. Acharya, N.; Mahat, P.; Mithulananthan, N. An Analytical Approach for DG Allocation in Primary Distribution Network. Int. J. Electr. Power Energy Syst. 2006, 28, 669–678. [Google Scholar] [CrossRef]
  38. Shukla, T.; Singh, S.; Srinivasaraob, V.; Naik, K. Optimal Sizing of Distributed Generation Placed on Radial Distribution Systems. Electr. Power Compon. Syst. 2010, 38, 260–274. [Google Scholar] [CrossRef]
  39. Naik, S.; Khatod, D.; Sharma, M. Optimal Allocation of Combined DG and Capacitor for Real Power Loss Minimization in Distribution Networks. Int. J. Electr. Power Energy Syst. 2013, 53, 967–973. [Google Scholar] [CrossRef]
  40. Ali, S.; Abd-Elazim, S.M.; Abd-Elaziz, A.Y. Ant Lion Optimization Algorithm for Optimal Location and Sizing of Renewable Distributed Generations. Renew. Energy 2017, 101, 1311–1324. [Google Scholar] [CrossRef]
  41. Reddy, P.; Reddy, V.; Manohar, T. Ant Lion Optimization Algorithm for Optimal Sizing of Renewable Energy Resources for Loss Reduction in Distribution Systems. J. Electr. Syst. Inf. Technol. 2018, 5, 663–680. [Google Scholar]
  42. Khasanov, M.; Kamel, S.; Rahmann, C.; Hasanien, H.M.; Al-Durra, A. Optimal Distributed Generation and Battery Energy Storage Units Integration in Distribution systems Considering Power Generation Uncertainty. IET Gener. Transm. Distrib. 2021, 15, 3400–3422. [Google Scholar] [CrossRef]
  43. Pham, T.D.; Nguyen, T.T.; Dinh, B.H. Find Optimal Capacity and Location of Distributed Generation Units in Radial Distribution Networks by Using Enhanced Coyote Optimization Algorithm. Neural Comput. Appl. 2021, 33, 4343–4371. [Google Scholar] [CrossRef]
  44. Nowdeh, S.A.; Davoudkhani, I.F.; Moghaddam, M.J.H.; Najmi, E.S.; Abdelaziz, A.Y.; Ahmadi, A.; Razavi, S.E.; Gandoman, F.H. Fuzzy Multi-Objective Placement of Renewable Energy Sources in Distribution System with Objective of Loss Reduction and Reliability Improvement Using A Novel Hybrid Method. Appl. Soft Comput. J. 2019, 77, 761–779. [Google Scholar] [CrossRef]
  45. Sharma, S.; Bhattacharjee, S.; Bhattacharya, A. Quasi Oppositional Swine Influenza Model Based Optimization with Quarantine for Optimal Allocation of DG in Radial Distribution Network. Int. J. Electr. Power Energy Syst. 2016, 74, 348–373. [Google Scholar] [CrossRef]
  46. Truong, K.H.; Nallagownden, P.; Elamvazuthi, I.; Vo, D.N. A Quasi-Oppositional-Chaotic Symbiotic Organisms Search Algorithm for Optimal Allocation of DG in Radial Distribution Networks. Appl. Soft Comput. J. 2020, 88, 106067. [Google Scholar] [CrossRef]
  47. Selim, A.; Kamel, S.; Jurado, F. Efficient Optimization Technique for Multiple DG Allocation in Distribution Networks. Appl. Soft Comput. J. 2020, 86, 105938. [Google Scholar] [CrossRef]
  48. Selim, A.; Kamel, S.; Alghamdi, A.S.; Jurado, F. Optimal Placement of DGs in Distribution System Using an Improved Harris Hawks Optimizer Based on Single- And Multi-Objective Approaches. IEEE Access 2020, 8, 52815–52829. [Google Scholar] [CrossRef]
  49. Nguyen, T.P.; Vo, D.N. A Novel Stochastic Fractal Search Algorithm for Optimal Allocation of Distributed Generators in Radial Distribution Systems. Appl. Soft Comput. J. 2018, 70, 773–796. [Google Scholar] [CrossRef]
  50. Sultana, S.; Roy, P.K. Multi-Objective Quasi-Oppositional Teaching Learning based Optimization for Optimal Location of Distributed Generator in Radial Distribution Systems. Int. J. Electr. Power Energy Syst. 2014, 63, 534–545. [Google Scholar] [CrossRef]
  51. Akbar, M.I.; Kazmi, S.A.A.; Alrumayh, O.; Khan, Z.A.; Altamimi, A.; Malik, M.M. A Novel Hybrid Optimization-based Algorithm for The Single and Multi-Objective Achievement with Optimal DG Allocations in Distribution Networks. IEEE Access 2022, 10, 25669–25687. [Google Scholar] [CrossRef]
  52. Abu-Mouti, S.; El-Hawary, M.E. Optimal Distributed Generation Allocation and Sizing in Distribution Systems via Artificial Bee Colony Algorithm. IEEE Trans. Power Deliv. 2011, 26, 2090–2101. [Google Scholar] [CrossRef]
  53. Gozel, T.; Hocaoglu, M. An Analytical Method for The Sizing and Siting of Distributed Generators in Radial Systems. Int. J. Electr. Power Syst. Res. 2009, 79, 912–918. [Google Scholar] [CrossRef]
  54. Pisica, I.; Bulac, C.; Eremia, M. Optimal Distributed Generation Location and Sizing Using Genetic Algorithms. In Proceedings of the 15th International Conference on Intelligent System Applications to Power Systems (ISAP 09), Curitiba, Brazil, 8–12 November 2009; pp. 1–6. [Google Scholar]
  55. Wong, L.Y.; Rahim, S.R.A.; Sulaiman, M.H.; Aliman, O. Distributed Generation Installation Using Particle Swarm Optimization. In Proceedings of the 4th International Conference on Power Engineering and Optimization, Shah Alam, Malaysia, 23–24 June 2010; pp. 159–163. [Google Scholar]
  56. Tan, W.; Hassan, M.; Majid, M.; Rahman, H. Allocation and Sizing of DG Using Cuckoo Search Algorithm. In Proceedings of the IEEE International Conference on Power and Energy, Kota Kinabalu, Malaysia, 2–5 December 2012; pp. 133–138. [Google Scholar]
  57. Abdelaziz, A.; Hegazy, Y.; El-Khattam, W.; Othman, M. A Multi-objective Optimization for Sizing and Placement of Voltage-Controlled Distributed Generation Using Supervised Big Bang-Big Crunch Method. Electr. Power Compon. Syst. 2015, 43, 105–117. [Google Scholar] [CrossRef]
  58. Ali, S.; Abd-Elazim, S.M.; Abd-Elaziz, A.Y. Optimal Allocation and Sizing of Renewable Distributed Generation Using Ant Lion Optimization Algorithm. Electr. Eng. 2018, 100, 99–109. [Google Scholar] [CrossRef]
  59. Imran, A.M.; Kowsalya, M. Optimal Size and Siting of Multiple Distributed Generators in Distribution System Using Bacterial Foraging Optimization. Swarm Evolut. Compt. 2014, 15, 58–65. [Google Scholar] [CrossRef]
  60. Injeti, S.K.; Kumar, N.P. A Novel Approach to Identify Optimal Access Point and Capacity of Multiple DGs in a Small, Medium and Large Scale Radial Distribution Systems. Int. J. Electr. Power Energy Syst. 2013, 45, 142–151. [Google Scholar] [CrossRef]
  61. Natarajan, M.; Balamurugan, R.; Lakshminarasimman, L. Optimal Placement and Sizing of DGs in the Distribution System for Loss Minimization and Voltage Stability Improvement Using CABC. Int. J. Electr. Eng. Inform. 2015, 7, 679–690. [Google Scholar] [CrossRef]
  62. Reddy, P.; Reddy, V.; Manohar, T. Optimal Renewable Resources Placement in Distribution Networks by Combined Power Loss Index and Whale Optimization Algorithms. J. Electr. Syst. Inf. Technol. 2018, 5, 175–191. [Google Scholar]
  63. Reddy, P.; Reddy, V.; Manohar, T. Whale Optimization Algorithm for Optimal Sizing of Renewable Resources for Loss Reduction in Distribution Systems. Renewables 2017, 4, 3. [Google Scholar] [CrossRef]
  64. Latreche, Y.; Bouchekara, H.R.E.H.; Mokhlis, H.; Naidu, K.; Kerrour, F.; Javaid, M.S. Optimal Multi-DG Units Incorporation in Distribution Systems Using Single and Multi-Objective Approaches based on Water Cycle Algorithm. J. Electr. Syst. 2020, 16, 530–549. [Google Scholar]
  65. Sukraj, K.; Yuvaraj, T.; Hariharan, R.; Thirumalai, M. Simultaneous Allocation of Shunt Capacitor and Distributed Generator in Radial Distribution Network Using Modified Firefly Algorithm. In Proceedings of the IEEE 6th International Conference on Smart Structures and Systems ICSSS 2019, Chennai, India, 14–15 March 2019; pp. 1–5. [Google Scholar]
  66. Braik, M.; Hammouri, A.; Atwan, J.; Al-Betar, M.A.; Awadallah, M.A. White Shark Optimizer: A Novel Bio-inspired Meta-Heuristic Algorithm for Global Optimization Problems. Knowl.-Based Syst. 2022, 243, 108457. [Google Scholar] [CrossRef]
  67. Haddad, O.B. Advanced Optimization by Nature-Inspired Algorithms. In Studies in Computational Intelligence; Springer: Berlin/Heidelberg, Germany, 2018. [Google Scholar]
  68. Kamarzaman, A.; Sulaiman, S.I.; Ibrahim, I.R. Adaptive Mechanism for Enhanced Performance of Shark Smell Optimization. J. Electr. Electron. Syst. Res. 2021, 18, 9–17. [Google Scholar] [CrossRef]
  69. Wang, L.; Wang, X.; Sheng, Z.; Lu, S. Multi-Objective Shark Smell Optimization Algorithm Using Incorporated Composite Angle Cosine for Automatic Train Operation. Energies 2020, 13, 714. [Google Scholar] [CrossRef]
  70. Wang, D.; Wang, X.C.; Liu, K.W. An Improved Multi-objective Shark Smell Optimization Algorithm for Automatic Train Operation Based on Angle Cosine and Fusion Distance. J. Comput. 2020, 31, 141–156. [Google Scholar]
  71. Zhou, Y.; Ye, J.; Du, Y.; Sheykhahmad, F.R. New Improved Optimized Method for Medical Image Enhancement Based on Modified Shark Smell Optimization Algorithm. Sens. Imaging 2020, 21, 20. [Google Scholar] [CrossRef]
  72. Ali, A.; Kamel, S.; Hassan, M.H.; Ahmed, E.M.; Alanazi, M. Optimal Power Flow Solution of Power Systems with Renewable Energy Sources Using White Sharks Algorithm. Sustainability 2022, 14, 6049. [Google Scholar] [CrossRef]
  73. Alhumade, H.; Rezk, H.; Louzazni, M.; Moujdin, I.A.; Al-Shahrani, S. Advanced Energy Management Strategy of Photovoltaic/PEMFC/Lithium-Ion Batteries/Supercapacitors Hybrid Renewable Power System Using White Shark Optimizer. Sensors 2023, 23, 1534. [Google Scholar] [CrossRef] [PubMed]
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.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.