0 views

Original Title: Application of Fuzzy and ABC Algorithm for DG Placement for Minimum Loss in Radial Distribution System

Uploaded by Abbas Divian

- 10 Important Energy Sources.docx
- untitleddocument
- Optimal Allocation and Number of Automatic Switche
- LP- OR.docx
- Supplier Selection JurInt 3
- Operations Research
- An Efficient Multi-objective Evolutionary Fuzzy System for Regression Problems
- untitleddocument (3)
- Chapter13 - Agreggate Planning
- Design of Passive Systems for Control of Inelastic Structures
- AHP Approach for Supplier Evaluation and Selection in a Pharmaceutical
- TRAJECTORY TRACKING OF A MOBILE ROBOT USING fuzzy logic tuned by genetic algorithm.pdf
- Data Leakage Detection Formulae Lists
- Pattern Search Program
- Critical Load Pick Up
- BBBC
- Sustainable Management of Savanna
- Dynamic Stiffness Optimization Using Radioss
- PV Hybrid ID
- Blending module.pdf

You are on page 1of 9

Downloaded from ijeee.iust.ac.ir at 10:23 IRDT on Thursday April 18th 2019

problems such as voltage regulation, power loss, etc. This paper presents a new methodology

using Fuzzy and Artificial Bee Colony algorithm (ABC) for the placement of Distributed

Generators (DG) in the radial distribution systems to reduce the real power losses and to

improve the voltage profile. A two-stage methodology is used for the optimal DG placement.

In the first stage, Fuzzy is used to find the optimal DG locations and in the second stage, ABC

algorithm is used to find the size of the DGs corresponding to maximum loss reduction. The

ABC algorithm is a new population based meta heuristic approach inspired by intelligent

foraging behavior of honeybee swarm. The advantage of ABC algorithm is that it does not

require external parameters such as cross over rate and mutation rate as in case of genetic

algorithm and differential evolution and it is hard to determine these parameters in prior. The

proposed method is tested on standard IEEE 33 bus test system and the results are presented

and compared with different approaches available in the literature. The proposed method has

outperformed the other methods in terms of the quality of solution and computational

efficiency.

Keywords: ABC Algorithm, DG placement, Loss reduction, Meta Heuristic Methods, Radial

Distribution System.

Distributed or dispersed generation (DG) or embedded DG implementation [4].

generation (EG) is small-scale power generation that is The distribution planning problem is to identify a

usually connected to or embedded in the distribution combination of expansion projects that satisfy load

system. The term DG also implies the use of any growth constraints without violating any system

modular technology that is sited throughout a utility’s constraints such as equipment overloading [5].

service area (interconnected to the distribution or sub- Distribution network planning is to identify the least

transmission system) to lower the cost of service [1]. cost network investment that satisfies load growth

The benefits of DG are numerous [2, 3] and the reasons requirements without violating any system and

for implementing DGs are an energy efficiency or operational constraints. Due to their high efficiency,

rational use of energy, deregulation or competition small size, low investment cost, modularity and ability

policy, diversification of energy sources, availability of to exploit renewable energy sources, are increasingly

modular generating plant, ease of finding sites for becoming an attractive alternative to network

smaller generators, shorter construction times and lower reinforcement and expansion. Numerous studies used

capital costs of smaller plants and proximity of the different approaches to evaluate the benefits from DGs

generation plant to heavy loads, which reduces to a network in the form of loss reduction, loading level

transmission costs. Also it is accepted by many reduction [6-8].

countries that the reduction in gaseous emissions Naresh Acharya et al suggested a heuristic method

in [9] to select appropriate location and to calculate DG

size for minimum real power losses. Though the method

Iranian Journal of Electrical & Electronic Engineering, 2010. is effective in selecting location, it requires more

Paper first received 4 Apr. 2010 and in revised form 2 Oct. 2010. computational efforts. The optimal value of DG for

* The Author is with the Department of EEE, AITS, Rajampet, A.P. minimum system losses is calculated at each bus.

E-mail: padmalalitha_mareddy@yahoo.co.in

** The Author is with the Department of EEE, S.V.U.C.E, S.V. Placing the calculated DG size for the buses one by one,

University,Tirupathi, A.P. corresponding system losses are calculated and

E-mail: veerareddy_vc@yahoo.com compared to decide the appropriate location. More over

*** The Author is with the Department of ME, AITS, Rajampet, A.P. the heuristic search requires exhaustive search for all

E-mail: siva.narapureddy@yahoo.com.

248 Iranian Journal of Electrical & Electronic Engineering, Vol. 6, No. 4, Dec. 2010

possible locations which may not be applicable to more Note that for a given configuration of a single-

than one DG. This method is used to calculate DG size source radial network, the loss PLa associated with the

based on approximate loss formula may lead to an active component of branch currents cannot be

inappropriate solution. minimized because all active power must be supplied by

In the literature, genetic algorithm and PSO have the source at the root bus. However by placing DGs, the

been applied to DG placement [10-13].In all these active component of branch currents are compensated

