# Optimal DG allocation and sizing in power system networks using swarm-based algorithms

## Abstract

Distributed generation (DG) units are power generating plants that are very important to the architecture of present power system networks. The benefit of the addition of these DG units is to increase the power supply to a network. However, the installation of these DG units can cause an adverse effect if not properly allocated and/or sized. Therefore, there is a need to optimally allocate and size them to avoid cases such as voltage instability and expensive investment costs. In this paper, two swarm-based meta-heuristic algorithms, particle swarm optimization (PSO) and whale optimization algorithm (WOA) were developed to solve optimal placement and sizing of DG units in the quest for transmission network planning. A supportive technique, loss sensitivity factors (LSF) was used to identify potential buses for optimal location of DG units. The feasibility of the algorithms was confirmed on two IEEE bus test systems (14- and 30-bus). Comparison results showed that both algorithms produce good solutions and they outperform each other in different metrics. The WOA real power loss reduction considering techno-economic factors in the IEEE 14-bus and 30-bus test system are 6.14 MW and 10.77 MW, compared to the PSOs’ 6.47 MW and 11.73 MW respectively. The PSO has a more reduced total DG unit size in both bus systems with 133.45 MW and 82.44 MW compared to WOAs’ 152.21 MW and 82.44 MW respectively. The paper unveils the strengths and weaknesses of the PSO and the WOA in the application of optimal sizing of DG units in transmission networks. \keywordsSwarm intelligence Optimization algorithms Power system networks Real and reactive power loss minimization Voltage profile improvement Economic constraints

## 1 Introduction

The planning of Power System Networks (PSN) with the integration of Distribution Generation (DG) is an important feature in the modern-day electric utility grid. There are certain parameters to be considered such as quantity and size of DG units, the best location, bus configuration, and even the most suitable DG unit technology to be used [11]. A common and central problem is the placing and sizing of DG units [11]. The wrong installation of DG units can have an adverse effect on power flow and voltage stability which will in turn cause an upsurge in line losses [1, 6], thereby inferring an increase in economic costs [9]. It is therefore important to find the optimal location and size of DG units in a PSN to solve certain objectives. The installation of DG units is not a linear problem. This means that the increase in the number of DG units does not directly improve grid performance.

The most reported objective in literature is the power loss minimization. Several methodologies have been proposed for improving common objective functions such as power loss minimization and voltage profile improvement. Analytical approaches (mathematical methods) and metaheuristic methods. Metaheuristic methods have been more consistent because of the combinatorial nature of the placing and sizing problem. Hence, better computational time and efficiency rate can be achieved with less expensive computation resources. In addition to the solving the complex problem, some techniques have been developed to reduce the complexity of the problem. Examples are power loss index (PLI), voltage stability index (VSI), and most recently loss sensitivity factor (LSF). These techniques have also been researched on, and improved overtime [25].

Over the last decade, meta-heuristic methods have been developed with or without supplementary techniques for optimal location and sizing of DG units in PSNs. Deghanian et al [8] presented a Non-dominated sorting genetic algorithm (NSGA-II) for finding optimal location of DG units with objective functions of system reliability improvement, total system cost reduction, and network loss minimization in distribution power system. The authors used the probabilistic load flow to simulate uncertainties in a power system. The algorithm was tested on a IEEE 37-bus test system.

Prakash and Lakshminarayana [37] presented PSO algorithm to place multiple DG units with the objective of minimizing power loss. Jamian et al [20] also presented a rank evolutionary PSO for optimal multiple DG placement for maximum power output. The results was compared other variants of the PSO.

Moradi and Abedini [30] proposed a hybrid algorithm, Intelligent Water Drops (IWD) and GA for optimally sizing and allocating DGs in a microgrid, for solving objectives such as power loss minimization and improvement of voltage stability. Voltage Stability Indices (VSI) was used for the identification of candidate buses. The hybrid algorithm was tested on a 33-bus and 69-bus system, and has a record computational time, which increases linearly with number of DG units.

Kaur at al [26] developed a mixed integer nonlinear programming (MINLP) for finding optimal placement and sizing of DG units with an objective function of loss minimization in distribution systems. The deterministic approach was carried out through branch and bound method using sequential programming. Combined loss sensitivity was used to shortlist candidate buses which was followed by the implementation of the algorithm. This method differs from approaches where the algorithm is solely used for optimal sizing while the technique would have catered for optimal placement. Scalfati et al [41] used a similar (but mixed integer linear programming) approach to optimally size energy sources in a DC microgrid, given the objective to minimize total cost of ownership. This was implemented for the planning and management phase of the microgrid.

