Next Article in Journal
Optimization of Solidification and Stabilization Efficiency of Heavy Metal Contaminated Sediment Based on Response Surface Methodology
Next Article in Special Issue
Investigating the Impact of Wind Power Integration on Damping Characteristics of Low Frequency Oscillations in Power Systems
Previous Article in Journal
Menu Choice and Meat-Eating Habits: Results of a Field Experiment in Two University Canteens
Previous Article in Special Issue
Energy Conservation Measures and Value Engineering for Small Microgrid: New Hospital as a Case Study
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Optimal Location and Sizing of Distributed Generators in Power System Network with Power Quality Enhancement Using Fuzzy Logic Controlled D-STATCOM

1
Department of Electrical Engineering, Faculty of Engineering & Technology, Jamia Millia Islamia, New Delhi 110025, India
2
Electrical Engineering Department, College of Engineering, Taif University, P.O. Box 11099, Taif 21944, Saudi Arabia
*
Authors to whom correspondence should be addressed.
Sustainability 2022, 14(6), 3305; https://doi.org/10.3390/su14063305
Submission received: 4 February 2022 / Revised: 4 March 2022 / Accepted: 4 March 2022 / Published: 11 March 2022

Abstract

:
This article presents the selection of location and sizing of multiple distributed generators (DGs) for boosting performance of the radial distribution system in the case of constant power load flow and constant impedance load flow. The consideration of placing and sizing of DGs is to meet the load demand. This article tries to overcome the limitations of existing techniques for determining the appropriate location and size of DGs. The selection of DG location is decided in terms of real power losses, accuracy, and sensitivity. The size of DG is measured in terms of real and reactive power. Both positioning and sizing of DG are analyzed with the genetic algorithm and the heuristic probability distribution method. The results are compared with other existing methods such as ant-lion optimization algorithm, coyote optimizer, modified sine-cosine algorithm, and particle swarm optimization. Further, the power quality improvement of the network is assessed by positioning D-STATCOM, and its location is decided on the basis of the nearby bus having poor voltage profile and high total harmonic distortion (THD). The switching and controlling of D-STATCOM are assessed with fuzzy logic controller (FLC) for improving the performance parameters such as voltage profile and THD at that particular bus. The proposed analytical approach for the system is tested on the IEEE 33 bus system. It is observed that the performance of the system with the genetic algorithm gives a better solution in comparison to heuristic PDF and other existing methods for determining the optimal location and size of DG. The introduction of D-STATCOM into the system with FLC shows better performance in terms of improved voltage profile and THD in comparison to existing techniques.

1. Introduction

The current activities of the advanced power system have become very complicated, which needs to necessarily satisfy the increasing energy needs in an efficient manner [1,2]. The civil, fiscal, and other substantial considerations warrant the site of generation centers being placed at places distant from load centers. The reorganization and deregulation of power companies have led to making system governance unpredictable. The factors which are to be considered while carrying out extension of the transmission system are the following: cutback stability margins, chances of tripping outages, and rising power cuts. The distributed generator (DG) installation would be of the utmost benefit where the installation of new transmission lines and setting up of new power-generating units are not feasible [3,4,5]. It is also reasonable to believe that the selection of the right DG technology, including the optimal location and scale of the DG, would help in decreasing the losses in such a system. The purpose of optimally placing DG in a power system network is for achieving correct operation of the network with system error minimization and voltage profile enhancement inclusive of improved stability, reliability, and load ability [6,7]. In contrast to the classical approach, smart techniques for optimal DG sizing and positioning are simple and have good convergence characteristics for application to composite power system networks [8,9,10]. DG is also capable of significantly mitigating harmonics and improving the voltage profile along with acquiesced transmission and distribution investment [11,12,13]. DG is flexible enough to locate anywhere in the system as per requirement of minimum transmission losses [14,15,16]. There have been many techniques proposed to perform such activities as load durability test, exact loss formula, Newton–Raphson, Gauss–Seidal method etc., [17,18,19]. At present, in the era of soft computing technique, every system is trying to obtain fast convergence region so as to reduce the minimum losses with lesser component involved [20,21].
The biggest challenge is to find the optimal size of DG to fulfil the load requirements. It is observed that there are four types of DG given as:
(a)
DG1: It supports only real power; no component of reactive power at unity power factor. For example: solar PV array.
(b)
DG2: It supports both real power and reactive power at 0.8–0.85 power factor leading. For example: wind, tidal geothermal.
(c)
DG3: It supports only reactive power; no component of real power at 0 power factor. For example: synchronous condenser, capacitor bank.
(d)
DG4: It absorbs the real power, giving the reactive power to the system at 0.8–0.85 power factor lagging. For example: doubly-fed induction generator [22,23,24].
Recent work has found that there are many advantages to the installation of DGs within the power system; namely raising the efficiency of the output and lowering energy deficit on the electrical grid [25,26,27,28]. In this article, only DG2 is used as per system requirements. The size and location of DG were proposed in many articles by using different techniques such as crow bar search method, neural network, evolutionary algorithm, intelligent water droplet, swarm optimization, etc. [29,30,31,32,33]. The advanced algorithms [34,35] or other existing techniques for identifying the size and location of DG have the biggest challenge of improper total harmonic distortion (THD), sensitivity, and accuracy. It is observed in literature that the THD value obtained was in the range of 15–18%, accuracy and sensitivity are also in the range of 10–15% which are quite high and inadequate, due to which voltage profile is distorted. Such issues with existing techniques create the motivation to overcome these problems. These issues are satisfactorily resolved with the proposed scheme. The genetic algorithm (GA) is proposed to determine the sizing and location of DG with improved THD, accuracy, sensitivity, and voltage profile. GA tends to be more highly permissible than heuristic optimization strategies in order to find the optimal results with less effort than absolute search. In this paper, heuristic optimization strategy which is a combination of two methods, namely, Poisson distribution method and normal distribution method, is also utilized to find the performance of the radial distribution system and show the effectiveness of GA in its comparison. Such a heuristic method requires more effort for providing detailed solutions in terms of accuracy, sensitivity, realism, and power loss. In order to have better results with minimal efforts, GA is applied. It is also observed that the proposed technique gives better results in comparison to existing techniques presented in literature [4,9,12,15,17,20,28,30,32,35,36,37,38,39,40,41,42,43,44,45]. However, to analyze the efficacy of the proposed work in this paper, the results achieved are compared with the existing techniques such as ant-lion optimization algorithm [42], coyote optimizer [43], modified sine-cosine algorithm [44], and particle swarm optimization [45]. The GA seems to have the main advantage of utilizing entity definition, i.e., strings, instead of handling such entities themselves. Multiple problems in electricity grid optimization are manifestations in numerical optimization but linear and other nonlinear methods in programming consider them difficult to address. In this article, the heuristic probability distribution method and GA are applied for finding the best location and sizing of DG in the IEEE 33 bus system for the constant power load model (CPLF) and the constant impedance load model (CILF). The performance parameters show the superiority of GA over the heuristic probability distribution method and other existing methods such as ant-lion optimization algorithm [42], coyote optimizer [43], modified sine-cosine algorithm [44], and particle swarm optimization [45] in the IEEE 33 standard bus system. By considering lower real power losses, improved accuracy, and sensitivity, selection criteria of three DGs location are decided, and after that, size of DG is decided in terms of real and reactive power. Afterwards, the impact of the distribution static compensator (D-STATCOM) is assessed for improving the power quality performance at the line near to the bus terminal having higher distortion. In order to improve the power quality of performance parameters, the switching of D-STATCOM is performed by using the fuzzy logic controller (FLC). With the involvement of D-STATCOM, the distortion level has been improved considerably with FLC in comparison to existing techniques. It is preferred to utilize optimal contribution of DG for both the CILF and the CPLF system so as to fulfill the load demand using GA.

2. Optimal Location and Sizing of DG

This paper aims to find the optimal location and size of DG. For this, two approaches are adopted. Firstly, the location and size are found using the heuristic probability distribution method (PDF), and then the GA method is used. Both these methods utilize CPLF and CILF to optimize the DG location and size.
DG is placed at a particular bus to fulfil the load demand. Since load demand is fixed for all buses, the selection of bus for DG placement is assessed in terms of minimum real power losses, improved accuracy, and improved sensitivity factor. The selection of DG location is analyzed by using heuristic PDF and GA.

2.1. Heuristic Probability Distribution Method (PDF)