works both sizing and location of DGs are determined and losses due to active component of branch current is

by these methods. This paper presents a new reduced. This paper presents a method that minimizes

Downloaded from ijeee.iust.ac.ir at 10:23 IRDT on Thursday April 18th 2019

methodology using ABC algorithm [14-17] for the the loss due to the active component of the branch

placement of DG in the radial distribution systems. current by optimally placing the DGs and thereby

The ABC algorithm is a new population based meta reduces the total loss in the distribution system. A two

heuristic approach inspired by intelligent foraging stage methodology is applied here. In the first stage

behavior of honeybee swarm. The advantage of ABC optimum location of the DGs are determined by using

algorithm is that it does not require external parameters fuzzy approach and in the second stage an analytical

such as cross over rate and mutation rate as in case of method is used to determine sizes of the DGs for

genetic algorithm and differential evolution and it is maximum real loss reduction.

hard to determine these parameters in prior. The other

advantage is that the global search ability in the 3 Identification of Optimal DG Locations using

algorithm is implemented by introducing neighborhood Fuzzy Approach

source production mechanism which is a similar to This paper presents a fuzzy approach to determine

mutation process. The advantage of ABC algorithm is suitable locations for DG placement. Two objectives are

because of its simplicity it takes less computation time considered while designing a fuzzy logic for identifying

than PSO method. the optimal DG locations. The two objectives are: (i) to

In this paper, the optimal locations of distributed minimize the real power loss and (ii) to maintain the

generators are identified based on the Fuzzy method voltage within the permissible limits. Voltages and

[18] and ABC optimization technique which takes the power loss indices of distribution system nodes are

number and location of DGs as input has been modeled by fuzzy membership functions. A fuzzy

developed to determine the optimal size(s) of DG to inference system (FIS) containing a set of rules is then

minimize real power losses in distribution systems. The used to determine the DG placement suitability of each

advantages of relieving ABC method from node in the distribution system. DG can be placed on

determination of locations of DGs are improved the nodes with the highest suitability.

convergence characteristics and less computation time. For the DG placement problem, approximate

Voltage and thermal constraints are considered. The reasoning is employed in the following manner: when

effectiveness of the proposed algorithm was validated losses and voltage levels of a distribution system are

using 33-Bus Distribution System [19]. To test the studied, an experienced planning engineer can choose

effectiveness of proposed method, results are compared locations for DG installations, which are probably

with different approaches available in the literature. The highly suitable. For example, it is intuitive that a section

proposed method has outperformed the other methods in in a distribution system with high losses and low

terms of the quality of solution and computational voltage is highly ideal for placement of DG. Whereas a

efficiency. low loss section with good voltage is not ideal for DG

placement. A set of fuzzy rules has been used to

2 Theoretical Background determine suitable DG locations in a distribution

2

The total I R loss (PL) in a distribution system system.

having n number of branches is given by: In the first step, load flow solution for the original

n (1) system is required to obtain the real and reactive power

PLt = ∑ Ii2 Ri losses. Again, load flow solutions are required to obtain

i =1

the power loss reduction by compensating the total

here Ii is the magnitude of the branch current and Ri is active load at every node of the distribution system. The

the resistance of the ith branch respectively. The branch loss reductions are then, linearly normalized into a [0, 1]

current can be obtained from the load flow solution. The range with the largest loss reduction having a value of 1

branch current has two components, active component and the smallest one having a value of 0. Power Loss

(Ia) and reactive component (Ir). The loss associated Index [15] value for ith node can be obtained using

with the active and reactive components of branch equation 4.

currents can be written as: (Lossreduction(i) − Lossreduction(min))

PLI(i) = (4)

n

(2) (Lossreduction(max) − Lossreduction(min))

PLa = ∑ Iai2 Ri

i =1 These power loss reduction indices along with the

n

(3) p.u. nodal voltages are the inputs to the Fuzzy Inference

PLr = ∑ I 2ri Ri

i =1

Padma Lalitha et al: Application of Fuzzy and ABC Algorithm for DG Placement… 249

System (FIS), which determines the nodes that are more

suitable for DG installation.

In this paper, two input and one output variables are

selected. Input variable-1 is power loss index (PLI) and

Input variable-2 is the per unit nodal voltage (V).

Output variable is DG suitability index (DSI). Power

Downloaded from ijeee.iust.ac.ir at 10:23 IRDT on Thursday April 18th 2019

range varies from 0.9 to 1.1 and DG suitability index

range varies from 0 to 1.

Five membership functions are selected for PLI.

They are L, LM, M, HM and H. All the five

membership functions are triangular as shown in Fig. 1.

Five membership functions are selected for Voltage.

They are L, LN, N, HN and H. These membership Fig. 3 Membership function plot for DSI.

functions are trapezoidal and triangular as shown in Fig.

2. Five membership functions are selected for DSI. For the DG allocation problem, rules are defined to

They are L, LM, M, HM and H. These five determine the suitability of a node for capacitor

membership functions are also triangular as shown in installation. Such rules are expressed in the following