Rastgou et al [39] implemented an improved harmony serach algorithm with sensitivity analysis for network expansion and planning in a DG-present grid network. Karimi et al [25] also worked on optimal planning using NSGA-II. The objectives were maximizing voltage stability, minimizing costs, minimizing voltage deviation, and reducing emission.

HassanzadehFard and Jalilian [17] developed a PSO algorithm to optimally size and site RE-based DG units, considering total cost minimization, total network power loss minimization, voltage stability improvement, and emission reduction, under varying loads. A 13-bus test radial network was used for evaluation.

Gampa and Das [14] presented a two-stage framework to sequentially find optimal location of DG units using sensitivity analysis and a fuzzy-heuristic to optimally size the DG units. This was done for reconfiguration of feeders considering real power loss reduction and voltage profile improvement.

Jeddi et al [21] implemented harmony algorithm for planning distribution networks. Profit maximization and reliability benefit were considered. Home-Ortiz et al [18] proposed a mixed integer conic programming (MICP) to optimally find type, size, and location of RE-based DG units.

Ali et al [4] used the ant lion optimization (ALO) algorithm alongside loss sensitivity factors (LSF) to optimal allocate and size DG units in a distribution network. This was done considering loading conditions and voltage profile improvement. The algorithm was tested on 33 a- and 69-bus test systems. Reddy et al [40] also used the ALO but alongside index vector technique to optimally place and size DG units. The technique was used to select buses for DG locations. The problem was solved considering power loss minimization. Their algorithm was tested on four IEEE test bus systems. The index vector was also used alongside whale optimization algorithm (WOA) [34] to sequentially place and size DG units, considering power loss minimization.

Rammoorthy and Ramachandran [38] applied the PSO to the optimal sizing of multiple DG units in transmission systems. The algorithm was implemented alongside the LSF technique to reduce power loss and enhance the voltage profile. The IEEE 30-bus system was used for evaluation. Mustaffa et al [32] also implemented an Adaptive Evolutionary Programming method on the IEEE 30-bus system, to reduce the total real power loss. The algorithm outperforms the PSO on four different scenarios.

To the best of the author’s knowledge, researchers have not studied the comparison of the application of the PSO and WOA to the optimal sizing problem in a meshed transmission network. More studies have been carried out on RDNs as compared to transmission networks. Most RDN studies consider a void network. On the other hand, transmission networks are considered as an existing network that comprises of units such as transformers, synchronous machines, and synchronous condensers [42]. This study endeavours to uncover the distinctive difference in performance between the implementation of the PSO and the WOA to the optimal sizing problem. Specifically, this paper implements the Loss Sensitivity Factor (LSF) alongside the WOA and the PSO for the optimal location and sizing of DG units in a meshed transmission network. The objective is to compare the total real and reactive power loss minimization and the voltage profile improvement results from the PSO and the WOA.

The rest of the paper is organized as follows. Section 2 discusses the modelling of a meshed transmission network where the important parameters and the load flow model are addressed. Section 3 discusses the addition of DG units to the network. The section further explains the technique for the selection criteria. The objective function for the sizing problem is discussed in Section 4, where the technical, economic cost and constraints are formulated. In Section 5, the PSO and the WOA are presented as the robust swarm intelligence for the sizing problem. Section 6 presents the results from the analysis. In doing so, the IEEE 14- and 30-bus was used as the testbed for evaluation. Finally, the conclusion is entailed in Section 7.

## 2 Mathematical Modelling of Meshed Transmission Network

The load flow problem is majorly formulated to analyze the normal operation state for power system networks. A practical representation of a meshed Transmission Network (TN) is illustrated in Figure 1. TNs can consist of electrical components such as transformers, capacitors, transmission lines, and impedance loads [42, 27]. A vital feature for the modelling of a TN is the use of nodes and branches, which represent the buses and transmission lines respectively. Nodes are classified into three major types namely , and slack nodes. The nodes possess the real and reactive () parameters and voltage magnitude and the angle will be calculated. The nodes are taken as known real power and voltage magnitude, . The slack node is considered as a special bus because of its singularity, i.e. there is only one slack bus in a TN. The known parameters for this node is voltage magnitude and angle ().

From the diagram, and represents an installed substation transformers’ real and reactive power from node . and represents an installed generators’ real and reactive power from node . The impedance on the line is represented as . The power equation can be expressed as follows;

(1) |

where and are the injected real and reactive power at node respectively. Here, is an element of an admittance matrix from node to and is the injected voltage at node .

The nodal equation can be written in terms of injected current

(2) |

### 2.1 Load Flow Studies

This study implemented the Newton-Raphson (N-R) algorithm to compute the bus voltage magnitudes and angles, real and reactive power of DGs, and real and reactive power loss of the PSN. The N-R algorithm is an iterative method which approximately converts non-linear simultaneous equations to linear simultaneous equations. N-R is known for a fast convergence characteristic, and performs better than most deterministic load flow technique [16]. For the N-R load flow, the injected current can be represented as shown in Equation (3),