The location and position of DG are decided by the heuristic probability distribution method which is presented in Equation (1). The heuristic probability distribution method is a combination of the Poisson distribution method and normal distribution and it is denoted by operator ‘J’ and is expressed by the following equation:
J = min ( i = 1 33 X i | S i S r e f | 2 + p d f ( λ ) ( i = 1 33 S l o s s ) )
J is an operator of heuristic probability distribution method for minimization of power losses shown in Equation (2) and λ is the difference between measured and reference power.
S l o s s = i = 1 33 S i S l o a d
Sloss is the complex power loss between two buses and Sload is the power consumed by the load.
Putting the value of Equation (2) into Equation (1), Equation (3) is obtained as:
J = min ( i = 1 33 X i | S i S r e f | 2 + p d f ( λ ) ( i = 1 33 S i S l o a d ) )
where the measured (Si) and reference value (Sref) of complex power are given by Equations (4) and (5), respectively:
S i = P i + j Q i
S r e f = P r e f + j Q r e f
Xi is the design factor given by Equation (6) to improve the accuracy such that minimum power loss can be attained.
X i = S r a t e d | C 1 S i + C 2 S r e f | 2
The probability distribution factor in Equation (3) is given by Equation (7):
p d f ( λ ) = e λ 2 2 σ 2 σ 2 π
where λ = S i S r e f = difference factor between measured and reference value of power.
As per standard expression of normal distribution and comparing with Equation (7), Equation (8) is obtained:
p d f ( S i S r e f ) = e | S i S r e f | 2 2 σ 2 σ 2 π
where Sref is the mean, σ is the standard deviation, and its corresponding variance is given as σ2.
Putting the value of Equations (6)–(8) into Equation (3), Equation (9) is obtained:
J = min ( i = 1 33 S r a t e d | S i S r e f | 2 | C 1 S i + C 2 S r e f | 2 + e | S i S r e f | 2 2 σ 2 σ 2 π ( i = 1 33 S i S l o a d ) )
where,
  • C1 is the accuracy measured in terms of real power measurement. Its range lies between 0.02 and 0.04. The mathematical representation of C1 is given as (ΔPi/Pi).
  • C2 is the accuracy measured in terms of reactive power measurement. Its range lies between 0.03 and 0.05. The mathematical representation of C2 is given as (ΔQi/Qi).
Power flow at bus ‘i’ is given by Equations (10) and (11) as:
Δ P = P i P r e f
Δ Q = Q i Q r e f
where, Pi and Qi are real and reactive power flow between two buses and their reference values are given as Pref and Qref as shown in Equations (12) and (13):
P i = P i j = i = 1 33 j = 1 33 V i V j ( G i j cos ( θ i θ j ) + B i j sin ( θ i θ j ) )
Q i = Q i j = i = 1 33 j = 1 33 V i V j ( G i j cos ( θ i θ j ) B i j sin ( θ i θ j ) )
where conductance (Gij) and susceptance (Bij) are given by Equations (14) and (15), respectively:
G i j = R i j R i j 2 + X i j 2
B i j = X i j R i j 2 + X i j 2
The best performance index can be measured by differentiating Equation (9) to obtain the minimal optimal solution as shown in Equation (16):
J S i = 0 ; 2 J S i 2 > 0
J is the function of variable Si which employs J(Si). For checking the convergence nature, Taylor series expansion for second order is used for ‘k’ iteration as shown in Equation (17):
J ( S i k + 1 ) = J ( S i k ) + h ( J ( S i k ) ) S i k + h 2 2 ( J ( S i k ) ) ( S i k ) 2
Using the condition of Equation (16) in Equation (17), Equation (18) is obtained:
J ( S i k + 1 ) J ( S i k ) = h 2 2 ( J ( S i k ) ) ( S i k ) 2
Rearranging Equation (18), Equation (19) is obtained:
J ( S i k + 1 ) J ( S i k ) h 2 = 2 ( J ( S i k ) ) ( S i k ) 2 > 0
where h = S i k + 1 S i k . In order to obtain Equation (19), there is a constraint limit to attain the convergence level, which is shown in Equation (20):
M a g n i t u d e | J ( S i k + 1 ) J ( S i k ) | < ε
The complete iterative process under the heuristic PDF method is shown using Figure 1.
The load representations for CPLF and CILF are given by Equations (21)–(23):
S l o a d = P L + j Q L
where
P L = P i ( V o V i ) x
Q L = Q i ( V o V i ) y
Vo is rated voltage of a particular bus while x and y are constant load parameter and its values are shown in Table 1.
The constant values of x and y are taken for power load and impedance load; that is why they are called constant power load and constant impedance load.
The sensitivity and accuracy can be represented as ( J ) ( S i ) in pu and S i S r e f in pu, respectively.

2.2. Performance Evaluation for Standard IEEE Tested 33 Bus Systems Using Heuristic PDF

The effectiveness of the proposed scheme using the conventional method is being tested initially on the standard IEEE 33 bus test system for CPLF and CILF [36,37]. The typical diagram of the IEEE 33 bus test system is shown in Figure 2 [37].
The IEEE 33 bus test system is modelled in MATLAB with location of fault from 0–90 km. This system consists of 33 buses and 32 lines and has 12.66 kV, 3.715 MW, and 2.3 MVar load size. Thirty percent of the entire load is the size of the source unit used. The source unit voltage is 12.66 kV and the system’s lower and upper voltage is set between 0.95 pu and 1.05 pu with standard internal parameters as given in [37]. Bus 1 is considered as the slack bus or main substation. The internal parameters of the IEEE 33 bus test system are shown in [36].
The proposed design illustrated from Equations (1)–(23) is applied on the standard IEEE 33 bus test system for estimation of location of DG using the heuristic PDF method. By using these equations, the parameters such as real power loss, accuracy, and sensitivity are estimated as shown in Table 2. The design part has already been discussed in the previous section.

2.3. Genetic Algorithm

GA is used to find the best location of DG in the IEEE 33 bus system. It involves reproduction, crossover, and mutation. Its procedure can be illustrated by the flowchart as shown in Figure 3. The process begins with selection of a binary string as shown by Equation (24), the parameters for which are assumed as follows:
Population size: 6, length of the complete string: 8, crossover probability, Pc = 0.9, mutation probability, Pm = 0.02.
S i r = S i min + S i max S i min 2 l 1 y r
where r is the iteration count. The application of iteration in Equation (24) results in Equations (25) and (26):
f r = 1 ( 1 + α ε r S i r )
α is step size which is equal to 0.5.
ε r = S i r S i r e f
Figure 4 and Figure 5 show real power loss at bus 17 for CPLF and CILF using GA. The performance parameter for finding the DG location can be analyzed from Table 2 and Table 3 at different DG locations in the IEEE 33 bus system using heuristic PDF and GA methods for both CPLF and CILF. Figure 6 and Figure 7 provide the performance parameter comparison of GA with the heuristic method at different buses for CPLF and CILF. Moreover, in order to have comprehensive analysis and comparison for the DG location with GA and heuristic pdf, the results are compared with those obtained with the ant-lion optimization algorithm [42], coyote optimizer [43], modified sine-cosine algorithm [44], and particle swarm optimization [45]. The performance parameter evaluation for the estimation of DG location by using the ant-lion optimization algorithm [42], coyote optimizer [43], modified sine-cosine algorithm [44], and particle swarm optimization [45] is shown in Table 4, Table 5, Table 6 and Table 7 for CPLF and CILF type of load.
From Table 2, Table 3, Table 4, Table 5, Table 6 and Table 7, it is observed that the selection of DGs location is better found under GA for CPLF and CILF in comparison to other methods. By comparing the real power loss, sensitivity, and accuracy, it can be concluded that bus 17 is the best location for the placement of DG for both CPLF and CILF. In the sequence manner, bus 3 and bus 4 are the second and third position of placing the next two DGs. The comparative results for positioning of three DGs with different methods are shown in Table 8.

2.4. Optimal Sizing of DG

After deciding the optimal location of three DGs, it is also required to check the DG size to confirm its placement at bus 17. DG size is estimated from Table 9, Table 10 and Table 11 by using heuristic pdf, GA, ant-lion optimization algorithm [42], coyote optimizer [43], modified sine-cosine algorithm [44], and particle swarm optimization [45] for both CPLF and CILF type of load. It is observed that the size of DG when placed at bus 17 is found to be the minimum. The relative comparison of DG size for bus 17, 4, and 3 is shown in Table 12. The minimal size of DG is obtained under GA as compared to the heuristic method. Figure 8, Figure 9 and Figure 10 illustrate the real power and Figure 11 illustrates the reactive power at bus 17 for both CPLF and CILF. From the results, it is confirmed that bus 17 is the best choice for the location and optimum sizing of DG is also obtained here. Subsequently, bus 3 and bus 4 have the appropriate size of DGs, which assures the confirmation of the DG location. The location and size of three DGs at the allotted location in the IEEE 33 bus system are shown in Figure 12.

3. Positioning and Impact of D-STATCOM