Fig. 3. form: IF premise (antecedent), THEN conclusion

(consequent).

For determining the suitability of DG placement at a

particular node, a set of multiple-antecedent fuzzy rules

has been established. The inputs to the rules are the

voltage and power loss indices and the output is the

suitability of DG placement. The rules are summarized

in the fuzzy decision matrix in Table 1. In the present

work 25 rules are constructed.

Voltage

AND LL LN NN HN HH

L LM LM L L L

LM M LM LM L L

DSI M HM M LM L L

HM HM HM M LM L

Fig. 1 Membership function plot for PLI. H H HM M LM L

Algorithm

4.1 Introduction to ABC Algorithm

In the ABC algorithm, the colony of artificial bees

contains three groups of bees: employed bees, onlookers

and scouts. A bee waiting on the dance area for making

decision to choose a food source is called an onlooker

and a bee going to the food source visited by it

previously is named an employed bee. A bee carrying

out random search is called a scout. In the ABC

algorithm, first half of the colony consists of employed

artificial bees and the second half constitutes the

onlookers. For every food source, there is only one

employed bee. In other words, the number of employed

bees is equal to the number of food sources around the

hive. The employed bee whose food source is exhausted

Fig. 2 Membership function plot for voltage. by the employed and onlooker bees becomes a scout. In

250 Iranian Journal of Electrical & Electronic Engineering, Vol. 6, No. 4, Dec. 2010

the ABC algorithm, each cycle of the search consists of determining the nectar amount of the foods; determining

three steps: sending the employed bees onto the food the scout bees and then sending them onto possible food

sources and then measuring their nectar amounts; sources. At the initialization stage, a set of food source

selecting of the food sources by the onlookers after positions are randomly selected by the bees and their

sharing the information of employed bees and nectar amounts are determined. Then, these

bees come in to the hive and share the nectar neighborhood of a particular food source is determined

information of the sources with the bees waiting on the by altering the value of one randomly chosen solution

dance area within the hive. At the second stage, after parameter and keeping other parameters unchanged.

Downloaded from ijeee.iust.ac.ir at 10:23 IRDT on Thursday April 18th 2019

sharing the information, every employed bee goes to the This is done by adding to the current value of the

food source area visited by her at the previous cycle chosen parameter the product of a uniform variate in [-

since that food source exists in her memory, and then 1, 1] and the difference in values of this parameter for

chooses a new food source by means of visual this food source and some other randomly chosen food

information in the neighborhood of the present one. At source. Formally, suppose each solution consists of d

the third stage, an onlooker prefers a food source area parameters and let Xi = (Xi1, Xi2, Xi3, …, Xid) be a

depending on the nectar information distributed by the solution with parameter values Xi1, Xi2, Xi3, …, Xid. In

employed bees on the dance area. As the nectar amount order to determine a solution vi in the neighborhood of

of a food source increases, the probability with which Xi, a solution parameter j and other solution Xk=(Xk1,

that food source is chosen by an onlooker increases, too. Xk2, Xk3, …, Xkd) are selected randomly. Except for the

Hence, the dance of employed bees carrying higher values of the selected parameter j, all other parameter

nectar recruits the onlookers for the food source areas values of vi are same as Xi, i.e., vi=(Xi1, Xi2 … Xi(j-1),

with higher nectar amount. After arriving at the selected Xij, Xi(j+1), … Xid). The value vi of the selected

area, she chooses a new food source in the parameter j in vi is determined using the following

neighborhood of the one in the memory depending on formula:

visual information. Visual information is based on the vij = x ij + u(x ij − x kj ) (6)

comparison of food source positions. When the nectar where u is an uniform variate in [-1, 1]. If the resulting

of a food source is abandoned by the bees, a new food value falls outside the acceptable range for parameter j,

source is randomly determined by a scout bee and it is set to the corresponding extreme value in that

replaced with the abandoned one. In our model, at each range.

cycle at most one scout goes outside for searching a new

food source and the number of employed and onlooker 4.2 Problem Formulation

bees were equal. The probability Pi of selecting a food

⎪⎧ n 2 ⎪⎫

source i is determined using the following expression: M in ⎨ P = ∑ I R ⎬ (7)

⎪⎩ Lt i i

fit i i=1 ⎭⎪

Pi = SN (5) Subject to voltage and current constraints:

∑ fit

n =1

n V ≤ V ≤ V (8)

i m in i i m ax

where fiti is the fitness of the solution represented by the (9)

I ≤ I

food source i and SN is the total number of food ij ij m ax

sources. Clearly, with this scheme good food sources where Ii is the current flowing through the ith branch

will get more onlookers than the bad ones. After all which is dependent on the locations and sizes of the

onlookers have selected their food sources, each of them DGs. Locations determined by fuzzy method are given

determines a food source in the neighborhood of his as input. So the objective function is now only

chosen food source and computes its fitness. The best dependent on the sizes of the DGs at these locations.

food source among all the neighboring food sources Ri is the resistance of the ith branch. Vimax and Vimin