(3) |

The injected current can be substituted for real and reactive power units as

(4) |

Therefore, real and reactive power can be derived by splitting Equation (4) as

(5) |

and

(6) |

The two equations are written in terms of and , and can be easily manipulated to solve for the Jacobian matrix as shown in Equation (7) [2, 31],

(7) |

where , and are elements in the Jacobian matrix, and and are the respective real and reactive power residuals from the scheduled and calculated values [31, 15]. They are represented as

(8) |

and

(9) |

The bus voltages and magnitudes can be estimated as

(10) |

and

(11) |

## 3 Addition of DG Units to Power System Networks

The addition of DG units in a bus network is determined by the characteristics of each bus under normal load conditions. The DG unit supplies real power [7] and can be represented as the difference between present real power and real power demand at the same node:

(12) |

where is the load demand at node while is the real power injection from DG unit at node .

### 3.1 Loss Sensitivity Factors

Loss sensitivity factor technique is an analytical approach to determine a proper location of DG units in a power system network. LSF is one method to lessen the job of an optimization algorithm, hence it is computed to reduce the solutions search space. This method was firstly developed for optimal capacitor placement and is based on the principle of linearization [33]. Its application for DG placement is not far-off. Sensitivity values are calculated (from base case) for each bus and are ranked in a descending order to form a priority list. The rate of change in real power loss (from Equation (17)) to the real power injection at a particular bus should be equals zero. The LSF equation [28, 24] is shown in (12).

Here,

(13) |

where

(14) |

Here, is the real power injected at node , which is the difference the generated real power and real potential load demand (from Equation (12)). Therefore, the real power injected from DG units.

(15) |

(16) |

## 4 Objective Function Formulation for the Problem

Optimal DG sizing in RDN reduces the real power loss and improves the voltage profile. The power loss can be represented as [22]:

(17) |

where

(18) |

and

(19) |

Here, and are the sending and the receiving bus respectively, while represent the branch impedance from bus to bus . Decrease in real power loss leads to the minimization of DG unit cost. However, increase in DG size may cause an adverse effect on the investment cost. Therefore, there is a need to handle the size of DGs at the potential buses (the location). The addition of DG units can also affect the voltage quality of the network, hence a voltage deviation technique is formulated as

(20) |

to check the voltage profile of each bus. The reference voltage, is set at zero and represents the voltage at each PQ bus after the addition of DG units. The objective functions are subjected to constraints.

### 4.1 Economic Objective Function

The cost generated while sizing the DGs is very important. Therefore, there is a need to minimize it simultaneously with the sizing objective [3, 35, 13, 43].

(21) |

Where the cost of DG unit is represented as , and represents the electricity tariff from the DG unit source. Here, is the connection factor to the grid, is the injected power at number of selected buses for the DG unit placement. The size of the DG unit is represented as .

The eco-technical objective function is formulated as the sum of the power loss objective () and the DG cost objective ().

### 4.2 Constraints

The operating voltage at every bus must satisfy the range at all buses. The bus voltage limit is formulated as

(22) |

where is the current voltage at bus . Then and are 0.98 and 1.01 respectively.

Rated thermal capacity must not be exceeded at each branch. Therefore, the branch current limit is defined as

(23) |

where and represent the sending and receiving nodes respectively.

#### Power Flow Balance

The total real and reactive power generation (from all DG units) must be equal to the total real and reactive load and the total real and reactive power loss [22]. Therefore, a balance of the power flow is calculated as shown below

(24) |

(25) |

From Equation (17),

(26) |

(27) | |||

where and is the conductance and susceptance of the transmission line respectively, and are the voltage magnitudes at sending node and receiving node , and are the voltage angles wrt and .

## 5 Proposed Algorithms

### 5.1 Particle Swarm Optimization

PSO is a computationally intelligent algorithm that uses the behavior of organisms (especially birds and fishes). The synergy and coordination of the behaviour of such organisms is based on the manipulation of distances to reach a desired goal. The organisms are represented as particles and they keep a memory of their coordinates [20]. During every iteration, the particles communicate and learn from each other. The best position of each particle is then evaluated and called the personal best (pbest). Then, the overall best position from the personal best of every particle is calculated as the global best (gbest). Every particle moves with respect to a velocity. This velocity is calculated using Equation (29). The PSO is dependent on the number of particles that will be needed for the search of solution space (swarm), weight, cognitive parameter, and social parameter. The weighting factors of the PSO is very important, as it determines the algorithms’ performance. In most cases, the parameters are replicated from previous successful studies. Cognitive, social, and weight are the parameters of the PSO. The random factors are induced for the stochastic nature of the algorithm. Each particles’ pbest is calculated as