The positioning and impact of D-STATCOM in the IEEE-33 bus system have to be assessed for improving the power quality performance parameters such as THD and voltage profile. The rating of D-STATCOM is 1 pu reactive power. In order to improve power quality performance, control of D-STATCOM is decided by using the fuzzy logic controller. In this article, only one D-STATCOM is used, so it has to be connected at that bus where large distortions are present. In order to define the inputs and output of FLC, Equation (9) is further used. Now, we differentiate Equation (9) to obtain the optimal solution.
Let s   define   E = S i S r e f
d ( J ) d E = 0
Equation (27) enables us to differentiate J with respect to E as given in Equation (28). After differentiating, Equation (29) is obtained:
e | E | 2 2 σ 2 = S r a t e d σ 2 π | C 1 S i + C 2 S r e f | 2 ( S i S l o a d )
By arranging the terms in Equation (29) and by taking log on both sides, the value of E is obtained as given by Equation (30).
E = 2 σ 2 log ( | C 1 S i + C 2 S r e f | 2 ( S i S l o a d ) | S r a t e d σ 2 π | )
Equation (30) gives the optimal solution. Now, the inputs to FLC are error (E) and change in error (ΔE) which are shown in Equation (31) as:
Δ E = E ( t ) E ( t 1 )
The detailed structure of the D-STATCOM-based FLC controller is shown in Figure 13 and Figure 14. In Figure 13, distorted real and reactive power is measured and passes through the PID controller which generates the measured complex power. The measured complex power is compared with its reference value which produces error. The error and derivative of error act as inputs to FLC. The actual design of FLC for D-STATCOM switching is shown in Figure 14. The output of FLC is reference voltage which is compared with reference value and generates pulses for switching the D-STATCOM. In the same pattern, ΔE can be expressed in standard form.
In order to design rules of the fuzzy set, a 7 × 7 matrix is taken so that the model will have more precise and better results. This means both inputs have seven membership functions. Using Cramer’s product rule, FLC rule is designed as shown in Figure 15 and its surface view is shown in Figure 16. Table 13 and Table 14 show the notification of membership function for first input, as initial error E is around 0.12 and mapping of input with output, respectively.
From Table 13 and Table 14, it can be demonstrated that, under certain parameters, a precise control of objectives can be achieved using fuzzy observations, mapping, and control, if the observations become sufficiently accurate as the goal is approached.
The seven membership functions corresponding to the first input are shown in Equation (32) and these seven membership functions are taken from x1 to x7. The seven membership functions are chosen in order to have better and more precise results. The nature of the membership function is triangular and input is split into seven membership functions. Each membership function from x1 to x7 is assigned with values in the numerator as shown in Equation (32).
E = 0.03 x 1 + 0.06 x 2 + 0.09 x 3 + 0.12 x 4 + 0.09 x 5 + 0.06 x 6 + 0.03 x 7
Dividing Equation (32) by 0.12, Equation (33) is obtained as:
E = 0.25 x 1 + 0.50 x 2 + 0.75 x 3 + 1 x 4 + 0.75 x 5 + 0.50 x 6 + 0.25 x 7
Notification of membership function for the second input is given in Equation (34):
Δ E = 0.15 x 1 + 0.40 x 2 + 0.65 x 3 + 0.9 x 4 + 0.65 x 5 + 0.40 x 6 + 0.15 x 7
From the Cartesian product rule:
A = E B = Δ E ,   A   U   B =   max   ( A   o r   B )
Further membership function is taken as:
x 1 = N B , x 2 = N M , x 3 = N S , x 4 = Z S , x 5 = P S , x 6 = P M , x 7 = P B
Table 15 gives the comparative analysis of voltage profile at different buses with different existing techniques and D-STATCOM-based FLC for both CPLF and CILF load; whereas computational expression of THD is given by Equation (35).
Table 16 gives the comparative analysis of THD (%) of real power different buses with different existing techniques and D-STATCOM-based FLC for both CPLF and CILF load.
T H D = 1 g 2 1
where ‘g’ is distortion factor which is defined as ratio of rms fundamental harmonic value to rms value of voltage.
Now, a suitable location for D-STATCOM at a particular bus has to be decided. From Figure 9 and Figure 10, it can be inferred that voltage profile and THD (%) of the real power at bus 10 are found to be worst with existing methods such as harmony search algorithm [4], ant colony algorithm [9], and big-bang–crunch method [30] for both CPLF and CILF. Therefore, D-STATCOM is placed at bus 10. Figure 17 and Figure 18 show the voltage (pu) comparisons at bus 10 for CPLF and CILF. It is also observed that switching of D-STATCOM with FLC improves its voltage profile and THD (%). This means that switching of D-STATCOM with FLC helps to improve the performance parameters in comparison to existing methods. The comparison of voltage profile and THD (%) of real power at bus 10 with existing techniques and D-STATCOM-based FLC is shown in Table 17 and Table 18 and its graphical comparison is shown in Figure 19 and Figure 20.

4. Result Summary

This article shows location and sizing of three DGs for CPLF and CILF types of load using GA and heuristic PDF method. The location of the DGs was obtained based on three different parameters such as line power losses, accuracy, and sensitivity. The application of GA method shows that all three parameters of DG placement are improved in comparison with the heuristic PDF method as well as existing methods such as ant-lion optimization algorithm, coyote optimizer, modified sine-cosine algorithm, and particle swarm optimization. It is also observed that after obtaining optimal location for DG placement at bus 17, optimal sizing for DG has been determined among all buses and the most optimal solution turns out to be at bus 17 in terms of minimum real and reactive power. It is found that determination of size of DG is quite satisfactorily observed under GA in comparison to the heuristic PDF method, ant-lion optimization algorithm, coyote optimizer, modified sine-cosine algorithm, and particle swarm optimization. Subsequently, bus 3 and bus 4 are the second and third best locations for placement of DGs with optimal size. Now, positioning of D-STATCOM on the IEEE 33 bus system is assessed in such a way that the bus with the worst performance in terms of THD and voltage profile has to be detected. On the basis of the analysis performed, bus 10 is found to be most suitable for locating the D-STATCOM. Afterwards, in order to improve the THD and voltage profile, switching of D-STATCOM is performed through FLC, consequently showing superiority over other existing methods. The current research will provide considerable expertise and also acts as a guide for researchers, including utility engineers, regarding problems to be addressed in order to optimize the size and position of DG units within electrical power systems. The metaheuristic computation approaches recently unveiled could be implemented for optimal design and fitting of DG in network delivery in future.

5. Conclusions

This article presents the optimal location and sizing of three DGs in the IEEE 33 bus test system by using the heuristic PDF method and GA for CPLF and CILF. Associated bus locations are examined for analysis of the impact of optimal placement and size of DG. The optimal locations of DGs are selected in terms of performance parameters such as line power losses, sensitivity, and accuracy while sizing of DG is obtained in terms of real and reactive power. It is evident that the parameters such as voltage profile, line power loss, accuracy, sensitivity, THD, etc. are improved with the GA method as compared to the heuristic PDF method and other existing methods such as the ant-lion optimization algorithm, coyote optimizer, modified sine-cosine algorithm, and particle swarm optimization. It is also confirmed that determining DG size is resolved quite satisfactorily with the GA method in terms of real power and reactive power, rather than heuristic PDF and other existing methods. Further positioning of D-STATCOM is being decided on the basis of bus having the worst voltage profile and THD (%) of real power. The D-STATCOM is controlled with FLC which gives improved voltage and less THD of real power in comparison to existing techniques.

Author Contributions

Conceptualization, P. and M.S.; formal analysis, P., A.A. and S.S.M.G.; funding acquisition, S.S.M.G.; investigation, A.A.; methodology, P., M.S. and A.A.; project administration, P., A.A. and S.S.M.G.; resources, S.S.M.G.; software, P. and M.S.; supervision, P., A.S.S. and M.S.; validation, P. and M.S.; visualization, P., A.S.S., M.S. and A.A.; writing—original draft, P., A.S.S. and M.S.; writing—review and editing, P., A.A. and S.S.M.G. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by TAIF UNIVERSITY RESEARCHERS SUPPORTING PROJECT, grant number TURSP-2020/34”, Taif University, Taif, Saudi Arabia, and “The APC was funded by SHERIF GHONEIM”.

Data Availability Statement

All data generated or analysed during this study are included in this research article and any relevant information related to the current study are available from the corresponding author on reasonable request.

Acknowledgments

The authors would like to acknowledge the financial support received from Taif University Researchers Supporting Project Number (TURSP-2020/34), Taif University, Taif, Saudi Arabia.

Conflicts of Interest

The authors declare no conflict of interest.

Abbreviations