determined by the onlookers associated with a particular are the upper and lower limits on ith bus voltage. Iijmax is

food source i and food source i itself, will be the new the maximum loading on branch ij. The important

location of the food source i. If a solution represented operational constraints on the system are addressed by

by a particular food source does not improve for a equations 8 and 9.

predetermined number of iterations then that food

source is abandoned by its associated employed bee and 4.3 Assigned Values for Various Parameters of ABC

it becomes a scout, i.e., it will search for a new food Method

source randomly. This tantamount to assigning a The assigned values for various parameters of ABC

randomly generated food source (solution) to this scout method are as follows.

and changing its status again from scout to employed. • Number of Total Bees = 40

After the new location of each food source is • Number of Employed bees = 20

determined, another iteration of ABC algorithm begins.

• Number of Onlooker bees = 20

The whole process is repeated again and again till the

• Number of Scout Bee = 1

termination condition is satisfied. The food source in the

Padma Lalitha et al: Application of Fuzzy and ABC Algorithm for DG Placement… 251

• Stopping Criterion --- (Maximum Fitness – 11. Memorize the best solution achieved so far. If

Average Fitness) < 10-12 the difference between two successive values is

less than specified value, go to step 14.

4.4 Algorithm to Find the DG Sizes at Desired 12. Increase the iteration number by one.

Locations using ABC Algorithm 13. If iterations are less than MIC, go to step 5,

The proposed ABC algorithm for finding sizes of otherwise go to step 14.

DGs at selected locations to minimize the real power 14. Stop.

loss is summarized as follows:

Downloaded from ijeee.iust.ac.ir at 10:23 IRDT on Thursday April 18th 2019

1. Read the input data; Initialize MNC (Maximum 5 Results and Discussion

Iteration Count) and base case as the best First load flow is conducted for IEEE 33 bus test

solution. system [7]. The power loss due to active component of

2. Construct initial Bee population (solution) xij as current is 136.9836 kW and power loss due to reactive

each bee is formed by the sizes of DG units and component of the current is 66.9252 kW. Optimal DG

the number of employed bees are equal to locations are identified based on the DSI values. For

onlooker bees. this 33 bus system, four optimal locations are identified.

3. Evaluate fitness value for each employed bee by The candidate locations with their DSI values are given

using the following the formula in Table 2.

1

fitness = (10) Table 2 Buses with DSI values.

1 + PowerLoss

4. Initialize iteration = 1. Bus No. DSI

5. Generate new population (solution) vij in the

neighborhood of xij for employed bees using 32 0.92

equation (6) and evaluate them. 30 0.7982

6. Apply the greedy selection process between xi 31 0.75

and vi. 18 0.75

7. Calculate the probability values Pi for the

solutions xi by means of their fitness values The locations determined by Fuzzy method for DG

using the equation (5). placement are 32,30,31,18. With these locations, sizes

8. Produce the new populations vi for the of DGs are determined by using ABC Algorithm

onlookers from the populations x, selected described in section 4. The sizes of DGs are dependent

depending on Pi by applying roulette wheel on the number of DG locations. Generally it is not

selection process, and evaluate them. possible to install many DGs in a given radial system.

9. Apply the greedy selection process for the Here 4 cases are considered. In case I only one DG

onlookers between xi and vi. installation is assumed. In case II two DGs, in case III

10. Determine the abandoned solution, if exists, and three DGS and in the last case four DGs are assumed to

replace it with a new randomly produced be installed. DG sizes in the four optimal locations, total

solution xi for the scout bees using the real power losses before and after DG installation for

following equation four cases are given in Table 3.

x ij = min j + rand(0,1) *(max j − min j ) (11)

Losses before Loss after DG

DG DG sizes Total Size Saving/DG

Case DG installation installation Saving (kW)

locations (MW) (MW) size

(kW) (kW)

I 32 1.2931 1.2931 203.9088 127.0919 76.817 59.405

32 0.3836

II 1.5342 203.9088 117.3946 86.5142 56.39

30 1.1506

32 0.2701

III 30 1.1138 1.5342 203.9088 117.3558 86.553 56.41

31 0.1503

32 0.2701

30 0.8233

IV 1.8423 203.9088 90.292 113.6166 61.67

31 0.1503

18 0.5986

The last column in Table 3 represents the saving in increasing the saving is also increasing. In case4

kW for 1 MW DG installation. The case with greater maximum saving is achieved but the number of DGs is

ratio is desirable. As the number of DGs installed is four. Though the ratio of saving to DG size is maximum

252 Iranian Journal of Electrical & Electronic Engineering, Vol. 6, No. 4, Dec. 2010

of all cases which represent optimum solution but the existing method. The two methods are tested on four

number of DGs involved is four so it is not economical IEEE standard test systems viz. 15 Bus, 34 Bus, 69 Bus

by considering the cost of installation of 4 DGs. But in and 85 Bus system. The results of these two methods for

view of reliability, quality and future expansion of the all the test system are identical. To demonstrate the

system it is the best solution. supremacy of the proposed method the convergence