(28) |

where

(29) |

Here, is the position of particle in time step and is the velocity of particle in time step . The best position of each particles in time step is represented as while is the global best of all particles in the swarm in time step . and represents the cognitive and social parameter while and represents the induced random parameter. The does not have the index because it belongs to a whole swarm and not a particle-specific experience. The velocity equation is comprised of components related to swarm behavior. The weight, is updated in such a way that it decays with respect to maximum number of iterations. This behavior is illustrated as [23]

(30) |

The implementation of the PSO algorithm for optimal sizing is well illustrated in Algorithm 1.

### 5.2 Whale Optimization Algorithm

The Whale optimization algorithm (WOA) was proposed by Mirjalili [29]. The algorithm has been successfully applied to many optimization problems including the optimal sizing problem. The algorithm involves the feeding nature of whales (specifically humpback whales). According to the intelligent behavioural nature of whales, they use a specific technique to target small fish that are close to the sea surface. This technique is called the bubble net feeding, where whales swim round a school of fish (prey) to form a 9-shaped bubble trail. In this algorithm, an initial solution is termed as the objective prey and assumed as the current best solution. During the course of iterations, other whales update their positions towards the best whale position. The WOA is mathematically modelled in three sections. (i) encircling prey (ii) bubble net hunting method and (iii) search the prey.

#### Encircling prey

This form of hunting is based on a circular positioning around a prey. The position of the whale moves towards the prey in a step-wise manner. It can be modelled as

(31) |

where
and is linearly reduced from 2 to 0, and where can take up random in and interval.

where

The current iteration is denoted by subscript and for the next iteration. represents the position vector and represents the current best solution.

#### Bubble net hunting method

This method is the exploitative phase of the algorithm. Figure 3 illustrates the mechanism of the shrinking approach. This behaviour is attained by decreasing the value of , as explained in Section 5.2.1. This behaviour is modelled as shown in Equation (31). The spiral hunting approach is a helic-shaped movement of whales from a position to hunt prey (the best solution) at a position . This is illustrated in Figure 4. The spiral equation is created as follows:

(32) |

The component simulates the spiral shape of the whale’s path, as shown in Figure 4. takes a value between [-1,1], and is a constant (usually 1) that gives the spiral shape regular definition. Since the whales can be shrink towards a prey or move spirally, there is a need to model this behaviour. A probability of 50% is choosen for both feeding mechanisms. The model is as follows:

(33) |

where is a random number between .

#### Search for prey

The WOA uses this technique to mainly overcome a possible local optimum. This is called the exploration phase, where whales search randomly according to check other possible solutions. By this, if the best solution is not global the search agent can still fall out to find other better solution in the global space. The use of this approach is dependent on the value of . If the value of is lesser than 1, Equation (31) is triggered, else Equation (34) is triggered. Equation 34 shows the model.

(34) |

where

,

represents the random whales’ position in current iteration. is the distance between current whale position, and the randomly selected whales’ position.

The implementation of the WOA algorithm for optimal sizing is well illustrated in Algorithm 2.

## 6 Implementation Results and Discussion

The algorithms were developed in the MATLAB environment (R2017a version) and simulations were run on an Intel(R) Core(TM) i7-3520M @ 2.90 GHz. The outcomes from the algorithms are presented in this section, and have been evaluated on the IEEE 14-bus and 30-bus test RDN system.

Parameters used in the algorithms are presented in Table 1. The metric is based on power loss minimization and voltage profile improvement. The approach uses a two-stage procedure for the optimal location and sizing of DG units. The LSF technique was used to identify the potential buses for placing the DG units. Then the meta-heuristic optimization algorithm was applied to calculate the optimal sizes of the DG units with respect to the potential locations. This two-stage approach is necessary for reducing the solution search space for the algorithms. The main work of the algorithms was done by the N-R load flow algorithm, which mainly uses the bus and branch data to compute the power losses. The parameter values of the algorithms are shown in Table 1 [10].

PSO | ||

Parameters | Description | Value |

POP | Population of bird flocks | 50 |

dim | Dimension | 4 |

maxIter | Number of iterations | 150 |

minimum weight | 0.4 | |

maximum weight | 0.9 | |

cognitive parameter | 2 | |

social parameter | 2 | |

WOA | ||

POP | Population of whales | 50 |

dim | Dimension | 4 |

maxIter | Number of iterations | 150 |

### 6.1 IEEE 14-Bus test system results