DGDistributed generatorδiLoad angle
CPLFConstant power load flowθiImpedance angle at ‘i’ bus
CILFConstant impedance load flowθjImpedance angle at ‘j’ bus
FLCFuzzy logic controllerƐTolerance limit
GAGenetic AlgorithmyrInitial code of string
D-STATCOMDistribution static compensatorλDifference between measured and reference power
THDTotal harmonic distortionσStandard deviation
PDFProbability distribution methodEError
PWMPulse width modulationNBNegative big
SijComplex power between 2 buses i & jNMNegative medium
PijReal power between 2 buses i & jNSNegative small
QijReactive power between 2 buses i & jPBPositive big
SlossComplex power lossPMPositive medium
GijConductance between i & j busPSPositive small
BijSusceptance between ‘i’ & ‘j’ busZSZero

References

  1. Bernardon, D.P.; Mello, A.P.C.; Pfitscher, L.L.; Canha, L.N.; Abaide, A.R.; Ferreira, A.A. Real-time reconfiguration of distribution network with distributed generation. Electr. Power Syst. Res. 2014, 107, 59–67. [Google Scholar] [CrossRef]
  2. Chicco, G.; Mazza, A. An overview of the probability-based methods for optimal electrical distribution system reconfiguration. In Proceedings of the Fourth International Symposium on Electrical and Electronics Engineering (ISEEE), Galați, Romania, 11–13 October 2013; pp. 1–10. [Google Scholar]
  3. Chan, C.-M.; Liou, H.-R.; Lu, C.-N. Operation of distribution feeders with electric vehicle charging loads. In Proceedings of the 2012 IEEE 15th International Conference on Harmonics and Quality of Power (ICHQP), Hong Kong, China, 17–20 June 2012; pp. 695–700. [Google Scholar]
  4. Ganguly, S.; Samajpati, D. Distributed generation allocation on radial distribution networks under uncertainties of load and generation using genetic algorithm. IEEE Trans. Sustain. Energy 2015, 6, 688–697. [Google Scholar] [CrossRef]
  5. Martins, V.F.; Borges, C.L.T. Active distribution network integrated planning incorporating distributed generation and load response uncertainties. IEEE Trans. Power Syst. 2011, 26, 2164–2172. [Google Scholar] [CrossRef]
  6. Salman, N. Practical mitigation of voltage sag in distribution networks by combining network reconfiguration and DSTATCOM. In Proceedings of the IEEE International Conference on Power and Energy (PECON2010), Kualalumpur, Malaysia, 29 November–1 December 2010. [Google Scholar]
  7. Li, G.; Shi, D.; Duan, X.; Li, H.; Yao, M. Multiobjective optimal network reconfiguration considering the charging load of PHEV. In Proceedings of the Power and Energy Society General Meeting, San Diego, CA, USA, 22–26 July 2012; IEEE: New York, NY, USA, 2012; pp. 1–8. [Google Scholar]
  8. Pandi, V.R.; Zeineldin, H.H.; Xiao, W. Determining optimal location and size of distributed generation resources considering harmonic and protection coordination limits. IEEE Trans. Power Syst. 2013, 28, 1245–1254. [Google Scholar] [CrossRef]
  9. Swarnkar, A.; Gupta, N.; Niazi, K.R. Optimal placement of fixed and switched shunt capacitors for large-scale distribution systems using genetic algorithms. In Proceedings of the Innovative Smart Grid Technologies Conf. Europe (ISGT Europe), Gothenburg, Sweden, 11–13 October 2010; IEEE: New York, NY, USA, 2010; pp. 1–8. [Google Scholar]
  10. Farahani, V.; Vahidi, B.; Abyaneh, H.A. Reconfiguration and capacitor placement simultaneously for energy loss reduction based on an improved reconfiguration method. IEEE Trans. Power Syst. 2012, 27, 587–595. [Google Scholar] [CrossRef]
  11. Tuladhar, S.R.; Singh, J.G.; Ongsakul, W. Multi-objective approach for distribution network reconfiguration with optimal DG power factor using NSPSO. IET Gener. Transm. Distrib. 2016, 10, 2842–2851. [Google Scholar] [CrossRef]
  12. Jasthi, K.; Das, D. Simultaneous distribution system reconfiguration and DG sizing algorithm without load flow solution. IET Gener. Transm. Distrib. 2017, 12, 1303–1313. [Google Scholar] [CrossRef]
  13. Kalambe, S.; Agnihotri, G. Loss minimization techniques used in distribution network: Bibliographical survey. Renew. Sust. Energy Rev. 2014, 29, 184–200. [Google Scholar] [CrossRef]
  14. Muhammad, M.A.; Mokhlis, H.; Naidu, K.; Franco, J.F.; Illias, H.A.; Wang, L. Integrated data base approach in multi-objective network reconfiguration for distribution system using discrete optimisation techniques. IET Gener. Transm. Distrib. 2018, 12, 976–986. [Google Scholar] [CrossRef] [Green Version]
  15. Lalitha, M.P.; Reddy, V.V.; Usha, V. Optimal Dg placement for minimum real power loss in radial distribution system using PSO. J. Theor. Appl. Inf. Technol. 2010, 13, 107–116. [Google Scholar]
  16. Gözel, T.; Hocaoglu, M.H. An analytical method for the sizing and siting of distributed generators in radial systems. Electr. Power Syst. Res. 2009, 79, 912–918. [Google Scholar] [CrossRef]
  17. Zhang, S.; Cheng, H.; Li, K.; Bazargan, M.; Yao, L. Optimal siting and sizing of intermittent distributed generators in distribution system. IEEJ Trans. Electr. Electron. Eng. 2015, 10, 628–635. [Google Scholar] [CrossRef]
  18. Kumar, K.S.; Jayabarathi, T. Power system reconfiguration and loss minimization for a distribution systems using bacterial foraging optimization algorithm. Int. J. Electr. Power Energy Syst. 2012, 36, 13–17. [Google Scholar] [CrossRef]
  19. Kaur, M.; Ghosh, S. Network reconfiguration of unbalanced distribution networks using fuzzy-firefly algorithm. Appl. Soft Comput. 2016, 49, 868–886. [Google Scholar] [CrossRef]
  20. Hung, D.Q.; Mithulananthan, N. Multiple distributed generator placement in primary distribution networks for loss reduction. IEEE Trans. Ind. Electron. 2013, 60, 1700–1708. [Google Scholar] [CrossRef]
  21. Angelim, J.H.; Affonso, C.M. Impact of distributed generation technologyand location on power system voltage stability. IEEE Latin Am. Trans. 2016, 14, 1758–1765. [Google Scholar] [CrossRef]
  22. Wu, Y.-K.; Lee, C.-Y.; Liu, L.-C.; Tsai, S.H. Study of reconfiguration for the distribution system with distributed generators. IEEE Trans. Power Deliv. 2010, 25, 1678–1685. [Google Scholar] [CrossRef]
  23. Liu, K.-Y.; Sheng, W.; Liu, Y.; Meng, X. A network reconfiguration method considering data uncertainties in smart distribution networks. Energies 2017, 10, 618. [Google Scholar] [CrossRef] [Green Version]
  24. Rao, R.; 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]
  25. Prabha, D.R.; Jayabarathi, T.; Umamageswari, R.; Saranya, S. Optimal location and sizing of distributed generation unit using intelligent water drop algorithm. Sustain. Energy Technol. Assess. 2015, 11, 106–113. [Google Scholar] [CrossRef]
  26. Rezk, H.; Abdelkareem, M.A.; Ghenai, C. Performance evaluation and optimal design of stand-alone solar PV-battery system for irrigation in isolated regions: A case study in Al Minya (Egypt). Sustain. Energy Technol. Assess. 2019, 36, 100556. [Google Scholar] [CrossRef]
  27. El-Zonkoly, A.M. Optimal placement of multi-distributed generation units including different load models using particle swarm optimization. Swarm Evol. Comput. 2011, 1, 50–59. [Google Scholar] [CrossRef]
  28. Naik, S.G.; Khatod, D.K.; Sharma, M.P. 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]
  29. Sandeep, K.; Ganesh, K.; Jaydev, S. A MINLP technique for optimal placement of multiple DG units in distribution systems. Electr. Power Energy Syst. 2014, 63, 609–617. [Google Scholar]
  30. Othman, M.M.; Walid, E.; Yasser, G.H.; Almoataz, Y.A. Optimal placement and sizing of distributed generators in unbalanced distribution systems using supervised big bang-big crunch method. IEEE Trans. Power Syst. 2015, 30, 911–919. [Google Scholar] [CrossRef]
  31. Naresh, A.; 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]
  32. Mithulananthan, N.; Oo, T.; Phu, L.V. Distributed generator placement in power distribution system using genetic algorithm to reduce losses. TIJSAT 2004, 9, 55–62. [Google Scholar]
  33. Hamed, S.H. Intelligent water drops algorithm: A new optimization method for solving the multiple knapsack problem. Int. J. Intell. Comput. Cybern. 2008, 1, 193–212. [Google Scholar]
  34. Muqbel, A.; Elsayed, A.H.; Abido, M.A.; Mantawy, A.A.; Al-Awami, A.T.; El-Hawary, M. Optimal Sizing and Location of Solar Capacity in an Electrical Network Using Lightning Search Algorithm. Electr. Power Compon. Syst. 2020, 47, 1247–1260. [Google Scholar] [CrossRef]
  35. Siahbalaee, J.; Rezanejad, N.; Gharehpetian, G.B. Reconfiguration and DG Sizing and Placement Using Improved Shuffled Frog Leaping Algorithm. Electr. Power Compon. Syst. 2020, 47, 1475–1488. [Google Scholar] [CrossRef]
  36. Baran, M.E.; Wu, F.F. Network reconfiguration in distribution systems for loss reduction and load balancing. IEEE Trans. Power Deliv. 1989, 4, 1401–1407. [Google Scholar] [CrossRef]
  37. Bagherinezhad, A.; Palomino, A.D.; Li, B.; Parvania, M. Spatio-Temporal Electric Bus Charging Optimization with Transit Network Constraints. IEEE Trans. Ind. Appl. 2020, 56, 5741–5749. [Google Scholar] [CrossRef]
  38. Elmetwaly, A.H.; Eldesouky, A.A.; Sallam, A.A. An Adaptive D-FACTS for Power Quality Enhancement in an Isolated Microgrid. IEEE Access 2020, 8, 57923–57942. [Google Scholar] [CrossRef]
  39. Castiblanco-Pérez, C.M.; Toro-Rodríguez, D.E.; Montoya, O.D.; Giral-Ramírez, D.D. Optimal Placement and Sizing of D-STATCOM in Radial and Meshed Distribution Networks Using a Discrete-Continuous Version of the Genetic Algorithm. Electronics 2021, 10, 1452. [Google Scholar] [CrossRef]
  40. Yuvaraj, T.; Devabalaji, K.; Ravi, K. Optimal Placement and Sizing of DSTATCOM Using Harmony Search Algorithm. Energy Procedia 2015, 79, 759–765. [Google Scholar] [CrossRef] [Green Version]
  41. Rukmani, D.K.; Thangaraj, Y.; Subramaniam, U.; Ramachandran, S.; Madurai Elavarasan, R.; Das, N.; Baringo, L.; Imran Abdul Rasheed, M. A New Approach to Optimal Location and Sizing of DSTATCOM in Radial Distribution Networks Using Bio-Inspired Cuckoo Search Algorithm. Energies 2020, 13, 4615. [Google Scholar] [CrossRef]
  42. Moayedi, H.; Mosavi, A. Synthesizing Multi-Layer Perceptron Network with Ant lion Biogeography-Based Dragonfly Algorithm Evolutionary Strategy Invasive Weed and League Champion Optimization Hybrid Algorithms in Predicting Heating Load in Residential Buildings. Sustainability 2021, 13, 3198. [Google Scholar] [CrossRef]
  43. Kamel, S.; Amin, A.; Selim, A. Application of coyote optimizer for Optimal DG Placement in Radial Distribution Systems. In Proceedings of the 2019 International Conference on Computer, Control, Electrical, and Electronics Engineering ICCCEEE, Khartoum, Sudan, 21–23 September 2019. [Google Scholar]
  44. Qu, C.; Zeng, Z.; Dai, J.; Yi, Z.; He, W. A Modified Sine-Cosine Algorithm Based on Neighborhood Search and Greedy Levy Mutation. Comput. Intell. Neurosci. 2018, 2018, 4231647. [Google Scholar] [CrossRef]
  45. Al-Masri, H.M.K.; Al-Sharqi, A.A.; Magableh, S.K.; Al-Shetwi, A.Q.; Abdolrasol, M.G.M.; Ustun, T.S. Optimal Allocation of a Hybrid Photovoltaic Biogas Energy System Using Multi-Objective Feasibility Enhanced Particle Swarm Algorithm. Sustainability 2022, 14, 685. [Google Scholar] [CrossRef]