Table 4 shows the minimum voltage and % characteristics are compared with that of PSO algorithm

improvement in minimum voltage compared to base as shown in Table 8. Though the number of iterations is

case for all the four cases. In all the cases voltage profile more for ABC algorithm it takes less computation time

Downloaded from ijeee.iust.ac.ir at 10:23 IRDT on Thursday April 18th 2019

is improved and the improvement is significant. The because of its simplicity when compared to PSO

voltage profile for all cases is shown in Fig. 4. method.

The convergence characteristics of the proposed

Table 4 Voltage improvement with DG placement. ABC method and PSO methods for remaining test

system are given in Table 9.

Case No. Bus No. Min Voltage % Change

From the above table it is clear that the time taken

for one iteration is very small for ABC compared to

Base Case 18 0.9118 PSO method. For small systems the convergence

characteristics of ABC method are better than PSO

Case1 18 0.9314 2.149

method. For large systems for less number of DG units

Case2 18 0.9349 2.533 the convergence characteristics of ABC Method are

Case3 18 0.9349 2.533 better than PSO method. When four DG units are to be

Case4 14 0.9679 6.153 placed in the system then PSO method is taking less

time than ABC method. But generally it is very rare

Table 5 shows % improvements in power loss due to case.

active component of branch current, reactive component

of branch current and total active power loss of the

system in the four cases considered. The loss due to

active component of branch current is reduced by more

than 68% in least and nearly 96% at best. Though the

aim is reducing the PLa loss, the PLr loss is also reducing

due to improvement in voltage profile. From Table 5 it

is observed that the total real power loss is reduced by

48.5% in case 1 and 67% in case 4.

The convergence characteristics of the solution of

ABC algorithm for all the four cases are shown in Fig.

5.

Table 6 shows the minimum, average and maximum

values of total real power loss from 100 trials of ABC

algorithm. The average number of iterations and

average CPU time are also shown.

To demonstrate the validity of the proposed method

the results of proposed method are compared with an Fig. 4 Voltage profile with and without DG placement for all

existing PSO method [20]. The comparison is shown in Cases.

Table 7.

From the above tables it is clear that the proposed

method is producing the results that match with those of

Case No. PLa (kW) % Saving PLr (kW) % Saving PLt (kW) % Saving

Case1 62.7085 54.22 64.3834 3.7979 127.0919 37.45

Case2 53.6323 60.847 63.7623 4.726 117.3946 42.43

Case3 53.5957 60.874 63.7601 4.729 117.3558 42.45

Case4 27.7143 79.768 62.5779 6.4957 90.292 55.72

Padma Lalitha et al: Application of Fuzzy and ABC Algorithm for DG Placement… 253

Table 6 Performance of ABC algorithm for IEEE 33 Bus System.

Total real power loss (kW) Case I Case II Case III Case IV

Min 105.023 89.9619 79.2515 66.5892

Average 105.023 89.9619 79.2515 66.5892

Max 105.023 89.9619 79.2515 66.5892

Bee swarm Size 40 40 40 40

Downloaded from ijeee.iust.ac.ir at 10:23 IRDT on Thursday April 18th 2019

Average Time (Sec.) 3.344 4.89 7.89 10.14

Table 7 Comparison of results of IEEE 33-bus system by proposed method and other existing method.

Case

Locations

ABC PSO ABC PSO ABC PSO

1 32 1.2931 1.2931 1.1883 1.1883 76.3619 76.3619

2 32 0.3836 0.3836

1.416 1.416 86.0246 86.0246

30 1.1506 1.1506

32 0.2701 0.2701

3 30 1.1138 1.1138 1.416 1.416 86.0628 86.0628

31 0.1503 0.1503

32 0.27006 0.2700

30 0.8432 6

0.8432

4

1.86176 1.86176 113.4294 113.4294

31 0.1503 0.1503

18 0.5982 0.5982

Case I Case II Case III Case IV

ABC PSO ABC PSO ABC PSO ABC PSO

Swarm Size 40 30 40 30 40 30 40 30

Avg. No. of

93.45 98.26 118.73 127.06 196.75 145.81 256.54 171.69

iterations

Avg. time(sec.) 3.344 5.234 4.89 6.39 7.89 8.688 10.14 10.78

Table 9 Comparison of convergence characteristics of ABC and PSO algorithms.

Average Computation Time Average No. of Iterations Swarm Size

System

ABC PSO ABC PSO ABC PSO

2.047 1.328 90.78 91.84

15 Bus

2.252 2.141 102.8 146.29

5.187 3.61 108.38 93.37

6.486 5.797 115.89 150.21

33 Bus

6.8386 8.734 120.93 227.83

7.515 10.75 128.19 278.19

14.81 9.047 100.25 98.16

40 30

15.17 14.624 114.79 161.65

69 Bus

15.36 19.672 119.32 212.72

14.36 20.765 124.86 229.41

23.31 10.717 126.91 81.96

23.97 17.35 128.48 129.04

85 Bus

25.63 33.016 137.43 248.81