The DG unit sizes were initially chosen randomly within the DG limits for the potential bus locations. Thereafter, the objective function was computed based on the defined constraints. The total power losses were calculated for each algorithm. The base case was 100 MVA and 11 kV, with voltage magnitude limits between 1.01 and 0.98 pu, with the first bus assumed at 1.0 pu. The total load demand of the test system is 259 MW and 73.5 MVaR, with the real and reactive power loss as 13.593 MW and 56.910 respectively.

Real power | MW | Performance (%) |
---|---|---|

WOA Power loss technical | 8.00 | 69.76% |

WOA Power loss techno-economic | 6.14 | 121.50% |

PSO Power loss technical | 6.43 | 111.49% |

PSO Power loss techno-economic | 6.47 | 110.41% |

Reactive power | ||

WOA Power loss technical | 27.59 | 07.94% |

WOA Power loss techno-economic | 28.44 | 120.58 % |

PSO Power loss technical | 25.80 | 113.65% |

PSO Power loss techno-economic | 31.64 | 110.36% |

Real power | Performance (%) |
---|---|

WOA improvement technical | -19.73% |

WOA improvement techno-economic | 5.41% |

Reactive power | |

WOA improvement technical | -12.73% |

WOA improvement techno-economic | 5.41% |

The LSF was implemented to identify the candidate bus locations for optimal sizing of the DG units. The potential bus locations are 2, 8, 9, 10. These bus locations are selected based on the values close to zero, and are prioritized in a descending manner. The first four indices of the bus configuration are selected.

Figure 7 illustrates the real power loss on each bus. The PSO while considering techno-economic objective, reduces the real power loss. The WOA comes close but only with the consideration of the technical objective. A summary of the total power loss reduction is illustrated in Figure 8, which shows that the PSO averagely performs better than the WOA. Table 2 further elucidates the values and improvement level of the algorithms. Each parameter is compared to the base case to calculate the improvement percentage. The PSO, considering the technical and techno-economic objectives, reduced the real power loss to 6.43 MW and 6.47 MW respectively, while the WOA considering the technical and techno-economic objectives, reduced the real power loss to 8.0069 MW and 6.14 MW respectively. The PSO, considering the technical and techno-economic objectives, reduces the reactive power loss to 25.80 MVaR and 31.64 MVaR respectively, while the WOA considering the technical and techno-economic objectives, reduces the reactive power loss to 27.59 MVaR and 28.44 MVaR respectively. Table 4 shows the comparison of the WOA to the PSO in the optimal sizing of DG units. In other words, the PSO is the base case. It is more evident that the PSO performs better than the WOA when considering only the technical objective.

From Table 5, the WOA produces a lower DG unit size when considering only technical objective. However, the PSO performs better than the WOA in terms of the techno-economic objective. This is synonymous to WOA results in [36]. The real and reactive power loss from the PSO is 6.47 MW and 28.43 MVaR, while the WOA is 6.14 MW and 25.80 MVaR respectively. From Figure 9, it is observed that the WOA when considering the techno-economic objective, has the highest reactive power loss reduction on the bus network. Figure 10 shows the voltage profile of the IEEE 14-bus test system, with WOA considering techno-economic constraints having the most improved profile.

Bus no. | PSO | PSO (Eco) | WOA | WOA (Eco) |
---|---|---|---|---|

2 | 41.191 | 39.545 | 20.343 | 49.328 |

8 | 42.133 | 43.167 | 20.552 | 38.826 |

9 | 13.823 | 9.880 | 22.645 | 32.311 |

10 | 38.777 | 37.937 | 20.612 | 33.540 |

TOTAL | 135.924 | 130.529 | 84.152 | 154.005 |

### 6.2 IEEE 30-Bus test system results

The DG unit sizes were initially chosen randomly within the DG limits for the potential bus locations. Thereafter, the objective function was computed based on defined constraints. The total power losses are calculated for each algorithm. For the base case of 100 MVA and 11 kV, with voltage magnitude limits between 1.01 and 1.1 pu, the real power loss is 13.5929 MW. The total load demand of the test system is 283.4 MW and 126.2 MVaR.

Real power | MW | Performance (%) |
---|---|---|

WOA Power loss technical | 7.54 | 62.75% |

WOA Power loss techno-economic | 10.77 | 132.38% |

PSO Power loss technical | 11.56 | 49.35% |

PSO Power loss techno-economic | 11.73 | 51.57% |

Reactive power | ||

WOA Power loss technical | 34.77 | 50.17% |

WOA Power loss techno-economic | 45.87 | 98.15% |

PSO Power loss technical | 48.57 | 40.11% |

PSO Power loss techno-economic | 49.17 | 41.82% |

Real power | Performance (%) |
---|---|

WOA improvement technical | 53.31% |

WOA improvement techno-economic | 8.97% |