Figure 1. Flowchart of heuristic PDF method.
Figure 1. Flowchart of heuristic PDF method.
Sustainability 14 03305 g001
Figure 2. IEEE 33 bus test system.
Figure 2. IEEE 33 bus test system.
Sustainability 14 03305 g002
Figure 3. Flowchart representing the GA.
Figure 3. Flowchart representing the GA.
Sustainability 14 03305 g003
Figure 4. Real power loss at bus 17 after 150 iterations using GA for CPLF.
Figure 4. Real power loss at bus 17 after 150 iterations using GA for CPLF.
Sustainability 14 03305 g004
Figure 5. Real power loss at bus 17 after 155 iterations using GA for CILF.
Figure 5. Real power loss at bus 17 after 155 iterations using GA for CILF.
Sustainability 14 03305 g005
Figure 6. Real power loss comparison for CPLF.
Figure 6. Real power loss comparison for CPLF.
Sustainability 14 03305 g006
Figure 7. Real power loss comparison for CILF.
Figure 7. Real power loss comparison for CILF.
Sustainability 14 03305 g007
Figure 8. Real power at bus 17 after150 iterations for CPLF.
Figure 8. Real power at bus 17 after150 iterations for CPLF.
Sustainability 14 03305 g008
Figure 9. Reactive power at bus 17 after 150 iterations using GA for CPLF.
Figure 9. Reactive power at bus 17 after 150 iterations using GA for CPLF.
Sustainability 14 03305 g009
Figure 10. Real power at bus 17 after 155 iterations using GA for CILF.
Figure 10. Real power at bus 17 after 155 iterations using GA for CILF.
Sustainability 14 03305 g010
Figure 11. Reactive power at bus 17 after 155 iterations using GA for CILF.
Figure 11. Reactive power at bus 17 after 155 iterations using GA for CILF.
Sustainability 14 03305 g011
Figure 12. Layout of the IEEE 33 bus system with allocated positioning and sizing of DG and D-STATCOM.
Figure 12. Layout of the IEEE 33 bus system with allocated positioning and sizing of DG and D-STATCOM.
Sustainability 14 03305 g012
Figure 13. Structure of D-STATCOM-based FLC controller.
Figure 13. Structure of D-STATCOM-based FLC controller.
Sustainability 14 03305 g013
Figure 14. Switching of D-STATCOM.
Figure 14. Switching of D-STATCOM.
Sustainability 14 03305 g014
Figure 15. Fuzzy rules of FLC.
Figure 15. Fuzzy rules of FLC.
Sustainability 14 03305 g015
Figure 16. Surface view of FLC between inputs and output.
Figure 16. Surface view of FLC between inputs and output.
Sustainability 14 03305 g016
Figure 17. Voltage comparison at bus 10 for CPLF.
Figure 17. Voltage comparison at bus 10 for CPLF.
Sustainability 14 03305 g017
Figure 18. Voltage comparison at bus 10 for CILF.
Figure 18. Voltage comparison at bus 10 for CILF.
Sustainability 14 03305 g018
Figure 19. Graphical voltage comparison at bus 10 with different methods for CPLF and CILF.
Figure 19. Graphical voltage comparison at bus 10 with different methods for CPLF and CILF.
Sustainability 14 03305 g019
Figure 20. Graphical THD (%) of real power comparison at bus 10 with different methods for CPLF and CILF.
Figure 20. Graphical THD (%) of real power comparison at bus 10 with different methods for CPLF and CILF.
Sustainability 14 03305 g020
Table 1. Constant parameter value for CPLF and CILF.
Table 1. Constant parameter value for CPLF and CILF.
Load Typexy
CPLF00
CILF1.81.8
Table 2. Performance parameter of DG at different locations for the IEEE 33 bus system with the heuristic PDF method for CPLF and CILF.
Table 2. Performance parameter of DG at different locations for the IEEE 33 bus system with the heuristic PDF method for CPLF and CILF.
Bus No.CPLFCILF
Real Power Losses (pu)Accuracy (pu)Sensitivity (pu)Real Power Losses (pu)Accuracy (pu)Sensitivity (pu)
10.310.0310.0560.320.0710.066
20.290.0290.0470.310.0870.065
30.270.0210.0570.290.0780.061
40.210.0190.0560.300.0790.055
50.290.0250.0490.310.0800.061
60.280.0310.0540.270.0790.059
70.270.0490.0550.260.0800.057
80.310.0500.0610.250.0900.056
90.320.0710.0540.300.0690.055
100.310.0720.0490.310.0910.053
110.290.0980.0950.410.0980.052
120.310.0980.0750.290.0840.049
130.270.0840.0850.280.0720.045
140.290.0870.0840.310.0730.044
150.310.0880.0450.330.0740.042
160.270.0860.0390.320.0780.043
170.250.0750.0390.270.0690.041
180.270.0690.0420.290.0810.048
190.310.0580.0250.390.0790.047
200.300.0470.0240.400.0810.046
210.270.0590.0340.280.0830.057
220.290.0980.0360.310.0870.051
230.310.0940.0540.320.0810.050
240.270.0950.0450.330.0790.065
250.290.0890.0780.270.0740.079
260.270.0750.0840.310.0720.065
270.310.0610.0840.300.0770.054
280.330.0720.0940.320.0760.051
290.340.0650.0180.330.0750.053
300.350.0500.0450.310.0910.064
310.420.0640.0610.410.0940.091
320.410.0420.0820.430.0800.085
330.390.0840.0830.390.0780.084
Table 3. Performance parameter of DG at different locations for the modified IEEE 33 bus system with GA for CPLF and CILF.
Table 3. Performance parameter of DG at different locations for the modified IEEE 33 bus system with GA for CPLF and CILF.
Bus No.CPLFCILF
Real Power Losses (pu)Accuracy (pu)Sensitivity (pu)Real Power Losses (pu)Accuracy (pu)Sensitivity (pu)
10.290.0290.0520.300.0690.061
20.270.0270.0440.290.0820.059
30.240.0190.0500.270.0760.060
40.230.0170.0510.270.0780.052
50.250.0160.0420.300.0770.058
60.220.0240.0510.250.0780.055
70.240.0400.0500.250.0720.049
80.290.0450.0520.250.0840.051
90.280.0550.0500.260.0610.049
100.270.0560.0480.300.0890.050
110.280.0810.0470.380.0940.050
120.290.0890.0690.290.0820.045
130.250.0790.0790.270.0700.044
140.250.0790.0780.280.0710.043
150.250.0790.0310.320.0720.041
160.260.0760.0370.310.0750.041
170.210.0700.0340.230.0610.039
180.230.0650.0320.280.0700.041
190.280.0510.0210.340.0710.045
200.290.0450.0220.390.0720.041
210.260.0520.0310.230.0770.051
220.290.0910.0350.300.0810.047
230.300.0900.0510.300.0790.047
240.220.0910.0440.290.0710.047
250.260.0810.0710.210.0690.074
260.250.0700.0810.300.0690.064
270.230.0890.0800.290.0710.051
280.310.0900.0790.310.0720.049
290.300.0910.0150.320.0710.047
300.310.0810.0350.240.0850.059
310.400.0890.0510.390.0840.082
320.340.0810.0730.410.0770.071
330.320.0820.0750.340.0710.077
Table 4. Performance parameter of DG at different locations for the IEEE 33 bus system with the ant-lion optimization algorithm [42] for CPLF and CILF.
Table 4. Performance parameter of DG at different locations for the IEEE 33 bus system with the ant-lion optimization algorithm [42] for CPLF and CILF.
Bus No.CPLFCILF
Real Power Losses (pu)Accuracy (pu)Sensitivity (pu)Real Power Losses (pu)Accuracy (pu)Sensitivity (pu)
10.40.0420.0640.370.0810.075
20.380.040.0550.360.0970.074
30.360.0320.0650.340.0880.07
40.30.030.0640.350.0890.064
50.380.0360.0570.360.090.07
60.370.0420.0620.320.0890.068
70.360.060.0630.310.090.066
80.40.0610.0690.30.10.065
90.410.0820.0620.350.0790.064
100.40.0830.0570.360.1010.062
110.380.1090.1030.460.1080.061
120.40.1090.0830.340.0940.058
130.360.0950.0930.330.0820.054
140.380.0980.0920.360.0830.053
150.40.0990.0530.380.0840.051
160.360.0970.0470.370.0880.052
170.340.0860.0470.320.0790.05
180.360.080.050.340.0910.057
190.40.0690.0330.440.0890.056
200.390.0580.0320.450.0910.055
210.360.070.0420.330.0930.066
220.380.1090.0440.360.0970.06
230.40.1050.0620.370.0910.059
240.360.1060.0530.380.0890.074
250.380.10.0860.320.0840.088
260.360.0860.0920.360.0820.074
270.40.0720.0920.350.0870.063
280.420.0830.1020.370.0860.06
290.430.0760.0260.380.0850.062
300.440.0610.0530.360.1010.073
310.510.0750.0690.460.1040.1
320.50.0530.090.480.090.094
330.480.0950.0910.440.0880.093
Table 5. Performance parameter of DG at different locations for the IEEE 33 bus system with the coyote optimizer [43] for CPLF and CILF.
Table 5. Performance parameter of DG at different locations for the IEEE 33 bus system with the coyote optimizer [43] for CPLF and CILF.
Bus No.CPLFCILF
Real Power Losses (pu)Accuracy (pu)Sensitivity (pu)Real Power Losses (pu)Accuracy (pu)Sensitivity (pu)
10.440.0510.0680.420.0880.082
20.420.0490.0590.410.1040.081
30.40.0410.0690.390.0950.077
40.340.0390.0680.40.0960.071
50.420.0450.0610.410.0970.077
60.410.0510.0660.370.0960.075
70.40.0690.0670.360.0970.073
80.440.070.0730.350.1070.072
90.450.0910.0660.40.0860.071
100.440.0920.0610.410.1080.069
110.420.1180.1070.510.1150.068
120.440.1180.0870.390.1010.065
130.40.1040.0970.380.0890.061
140.420.1070.0960.410.090.06
150.440.1080.0570.430.0910.058
160.40.1060.0510.420.0950.059
170.380.0950.0510.370.0860.057
180.40.0890.0540.390.0980.064
190.440.0780.0370.490.0960.063
200.430.0670.0360.50.0980.062
210.40.0790.0460.380.10.073
220.420.1180.0480.410.1040.067
230.440.1140.0660.420.0980.066
240.40.1150.0570.430.0960.081
250.420.1090.090.370.0910.095
260.40.0950.0960.410.0890.081
270.440.0810.0960.40.0940.07
280.460.0920.1060.420.0930.067
290.470.0850.030.430.0920.069
300.480.070.0570.410.1080.08
310.550.0840.0730.510.1110.107
320.540.0620.0940.530.0970.101
330.520.1040.0950.490.0950.1
Table 6. Performance parameter of DG at different locations for the IEEE 33 bus system with the modified sine-cosine algorithm [44] for CPLF and CILF.
Table 6. Performance parameter of DG at different locations for the IEEE 33 bus system with the modified sine-cosine algorithm [44] for CPLF and CILF.
Bus No.CPLFCILF
Real Power Losses (pu)Accuracy (pu)Sensitivity (pu)Real Power Losses (pu)Accuracy (pu)Sensitivity (pu)
10.480.0590.0750.490.0960.089
20.460.0570.0660.480.1120.088
30.440.0490.0760.460.1030.084
40.380.0470.0750.470.1040.078
50.460.0530.0680.480.1050.084
60.450.0590.0730.440.1040.082
70.440.0770.0740.430.1050.08
80.480.0780.080.420.1150.079
90.490.0990.0730.470.0940.078
100.480.10.0680.480.1160.076
110.460.1260.1140.580.1230.075
120.480.1260.0940.460.1090.072
130.440.1120.1040.450.0970.068
140.460.1150.1030.480.0980.067
150.480.1160.0640.50.0990.065
160.440.1140.0580.490.1030.066
170.420.1030.0580.440.0940.064
180.440.0970.0610.460.1060.071
190.480.0860.0440.560.1040.07
200.470.0750.0430.570.1060.069
210.440.0870.0530.450.1080.08
220.460.1260.0550.480.1120.074
230.480.1220.0730.490.1060.073
240.440.1230.0640.50.1040.088
250.460.1170.0970.440.0990.102
260.440.1030.1030.480.0970.088
270.480.0890.1030.470.1020.077
280.500.1000.1130.490.1010.074
290.510.0930.0370.500.10.076
300.520.0780.0640.480.1160.087
310.590.0920.080.580.1190.114
320.580.070.1010.60.1050.108
330.560.1120.1020.560.1030.107
Table 7. Performance parameter of DG at different locations for the IEEE 33 bus system with the particle swarm optimization [45] for CPLF and CILF.
Table 7. Performance parameter of DG at different locations for the IEEE 33 bus system with the particle swarm optimization [45] for CPLF and CILF.
Bus No.CPLFCILF
Real Power Losses (pu)Accuracy (pu)Sensitivity (pu)Real Power Losses (pu)Accuracy (pu)Sensitivity (pu)
10.530.0620.0770.520.0990.094
20.510.060.0680.510.1150.093
30.490.0520.0780.490.1060.089
40.430.050.0770.500.1070.083
50.510.0560.070.510.1080.089
60.500.0620.0750.470.1070.087
70.490.080.0760.460.1080.085
80.530.0810.0820.450.1180.084
90.540.1020.0750.500.0970.083
100.530.1030.070.510.1190.081
110.510.1290.1160.610.1260.08
120.530.1290.0960.490.1120.077
130.490.1150.1060.480.10.073
140.510.1180.1050.510.1010.072
150.530.1190.0660.530.1020.07
160.490.1170.060.520.1060.071
170.470.1060.060.470.0970.069
180.490.10.0630.490.1090.076
190.530.0890.0460.590.1070.075
200.520.0780.0450.60.1090.074
210.490.090.0550.480.1110.085
220.510.1290.0570.510.1150.079
230.530.1250.0750.520.1090.078
240.490.1260.0660.530.1070.093
250.510.120.0990.470.1020.107
260.490.1060.1050.510.10.093
270.530.0920.1050.50.1050.082
280.550.1030.1150.520.1040.079
290.560.0960.0390.530.1030.081
300.570.0810.0660.510.1190.092
310.640.0950.0820.610.1220.119
320.630.0730.1030.630.1080.113
330.610.1150.1040.590.1060.112
Table 8. Performance comparison among different methods.
Table 8. Performance comparison among different methods.
TechniqueBus No.CPLFCILF
Real Power Loss
(pu)
Accuracy
(pu)
Sensitivity
(pu)
Real Power Loss
(pu)
Accuracy
(pu)
Sensitivity
(pu)
Heuristic method170.250.0750.0390.270.0690.041
30.270.0210.0570.290.0780.061
40.210.0190.0560.300.0790.055
Genetic Algorithm170.210.0700.0340.230.0610.039
30.240.0190.0500.270.0760.060
40.230.0170.0510.270.0780.052
Ant-lion optimization algorithm [42]170.340.0860.0470.320.0790.05
30.360.0320.0650.340.0880.07
40.30.030.0640.350.0890.064
Coyote optimizer [43]170.380.0950.0510.370.0860.057
30.40.0410.0690.390.0950.077
40.340.0390.0680.40.0960.071
Modified sine-cosine algorithm [44]170.420.1030.0580.440.0940.064
30.440.0490.0760.460.1030.084
40.380.0470.0750.470.1040.078
Particle Swarm optimization [45]170.470.1060.060.470.0970.069
30.490.0520.0780.490.1060.089
40.430.050.0770.500.1070.083
Table 9. DG size comparison for CPLF and CILF using GA and heuristic PDF.
Table 9. DG size comparison for CPLF and CILF using GA and heuristic PDF.
Bus No.CPLFCILF
Heuristic PDFGAHeuristic PDFGA
P (pu)Q (pu)P (pu)Q (pu)P (pu)Q (pu)P (pu)Q (pu)
11.010.981.020.991.091.020.991.02
21.020.941.100.961.030.991.010.99
31.050.850.850.781.101.010.900.89
41.230.990.910.811.090.950.810.91
51.121.011.310.751.110.991.290.76
61.030.941.050.731.051.021.010.85
71.040.961.060.741.070.951.100.72
80.910.950.950.911.020.970.990.84
90.890.810.970.820.950.950.940.92
101.020.951.030.760.980.921.010.96
110.991.000.991.021.021.050.981.01
120.981.010.991.030.991.030.921.01
131.891.031.951.041.711.021.841.00
140.851.050.851.050.971.051.121.01
150.941.090.941.101.000.990.991.10
160.941.110.981.010.991.020.941.08
170.890.900.780.710.840.980.760.70
180.951.130.961.041.051.100.991.01
190.941.840.991.880.921.210.941.08
201.001.241.071.441.101.121.021.40
211.001.111.081.211.091.011.021.01
220.951.241.981.341.011.101.911.21
230.801.001.891.441.021.081.211.01
240.810.991.851.000.951.011.011.09
250.791.201.841.220.891.121.001.12
260.841.211.851.230.941.121.021.11
270.990.992.001.020.960.961.011.10
280.980.841.750.861.031.011.050.95
290.990.951.820.981.210.991.510.97
301.330.991.720.991.230.921.100.94
310.991.001.811.011.421.011.021.08
321.201.011.511.051.471.111.011.06
331.051.121.311.151.251.101.011.01
Table 10. DG size comparison for CPLF and CILF using the ant-lion optimization algorithm [42] and coyote optimizer [43].
Table 10. DG size comparison for CPLF and CILF using the ant-lion optimization algorithm [42] and coyote optimizer [43].
Bus No.CPLFCILF
Ant-Lion Optimization Algorithm [42]Coyote Optimizer [43]Ant-Lion Optimization Algorithm [42]Coyote Optimizer [43]
P (pu)Q (pu)P (pu)Q (pu)P (pu)Q (pu)P (pu)Q (pu)
11.11.041.081.071.181.111.071.09
21.1111.161.041.121.081.091.06
31.140.910.910.861.191.10.980.96
41.321.050.970.891.181.040.890.98
51.211.071.370.831.21.081.370.83
61.1211.110.811.141.111.090.92
71.131.021.120.821.161.041.180.79
811.011.010.991.111.061.070.91
90.980.871.030.91.041.041.020.99
101.111.011.090.841.071.011.091.03
111.081.061.051.11.111.141.061.08
121.071.071.051.111.081.1211.08
131.981.092.011.121.81.111.921.07
140.941.110.911.131.061.141.21.08
151.031.1511.181.091.081.071.17
161.031.171.041.091.081.111.021.15
170.980.960.840.790.931.070.840.77
181.041.191.021.121.141.191.071.08
191.031.91.051.961.011.31.021.15
201.091.31.131.521.191.211.11.47
211.091.171.141.291.181.11.11.08
221.041.32.041.421.11.191.991.28
230.891.061.951.521.111.171.291.08
240.91.051.911.081.041.11.091.16
250.881.261.91.30.981.211.081.19
260.931.271.911.311.031.211.11.18
271.081.052.061.11.051.051.091.17
281.070.91.810.941.121.11.131.02
291.081.011.881.061.31.081.591.04
301.421.051.781.071.321.011.181.01
311.081.061.871.091.511.11.11.15
321.291.071.571.131.561.21.091.13
331.141.181.371.231.341.191.091.08
Table 11. DG size comparison for CPLF and CILF using the modified sine-cosine algorithm [44] and particle swarm optimization [45].
Table 11. DG size comparison for CPLF and CILF using the modified sine-cosine algorithm [44] and particle swarm optimization [45].
Bus No.CPLFCILF
Modified Sine-Cosine Algorithm [44]Particle Swarm Optimization [45]Modified Sine-Cosine Algorithm [44]Particle Swarm Optimization [45]
P (pu)Q (pu)P (pu)Q (pu)P (pu)Q (pu)P (pu)Q (pu)
11.191.11.141.151.271.21.151.16
21.21.061.221.121.211.171.171.13
31.230.970.970.941.281.191.061.03
41.411.111.030.971.271.130.971.05
51.31.131.430.911.291.171.450.9
61.211.061.170.891.231.21.170.99
71.221.081.180.91.251.131.260.86
81.091.071.071.071.21.151.150.98
91.070.931.090.981.131.131.11.06
101.21.071.150.921.161.11.171.1
111.171.121.111.181.21.231.141.15
121.161.131.111.191.171.211.081.15
132.071.152.071.21.891.221.14
141.031.170.971.211.151.231.281.15
151.121.211.061.261.181.171.151.24
161.121.231.11.171.171.21.11.22
171.071.020.90.871.021.160.920.84
181.131.251.081.21.231.281.151.15
191.121.961.112.041.11.391.11.22
201.181.361.191.61.281.31.181.54
211.181.231.21.371.271.191.181.15
221.131.362.11.51.191.282.071.35
230.981.122.011.61.21.261.371.15
240.991.111.971.161.131.191.171.23
250.971.321.961.381.071.31.161.26
261.021.331.971.391.121.31.181.25
271.171.112.121.181.141.141.171.24
281.160.961.871.021.211.191.211.09
291.171.071.941.141.391.171.671.11
301.511.111.841.151.411.11.261.08
311.171.121.931.171.61.191.181.22
321.381.131.631.211.651.291.171.2
331.231.241.431.311.431.281.171.15
Table 12. DG size comparison at the three best bus locations.
Table 12. DG size comparison at the three best bus locations.
Load TypeBus No.Heuristic MethodGenetic AlgorithmAnt-Lion Optimization Algorithm [42]Coyote Optimizer [43]Modified Sine-Cosine Algorithm [44]Particle Swarm Optimization [45]
P (pu)Q (pu)P (pu)Q (pu)P (pu)Q (pu)P (pu)Q (pu)P (pu)Q (pu)P (pu)Q (pu)
CPLF170.890.90.780.710.980.960.840.790.980.960.840.79
CILF0.840.980.760.70.931.070.840.770.931.070.840.77
CPLF31.050.850.850.781.140.910.910.861.140.910.910.86
CILF1.11.010.90.891.191.10.980.961.191.10.980.96
CPLF41.230.990.910.811.321.050.970.891.321.050.970.89
CILF1.090.950.810.911.181.040.890.981.181.040.890.98
Table 13. Mathematical notation of input and output.
Table 13. Mathematical notation of input and output.
EENBNMNSZSPSPMPB
0.150.400.650.90.650.400.15
NB0.250.250.400.650.90.650.400.25
NM0.500.500.500.650.90.650.500.50
NS0.750.750.750.750.90.750.750.75
ZS11111111
PS0.750.750.750.750.90.750.750.75
PM0.500.500.500.650.90.650.500.50
PB0.250.250.400.650.90.650.400.25
Table 14. Mapping of output with input.
Table 14. Mapping of output with input.
EENBNMNSZSPSPMPB
NBNMNSZSPSPMPBPM
NBNBNMNSZSPSPMPB
NMNMNMNSZSPSNMNM
NSNSNSNSZSNSNSNS
ZSZSZSZSZSZSZSZS
PSPSPSPSZSPSPSPS
PMPMPMNSZSPSPMPM
Table 15. Voltage (pu) comparisons at different buses with D-STATCOM-based FLC and existing methods.
Table 15. Voltage (pu) comparisons at different buses with D-STATCOM-based FLC and existing methods.
Bus No.Load TypeD-STATCOM-Based FLCHarmony Search Algorithm [4]Ant Colony Algorithm [9]Big-Bang–Crunch Method [30]
1CPLF0.860.810.780.74
CILF0.870.820.790.75
2CPLF0.860.810.780.74
CILF0.850.80.790.75
3CPLF0.870.820.810.77
CILF0.860.810.80.76
4CPLF0.850.80.780.74
CILF0.870.820.80.76
5CPLF0.860.810.770.73
CILF0.850.80.790.75
6CPLF0.850.80.790.75
CILF0.90.850.830.79
7CPLF0.90.850.830.79
CILF0.910.860.840.8
8CPLF0.910.860.830.79
CILF0.910.860.820.78
9CPLF0.910.860.840.8
CILF0.910.860.840.8
10CPLF10.980.970.93
CILF1.010.990.970.93
11CPLF0.90.850.820.78
CILF0.920.870.850.81
12CPLF0.760.710.870.83
CILF0.790.740.720.68
13CPLF0.80.750.730.69
CILF0.810.760.740.7
14CPLF0.790.740.720.68
CILF0.80.750.740.7
15CPLF0.80.750.730.69
CILF0.740.690.650.61
16CPLF0.890.840.810.77
CILF0.90.850.830.79
17CPLF0.990.970.940.9
CILF0.980.950.90.86
18CPLF0.950.90.890.85
CILF0.930.880.860.81
19CPLF0.970.920.910.87
CILF0.950.90.870.83
20CPLF0.960.910.890.85
CILF0.90.850.830.79
21CPLF0.910.860.840.8
CILF0.930.880.810.77
22CPLF0.940.890.840.8
CILF0.760.710.70.66
23CPLF0.750.70.690.65
CILF0.740.690.680.64
24CPLF0.730.680.670.63
CILF0.720.670.660.62
25CPLF0.710.660.640.6
CILF0.70.650.640.6
26CPLF0.710.660.640.6
CILF0.690.640.630.59
27CPLF0.70.650.620.58
CILF0.710.660.640.6
28CPLF0.720.670.650.61
CILF0.720.670.640.6
29CPLF0.720.670.650.61
CILF0.750.70.690.65
30CPLF0.760.710.70.66
CILF0.760.710.70.66
31CPLF0.810.760.740.7
CILF0.770.720.710.67
32CPLF0.780.730.720.68
CILF0.790.740.730.69
33CPLF0.80.750.740.7
CILF0.780.730.720.68
Table 16. THD (%) of real power comparison at different buses with D-STATCOM-based FLC and existing methods.
Table 16. THD (%) of real power comparison at different buses with D-STATCOM-based FLC and existing methods.
Bus No.Load TypeD-STATCOM-Based FLCHarmony Search Algorithm [4]Ant Colony Algorithm [9]Big-Bang–Crunch Method [30]
1CPLF6.817.818.218.82
CILF6.827.827.918.52
2CPLF7.818.819.129.73
CILF6.87.87.918.52
3CPLF7.718.719.119.72
CILF6.817.818.819.42
4CPLF6.87.89.119.72
CILF6.827.828.118.72
5CPLF6.817.818.18.71
CILF8.99.99.219.82
6CPLF6.87.89.179.78
CILF8.58.59.129.73
7CPLF8.48.49.149.75
CILF6.867.868.989.59
8CPLF6.867.869.129.73
CILF6.867.868.659.26
9CPLF7.58.58.889.49
CILF7.48.48.789.39
10CPLF5.29.129.8910.5
CILF6.39.659.6510.26
11CPLF7.68.68.899.5
CILF7.58.58.929.53
12CPLF6.717.717.878.48
CILF7.18.18.559.16
13CPLF7.68.68.779.38
CILF7.78.78.889.49
14CPLF7.18.18.99.51
CILF7.58.58.879.48
15CPLF6.757.757.878.48
CILF6.697.697.998.6
16CPLF6.847.847.988.59
CILF6.857.858.028.63
17CPLF6.27.259.029.63
CILF7.37.958.228.83
18CPLF6.97.97.998.6
CILF6.917.917.958.56
19CPLF6.927.928.258.86
CILF6.97.98.659.26
20CPLF6.917.918.148.75
CILF6.857.859.029.63
21CPLF6.867.869.229.83
CILF6.887.888.999.6
22CPLF6.897.898.559.16
CILF6.717.718.429.03
23CPLF6.77.78.118.72
CILF6.697.697.878.48
24CPLF6.687.687.988.59
CILF6.677.677.848.45
25CPLF6.667.667.928.53
CILF6.657.657.838.44
26CPLF6.667.667.88.41
CILF6.647.647.758.36
27CPLF6.657.657.798.4
CILF6.667.667.858.46
28CPLF6.677.677.878.48
CILF6.677.677.98.51
29CPLF6.677.677.758.36
CILF6.77.77.988.59
30CPLF6.697.697.878.48
CILF6.617.617.98.51
31CPLF6.667.667.968.57
CILF6.727.727.928.53
32CPLF6.737.737.938.54
CILF6.657.657.958.56
33CPLF6.57.57.848.45
CILF6.737.737.838.44
Table 17. Comparative analysis for voltage (pu) at bus 10 for both types of load.
Table 17. Comparative analysis for voltage (pu) at bus 10 for both types of load.
Load TypeFLCD-STATCOM-Based FLCHarmony Search Algorithm [4]Ant Colony Algorithm [9]
CPLF10.980.970.93
CILF1.010.990.970.93
Table 18. Comparative analysis for THD (%) of real power at bus 10 for both types of load.
Table 18. Comparative analysis for THD (%) of real power at bus 10 for both types of load.
Load TypeFLCD-STATCOM-Based FLCHarmony Search Algorithm [4]Ant Colony Algorithm [9]
CPLF5.29.129.8910.5
CILF6.39.659.6510.26
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Prashant; Siddiqui, A.S.; Sarwar, M.; Althobaiti, A.; Ghoneim, S.S.M. Optimal Location and Sizing of Distributed Generators in Power System Network with Power Quality Enhancement Using Fuzzy Logic Controlled D-STATCOM. Sustainability 2022, 14, 3305. https://doi.org/10.3390/su14063305

AMA Style

Prashant, Siddiqui AS, Sarwar M, Althobaiti A, Ghoneim SSM. Optimal Location and Sizing of Distributed Generators in Power System Network with Power Quality Enhancement Using Fuzzy Logic Controlled D-STATCOM. Sustainability. 2022; 14(6):3305. https://doi.org/10.3390/su14063305

Chicago/Turabian Style

Prashant, Anwar Shahzad Siddiqui, Md Sarwar, Ahmed Althobaiti, and Sherif S. M. Ghoneim. 2022. "Optimal Location and Sizing of Distributed Generators in Power System Network with Power Quality Enhancement Using Fuzzy Logic Controlled D-STATCOM" Sustainability 14, no. 6: 3305. https://doi.org/10.3390/su14063305

APA Style

Prashant, Siddiqui, A. S., Sarwar, M., Althobaiti, A., & Ghoneim, S. S. M. (2022). Optimal Location and Sizing of Distributed Generators in Power System Network with Power Quality Enhancement Using Fuzzy Logic Controlled D-STATCOM. Sustainability, 14(6), 3305. https://doi.org/10.3390/su14063305

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