29.97 35.047 158.62 263.84

254 Iranian Journal of Electrical & Electronic Engineering, Vol. 6, No. 4, Dec. 2010

case I case II

180 400

160 300

140 200

120 100

Downloaded from ijeee.iust.ac.ir at 10:23 IRDT on Thursday April 18th 2019

100 0

0 50 100 0 50 100 150

Iteration number iteration Number

case III Case IV

400 600

Real Power Loss(Kw)

300

400

200

200

100

0 0

0 50 100 150 200 0 100 200 300

Iteration Number Iteration Number

In this paper, a two-stage methodology of finding quantify the technical benefits of distributed

the optimal locations and sizes of DGs for maximum generation,” IEEE Trans Energy Conversion,

loss reduction of radial distribution systems is Vol. 19, No. 4, pp. 764-773, 2004.

presented. Fuzzy method is proposed to find the optimal [4] “Kyoto Protocol to the United Nations

DG locations and a ABC algorithm is proposed to find Framework Convention on climate change,”

the optimal DG sizes. Voltage and line loading Available at: http://unfccc.int/resource/docs/

constraints are included in the algorithm. convkp/kpeng.htm1.

The validity of the proposed method is proved from [5] Brown R.E., Pan J., Feng X. and Koutlev K.,

the comparison of the results of the proposed method “Siting distributed generation to defer T&D

with other existing methods. The results proved that the expansion,” Proc. IEE. Gen, Trans and Dist.,

ABC algorithm is simple in nature than GA and PSO so Vol. 12, No. 3, pp. 1151-1159, 1997.

it takes less computation time. By installing DGs at all [6] Diaz-Dorado E., Cidras J., Miguez E.,

the potential locations, the total power loss of the “Application of evolutionary algorithms for the

system has been reduced drastically and the voltage planning of urban distribution networks of

profile of the system is also improved. Inclusion of the medium voltage,” IEEE Trans. Power Systems,

real time constrains such as time varying loads and Vol. 17, No. 3, pp. 879-884, Aug. 2002.

different types of DG units and discrete DG unit sizes [7] Mardaneh M., Gharehpetian G. B., “Siting and

into the proposed algorithm is the future scope of this sizing of DG units using GA and OPF based

work. technique,” TENCON. IEEE Region 10

Conference, Vol. 3, pp. 331-334, Nov. 2004.

References [8] Berizzi S. A. and Buonanno S., “Distributed

[1] Celli G. and Pilo F., “Optimal distributed generation planning using genetic algorithms,”

generation allocation in MV distribution Electric Power Engineering, Power Tech.

networks,” 22nd IEEE Power Engineering Budapest 99, Int. Conference, pp. 257, 1999.

Society International Conference, pp. 81-86, May [9] Acharya N., Mahat P. and Mithulanathan N., “An

2001. analytical approach for DG allocation in primary

[2] Daly P.A., Morrison J., “Understanding the distribution network”, Electric Power and Energy

potential benefits of distributed generation on Systems, Vol. 28, No. 6, pp. 669-678, 2006.

power delivery systems,” Rural Electri Power [10] Celli G., Ghaini E., Mocci S. and Pilo F., “A

Conference, pp. A211-A213, April/May 2001. multi objective evolutionary algorithm for the

Padma Lalitha et al: Application of Fuzzy and ABC Algorithm for DG Placement… 255

sizing and sitting of distributed generation,” IEEE M. Padma Lalitha is pursuing Ph.D

Transactions on Power Systems, Vol. 20, No. 2, and is a graduate from JNTU,

pp. 750-757, May 2005. Anathapur in Electrical & Electronics

[11] Carpinelli G., Celli G., Mocci S. and Pilo F., Engineering in the year 1994. Obtained

Post graduate degree in PSOC from

“Optimization of embedded sizing and sitting by S.V.U, Tirupathi in the year 2002.

using a double trade-off method,” IEE proceeding Having 14 years of experience in

on Generation, Transmission and Distribution, teaching in graduate and post graduate

Vol. 152, No. 4, pp. 503-513, 2005. level. Has 10 international journal

Downloaded from ijeee.iust.ac.ir at 10:23 IRDT on Thursday April 18th 2019

[12] Borges C. L. T. and Falcao D. M., “Optimal publications and 10 international and national conferences to

distributed generation allocation for reliability, her credit. Presently working as Professor and HOD of EEE

losses and voltage improvement,” International department in AITS, Rajampet. Areas of interest include radial

Journal of Power and Energy Systems, Vol. 28, distribution systems, artificial intelligence in power systems,

No. 6, pp. 413-420, July 2006. ANN.

[13] Krueasuk W. and Ongsakul W., “Optimal

Placement of Distributed Generation Using

V. C. Veera Reddy presently working

Particle Swarm Optimization,” M. Tech. Thesis, as a professor in EEE department of

AIT, Thailand, 2006. S.V.U. College of Engineering,

[14] Karaboga D., “An idea based on honey bee Tirupathi. He awarded Ph.D for his