Reactive power | |

WOA improvement technical | 39.71% |

WOA improvement techno-economic | 7.18% |

The LSF was implemented to identify the candidate bus locations for optimal sizing of DGs. The potential bus locations are 2, 6, and 7. These bus locations are selected based on the values close to zero. The first three indices of the bus configuration are selected.

Figure 12 illustrates the real power loss on each bus for each algorithm. It is observed that the WOA performs better than the PSO when considering only the technical objective. With the techno-economic objective, the WOA still performs better but by a small margin. Figure 13 further shows the summary of results on power loss reduction from the optimization algorithms for the IEEE 30-Bus test system. It is clearly seen that the WOA performs better than the PSO when considering both technical and techno-economic objectives. It is observed from Table 5, that both algorithms decrease the total real power loss. The PSO, under the technical and techno-economic constraints, reduced the real power loss to 11.564 MW and 11.736 MW respectively, while the WOA reduced it to 7.543 MW and 10.770 MW respectively.

For the optimal sizing, the PSO when considering the technical objective, performs better than the WOA in the sizing of DG units, with the total DG unit’s capacity as 58.106 MW compared to the PSOs’ 137.547 MW. The WOA has a better total DG unit size when considering the addition of economical objective, with 3 MW lesser than the PSO. However, the PSO produces a lower total DG size, considering the techno-economic objective. However, the WOA produces a lower power loss than the PSO. This is synonymous to WOA results obtained in [40]. The total real and reactive power loss from the PSO is 11.736 MW and 49.167 MVaR, while the WOA is 10.769 MW and 45.870 MVaR respectively. From Figure 14, it is observed that the WOA with techno-economic objective, has a better reactive power loss on the bus network.

Figure 15 shows the voltage profile of the IEEE 30-bus test system. The WOA, with the consideration of techno-economic constraints improved the voltage profile of the bus network.

Bus no. | PSO | PSO (Eco) | WOA | WOA (Eco) |
---|---|---|---|---|

2 | 8.542 | 33.454 | 45.323 | 23.102 |

6 | 15.324 | 16.541 | 44.121 | 20.732 |

7 | 34.240 | 32.330 | 48.103 | 35.442 |

TOTAL | 58.106 | 82.325 | 137.547 | 79.276 |

## 7 Conclusion

In this paper, swarm intelligence-based algorithms, the PSO and the WOA were applied to the sizing of DG units for optimal planning of a meshed transmission network. The paper reports a proper evaluation of the application of both algorithms on the IEEE bus test systems (14- and 30-bus). Technical and techno-economic (addition of both technical and economical) objectives were considered, and were simulated separately for more observations.

The algorithms outperform each other in different metrics. For instance, the WOA when considering the techno-economic objective, performs better in the total real power loss minimization for both the IEEE 14- and 30-bus test systems. The WOA also performs better in the voltage profile improvement of the IEEE 14-bus network while the PSO ranks higher in performance on the voltage profile improvement for the IEEE 30-bus network. However, the PSO performs better when considering only the technical objective for the total power loss minimization. The reactive power loss is most minimized by the WOA when considering the techno-economic objective for the IEEE 14-bus network. However, the WOA performs better on the 30-bus network, when the technical objective is only considered.

The PSO performs better in the sizing of the DG units, when considering the technical and techno-economic objectives for the IEEE 14- and 30-bus network. The only exception (where the WOA performs better) is the consideration of the technical objective for the IEEE 14-bus network.

The consideration of the technical and techno-economic objectives have their differences. The technical objective can be more generalized since it is more scientific while the addition of the economical objective (which is techno-economic) makes it less generalizable. This is because economic parameters are dependent on a country’s economic factors. In some cases, the economic state of provinces or states in a country may vary. Furthermore, economic factors are also time-dependent.

Results also proved that the PSO and the WOA remain successful in optimal placement and sizing problem even in transmission networks. Both algorithms produced a remarkable result from the solutions. PSO produces a lesser total DG units size from the IEEE 14-bus test system evaluation. The WOA had the most minimal real and reactive power loss values on both bus configuration. The WOA also performs better but by a few margin in the voltage profile improvement.

For future studies, newly modified or hybridized algorithms can be developed according to the specific lapses in present results.

### References