swarm for numerical optimization,” Technical work “Modeling & Control of Load

Report TR06, Computer Engineering Department, frequency using New Optimal Control

Erciyes University, Turkey, 2005. strategy” from S.V.U. in the year

[15] Basturk B. and Karaboga D., “An artificial bee 1999.Have 28 years of experience in

colony (ABC) algorithm for numeric function teaching and worked in various levels.

optimization,” IEEE Swarm Intelligence Guided a number of research scholars. Attended a number of

national & international conferences. Areas of interest include

Symposium 2006, Indianapolis, Indiana, USA, Distribution systems, Genetic Algorithms, Fuzzi Systems,

May 2006. ANN.

[16] Karaboga D. and Basturk B., “A powerful and

efficient algorithm for numerical function

optimization: artificial bee colony (ABC) N. Sivarami Reddy is pursuing Ph.D

algorithm,” Journal of Global Optimization, Vol. and is a graduate from SRKREC,

39, No. 3, pp. 459-471, 2007. Bimavaram in Mechanical Engineering

[17] Karaboga D. and Basturk B., “On the in the year 1989. Obtained Post

performance of artificial bee colony (ABC) graduate degree in Advanced

algorithm,” Applied Soft Computing, Vol. 8, No. Manufacturing Systems from NIT,

1, pp. 687-697, 2008. Suratkal in the year 1992. Having 18

[18] Padma Lalitha M., Veera Reddy V. C. and Usha

years of experience in teaching in

N.,“DG Placement Using Fuzzy For Maximum

graduate and post graduate level. Presently working as

Loss Reduction In Radial Distribution System,”

Professor and HOD of ME department in AITS, Rajampet.

International Journal of Computer Applications

Areas of interest include Flexible Manufacturing systems, Soft

in Engineering, Technology and Sciences, Vol. 2,

computing techniques in FMS.

No. 1, pp. 50-55, Oct./Mar. 2010.

[19] Brara M. E. and Wu F. F., “Networ

reconfiguration in distribution system for loss

reduction and load balancing”, IEEE

Transactions on Power Delivery, Vol. 4, No. 2,

pp. 1401-1407, Apr. 1989.

[20] Padma Lalitha M., Veera Reddy V. C., Usha V.

and Sivarami Reddy N.,” Application Of Fuzzy

And PSO For DG Placement For Minimum Loss

In Radial Distribution system,” ARPN Journal of

Engineering and Applied Sciences, Vol. 5, No. 4,

April 2010.

256 Iranian Journal of Electrical & Electronic Engineering, Vol. 6, No. 4, Dec. 2010

- 10 Important Energy Sources.docxUploaded byElsha Olegario
- untitleddocumentUploaded byapi-286833572
- Optimal Allocation and Number of Automatic SwitcheUploaded bySatish Ram
- LP- OR.docxUploaded byPreeti Singh
- Supplier Selection JurInt 3Uploaded byorieotim
- Operations ResearchUploaded bysubhasishmajumdar
- An Efficient Multi-objective Evolutionary Fuzzy System for Regression ProblemsUploaded byjkl316
- untitleddocument (3)Uploaded byapi-286833572
- Chapter13 - Agreggate PlanningUploaded byMarco Tulio
- Design of Passive Systems for Control of Inelastic StructuresUploaded byJulian Galvis
- AHP Approach for Supplier Evaluation and Selection in a PharmaceuticalUploaded byArif Izzudin
- TRAJECTORY TRACKING OF A MOBILE ROBOT USING fuzzy logic tuned by genetic algorithm.pdfUploaded byЋирка Фејзбуџарка
- Data Leakage Detection Formulae ListsUploaded byAshwin Josiah Samuel
- Pattern Search ProgramUploaded byKarthik Thirumala
- Critical Load Pick UpUploaded byHemakumar Reddy
- BBBCUploaded byShivam
- Sustainable Management of SavannaUploaded bynata_lu
- Dynamic Stiffness Optimization Using RadiossUploaded byMounika Katragadda
- PV Hybrid IDUploaded byempty87
- Blending module.pdfUploaded byBrandy Gonzalez
- annotated bibliographyUploaded byapi-321262260
- Lin and Li Fuzzy Ranking MethodUploaded byErik Van
- Paper 3Uploaded byRajesh
- Optimization of interval type-2 fuzzy logic controllers using evolutionary algorithmsUploaded byAraceli Castruita
- Discrete OptimizationUploaded byTanut Ungwattanapanit
- Robust Imitation StrategiesUploaded byabguy
- Optimal design of storm water inlets for highway drainageUploaded byandershellman
- A new reliability analysis method for uncertain structures with random and interval variablesUploaded byYoun Seok Choi
- L3Uploaded byYsabelle Jimenea
- 2009-404Uploaded byDr alla talal yassin

- 10-2013-Allocation and Sizing of a DG Unit Considering ZIP Load ModelUploaded byAbbas Divian
- 5-2018-A Multi-objective Optimal Sizing and Siting of Distributed GenerationUploaded byAbbas Divian
- 8-2011-Optimal Placement of Multi-distributed Generation Units Including Different Load Models Using Particle Swarm OptimisationUploaded byAbbas Divian
- 13-2013-Placement of Wind and Solar Based DGs in Distribution System for Power Loss Minimization and Voltage Stability ImprovementUploaded byAbbas Divian
- 3-2004-Distributed Generation Technologies Definitions and BenefitsUploaded byAbbas Divian
- 7-2010-Determination of the Optimal Location and Sizing of Distributed Generation Using Particle Swarm OptimizationUploaded byAbbas Divian
- 6-2013-Multiple Distributed Generator Placement in Primary Distribution Networks for Loss ReductionUploaded byAbbas Divian
- 11-2001-Application of Tabu Search to Optimal Placement of Distributed GeneratorsUploaded byAbbas Divian
- 14-2010-Differential Evolutionary Algorithms in Optimal Distributed Generation LocationUploaded byAbbas Divian
- 9-2010-Application of Fuzzy and ABC Algorithm for DG Placement for Minimum Loss in Radial Distribution SystemUploaded byAbbas Divian
- 15-2013-Optimal Placement of Distributed Generations in Radial Distribution Systems Using Various PSO and de AlgorithmsUploaded byAbbas Divian
- 2016 Optimal Placement of DG in Distribution Network for Power LossUploaded byAbbas Divian
- 1-2011-Adequacy Evaluation of Distribution System Including WindSolar DG During Different Modes of OperationUploaded byAbbas Divian
- 2016 Stud Krill Herd Algorithm for Multiple DG Placement and SizingUploaded byAbbas Divian
- 4-2010-Optimal Sizing of Distributed Generation Placed on Radial Distribution SystemsUploaded byAbbas Divian
- راهنمای عملیاتی GamsUploaded byAbbas Divian
- Protection CoordinationUploaded byHassan Bagheri
- 3BSE034679-510 C en System 800xA 5.1 Automated InstallationUploaded byAbbas Divian
- 3BSE034678-510 C en System 800xA 5.1 InstallationUploaded byAbbas Divian
- 3BSE034678-510 C en System 800xA 5.1 InstallationUploaded byAbbas Divian
- Electricity Market Report 2010Uploaded byBalkaner Enerji
- NERC comm_PC_System Protection and Control Subcommittee SPCS DL_Gen Prot Coord Rev1 Final 07-30-2010.pdfUploaded byseyed jamal arghavani
- شفت انکودرUploaded byAbbas Divian
- SIPROTEC Numerical Protection Relays_2008_A2_en 1020 PageUploaded byAbbas Divian
- Bentley Inside Plant readme.pdfUploaded byAbbas Divian
- 1394-10-8-201512291346443951325918394Uploaded byiman_iut88
- پایان نامه.pdfUploaded byAbbas Divian
- پایان نامه.pdfUploaded byAbbas Divian
- 3bse034678-510 c en System 800xa 5.1 InstallationUploaded byDaniel Danieli

- Acp ExciseUploaded byDerouiche Chaima
- PSOCUploaded byAlluri Appa Rao
- sproxyUploaded byViky Dhiw
- e insuanceUploaded bytmt2007
- genre analysis final draftUploaded byapi-402052001
- The Ten Commandments of Computer EthicsUploaded byNeil Reyes Palambiano
- Lean IT Enabling and Sustaining Your Lean TransformationUploaded byAhmed Hamdy Soliman
- Barbara Dunin-Keplicz, Edward Nawarecki-From Theory to Practice in Multi-Agent SystemsUploaded byDetectiv Privat
- GM ResumeUploaded byGuruthumati
- Extract Postscript Images From PDFUploaded byLinda
- People Soft Installation With PatchUploaded byVikas
- jhbjhUploaded byAndrea Rodriguez
- 4th Year QuestionsUploaded byJudith de Roxas
- UserGuide Omnetpp4.2bUploaded byTarek Azizi
- Light-Seeking BrickUploaded byMITFall2010Studio
- Java Aap LetUploaded byChaitAnya Märellä
- Exercise Chapter 3Uploaded byNurAtieqah
- Cost Elements Deletion Having Transaction Data _ SAP BlogsUploaded byManas Kumar Sahoo
- programming the web notesUploaded bysantum0010
- Sales Document Screen Sequence Control _ SAP BlogsUploaded byMirjana Radosavkic
- AS400 Server Capacity Planning_sg242159Uploaded byDanny Tang
- READ FIRST! Easy Configuration of VIGOUploaded byvyasking
- DLQ-3000+ service ManualUploaded bypatrickdegr
- Dbms Output Put LineUploaded bySreenivasa R Peruri
- The Role of the Product Management Office in ScrumUploaded byabdul rasheed shaik
- MSVMpackUploaded bymkiran02
- Backup Script DocumentationUploaded bymenuselect
- Data Flow Diagram Level 2Uploaded byJade Queen
- 101E User's Manual 20120815Uploaded byAbraham Lopez
- Google GlassUploaded bypankajsyal