- (2001) Distributed generation: A definition. Electric Power Systems Research 57 (3), pp. 195–204. External Links: Document, ISSN 03787796 Cited by: §1.
- (2013) Optimal placement and sizing method to improve the voltage stability margin in a distribution system using distributed generation. IEEE Transactions on Power Systems 28 (1), pp. 326–334. External Links: Document, ISSN 08858950 Cited by: §2.1.
- (2018) A techno-economic analysis of the integration of energy storage technologies in electric power systems. Journal of Renewable and Sustainable Energy 10 (5). External Links: Document, ISSN 19417012 Cited by: §4.1.
- (2017) Ant Lion Optimization Algorithm for optimal location and sizing of renewable distributed generations. Renewable Energy 101, pp. 1311–1324. External Links: Document, ISSN 18790682, Link Cited by: §1.
- (2010) Probabilistic techniques in a.c. load-flow analysis. Proceedings of the Institution of Electrical Engineers 124 (2), pp. 154. External Links: Document, ISSN 00203270 Cited by: Figure 6.
- (2012) Impact of distributed generation on power distribution systems. Energy Procedia 25, pp. 93–100. External Links: Document, ISSN 18766102, Link Cited by: §1.
- (2017) Stud Krill herd Algorithm for multiple DG placement and sizing in a radial distribution system. Engineering Science and Technology, an International Journal 20 (2), pp. 748–759. External Links: Document, ISSN 22150986, Link Cited by: §3.
- (2013) Optimal siting of DG units in power systems from a probabilistic multi-objective optimization perspective. International Journal of Electrical Power and Energy Systems 51, pp. 14–26. External Links: Document, ISSN 01420615, Link Cited by: §1.
- (2015) Economic Issues of Distributed Generation in Power Networks. In Acta Electrotehnica, pp. 18–21. Cited by: §1.
- (2000) Comparing inertia weights and constriction factors in particle swarm optimization. In Proceedings of the 2000 Congress on Evolutionary Computation, CEC 2000, Vol. 1, pp. 84–88. External Links: Document Cited by: §6.
- (2018) Optimal integration and planning of renewable distributed generation in the power distribution networks: A review of analytical techniques. Applied Energy 210 (November 2017), pp. 44–59. External Links: Document, ISSN 03062619, Link Cited by: §1.
- (2015) Optimal allocation of multi-type distributed generators using backtracking search optimization algorithm. International Journal of Electrical Power and Energy Systems 64, pp. 1197–1205. External Links: Document, ISSN 01420615, Link Cited by: §3.1.
- (2018-09) Modified harmony search algorithm for combined economic emission dispatch of microgrid incorporating renewable sources. Energy 159, pp. 496–507. External Links: Document, ISSN 03605442 Cited by: §4.1.
- (2017) Multi-Objective Approach for Reconfiguration of Distribution Systems with Distributed Generations. Electric Power Components and Systems 45 (15), pp. 1678–1690. External Links: Document, ISSN 15325016, Link Cited by: §1.
- (1992) Voltage Stability Evaluation Using Modal Analysis. IEEE Transactions on Power Systems 7 (4), pp. 1529–1542. External Links: Document, ISSN 15580679 Cited by: §2.1.
- (2013) Optimal allocation of combined DG and capacitor for real power loss minimization in distribution networks. International Journal of Electrical Power and Energy Systems 53, pp. 967–973. External Links: Document, ISSN 01420615, Link Cited by: §2.1.
- (2018) Optimal sizing and siting of renewable energy resources in distribution systems considering time varying electrical/heating/cooling loads using PSO algorithm. International Journal of Green Energy 15 (2), pp. 113–128. External Links: Document, ISSN 15435083, Link Cited by: §1.
- (2019) Optimal location-allocation of storage devices and renewable-based DG in distribution systems. Electric Power Systems Research 172 (September 2018), pp. 11–21. External Links: Document, ISSN 03787796, Link Cited by: §1.
- (2016) Analytical Review of Power Flow Tracing in Deregulated Power System. American Journal of Electrical and Electronic Engineering 4 (3), pp. 92–101. External Links: Document, ISSN 2328-7357 Cited by: Figure 11.
- (2015) Optimal multiple distributed generation output through rank evolutionary particle swarm optimization. Neurocomputing 152, pp. 190–198. External Links: Document, ISSN 18728286, Link Cited by: §1, §5.1.
- (2019) Robust optimization framework for dynamic distributed energy resources planning in distribution networks. International Journal of Electrical Power and Energy Systems 110 (February 2018), pp. 419–433. External Links: Document, ISSN 01420615, Link Cited by: §1.
- (2013) Optimal placement of different type of DG sources in distribution networks. International Journal of Electrical Power and Energy Systems 53 (1), pp. 752–760. External Links: Document, ISSN 01420615, Link Cited by: §4.2.1, §4.
- (2013) Optimal placement of different type of DG sources in distribution networks. International Journal of Electrical Power and Energy Systems 53 (1), pp. 752–760. External Links: Document, ISSN 01420615, Link Cited by: §5.1.
- (2014) Mitigation of real power loss, THD & enhancement of voltage profile with optimal DG allocation using PSO & sensitivity analysis. 2014 Annual International Conference on Emerging Research Areas: Magnetics, Machines and Drives, AICERA/iCMMD 2014 - Proceedings, pp. 1–6. External Links: Document, ISBN 9781479952021 Cited by: §3.1.
- (2017) Optimal planning of distributed generation with application of multi-objective algorithm including economic, environmental and technical issues with considering uncertainties. International Journal of Ambient Energy 38 (8), pp. 849–857. External Links: Document, ISSN 21628246, Link Cited by: §1, §1.
- (2014) A MINLP technique for optimal placement of multiple DG units in distribution systems. International Journal of Electrical Power and Energy Systems 63, pp. 609–617. External Links: Document, ISSN 01420615, Link Cited by: §1.
- (1989) Application of power system stabilizers for enhancement of overall system stability. IEEE Transactions on Power Systems 4 (2), pp. 614–626. External Links: Document, ISSN 15580679 Cited by: §2.
- (2018) Optimal distributed generation planning in active distribution networks considering integration of energy storage. Applied Energy 210 (July 2017), pp. 1073–1081. External Links: Document, ISSN 03062619, Link Cited by: §3.1.
- (2016) The Whale Optimization Algorithm. Advances in Engineering Software 95, pp. 51–67. External Links: Document, ISSN 18735339, Link Cited by: §5.2.
- (2016) A novel method for optimal DG units capacity and location in Microgrids. International Journal of Electrical Power and Energy Systems 75, pp. 236–244. External Links: Document, ISSN 01420615, Link Cited by: §1.
- (1993) Voltage stability analysis using static and dynamic approaches. IEEE Transactions on Power Systems 8 (3), pp. 1159–1171. External Links: Document, ISSN 15580679 Cited by: §2.1.
- (2017) Multi DGPV installation in transmission system for loss minimization. 2017 4th International Conference on Industrial Engineering and Applications, ICIEA 2017, pp. 350–354. External Links: Document, ISBN 9781509067749 Cited by: §1.
- (2015) Optimal Sizing and Placement of DG in a Radial Distribution Network using Sensitivity based methods. International Electrical Engineering Journal 6 (July), pp. 1727–1734. Cited by: §3.1.
- (2018) Ant Lion optimization algorithm for optimal sizing of renewable energy resources for loss reduction in distribution systems. Journal of Electrical Systems and Information Technology 5 (3), pp. 663–680. External Links: Document, ISSN 23147172, Link Cited by: §1.
- (2010) Optimal placement of DG using multiobjective particle swarm optimization. ICMET 2010 - 2010 International Conference on Mechanical and Electrical Technology, Proceedings (Icmet), pp. 342–346. External Links: Document, ISBN 9781424481019 Cited by: §4.1.
- (2017) Optimal siting of capacitors in radial distribution network using Whale Optimization Algorithm. Alexandria Engineering Journal 56 (4), pp. 499–509. External Links: Document, ISSN 11100168, Link Cited by: §6.1.
- (2016) Multiple DG Placements in Distribution System for Power Loss Reduction Using PSO Algorithm. Procedia Technology 25 (Raerest), pp. 785–792. External Links: Document, ISSN 22120173, Link Cited by: §1, Figure 3, Figure 4.
- (2016) Optimal Siting and Sizing of Multiple DG Units for the Enhancement of Voltage Profile and Loss Minimization in Transmission Systems Using Nature Inspired Algorithms. Scientific World Journal 2016. External Links: Document, ISSN 1537744X, Link Cited by: §1.
- (2018) Improved harmony search algorithm for electrical distribution network expansion planning in the presence of distributed generators. Energy 151, pp. 178–202. External Links: Document, ISSN 03605442, Link Cited by: §1.
- (2017) Whale optimization algorithm for optimal sizing of renewable resources for loss reduction in distribution systems. Renewables: Wind, Water, and Solar 4 (1), pp. 1–13. External Links: Document, ISSN 2198-994X Cited by: §1, §6.2.
- (2017) Optimal sizing of distributed energy resources in smart microgrids: A mixed integer linear programming formulation. 2017 6th International Conference on Renewable Energy Research and Applications, ICRERA 2017 2017-Janua, pp. 568–573. External Links: Document, ISBN 9781538620953 Cited by: §1.
- (1970) Power System Static-State Estimation, Part I: Exact Model. IEEE Transactions on Power Apparatus and Systems PAS-89 (1), pp. 120–125. External Links: Document, ISSN 00189510 Cited by: §1, §2.
- (2014) Dynamic economic dispatch of a microgrid: Mathematical models and solution algorithm. International Journal of Electrical Power and Energy Systems 63, pp. 336–346. External Links: Document, ISSN 01420615 Cited by: §4.1.