Escolar Documentos
Profissional Documentos
Cultura Documentos
to
Index TermsArtificial bee colony (ABC), distributed generation (DG), metaheuristic optimization algorithm, power losses reduction.
NOMENCLATURE
I. INTRODUCTION
Manuscript received August 12, 2009; revised March 13, 2010; accepted May
13, 2011. Date of current version October 07, 2011. Paper no. TPWRD-006092009.
The authors are with the Department of Electrical and Computer Engineering,
Dalhousie University, Halifax, NS B3J 1Z1 Canada (e-mail: abumouti@dal.ca;
elhawary@dal.ca).
Color versions of one or more of the figures in this paper are available online
at http://ieeexplore.ieee.org.
Digital Object Identifier 10.1109/TPWRD.2011.2158246
2091
2092
(2)
(3)
(4)
where
.
The inequality constraints are the systems voltage limits,
that is, 5% of the nominal voltage value
(5)
In addition, the thermal capacity limits of the networks
feeder lines are treated as inequality constraints
(6)
The boundary (discrete) inequality constraints are the
DG-units size (kVA) and power factor
(7)
(8)
Practical concerns in terms of DG-unit sizes and power
factors are considered in the proposed method. Since the
rounded-off issues of the DG-units size or
are treated
initially in the proposed method, the accuracy of the results is guaranteed. The preselected (discretized) DG-unit
sizes are from 10%80% of the total system demands (i.e.,
), approximated to integer values with a 100-step
interval between sizes.
is set to operate at practical values [11],
The DG-units
thta is, unity, 0.95, 0.90, and 0.85 towards the optimal result.
(i.e., lagging or leading)
Moreover, the operating DG-units
must be dissimilar to the buss load
at which the DG-unit
is placed [12]. Consequently, the net total of both active and
reactive powers of that bus (where the DG-unit is placed) will
decrease.
III. ARTIFICIAL BEE COLONY (ABC) ALGORITHM
The artificial bee colony (ABC) algorithm is a new metaheuristic optimization approach, introduced in 2005 by
Karaboga [13]. Initially, it was proposed for unconstrained
optimization problems. Then, an extended version of the ABC
(9)
where
is the fitness value of a solution , and
is the
total number of food-source positions (solutions) or, in other
words, half of the colony size. Clearly, resulting from using (9),
a good food source (solution) will attract more onlooker bees
than a bad one. Subsequent to onlookers selecting their preferred
food-source, they produce a neighbor food-source position
to the selected one , and compare the nectar amount (fitness
value) of that neighbor
position with the old position.
The same selection criterion used by the employed bees is applied to onlooker bees as well. This sequence is repeated until all
onlookers are distributed. Furthermore, if a solution does not
improve for a specified number of times (limit), the employed
bee associated with this solution abandons it, and she becomes
a scout and searches for a new random food-source position.
Once the new position is determined, another ABC algorithm
starts. The same procedures are repeated until
cycle
the stopping criteria are met.
In order to determine a neighbouring food-source position
(solution) to the old one in memory, the ABC algorithm alters
one randomly chosen parameter and keeps the remaining parameters unchanged. In other words, by adding to the current
chosen parameter value the product of the uniform variant
and the difference between the chosen parameter value
2093
Step 3)
Step 4)
Step 5)
Step 6)
Step 7)
Step 8)
Step 9)
(12)
where
represents the response of (1) at
solution .
Produce neighbor solutions for the employed bees by
using (10) and evaluate them as indicated by Step 2).
Apply the selection process.
If all onlooker bees are distributed, go to Step 9).
Otherwise, go to the next step.
Calculate the probability values for the solutions
using (9).
Produce neighbor solutions for the selected onlooker
bee, depending on the value, using (10) and evaluate
them as Step 2) indicates.
Follow Step 4).
Determine the abandoned solution for the scout bees,
if it exists, and replace it with a completely new
solution sing (11) and evaluate them as indicated in
Step 2).
2094
2095
TABLE II
EXACT METHOD OPTIMAL RESULT OF TEST CASE 1
TABLE I
SUMMARY OF THE 69-BUS SYSTEM DEFAULT CASE
Fig. 5. Compensation results of test case 1 for 69-bus system due to load scenario I.
mally obtained using the exact method. The real power loss reductions at both scenarios were 89% and 90%, respectively. Furimproved
thermore, under scenarios I and II, the system
by 0.0631 p.u. and 0.103 p.u., respectively. The enhancement
results in terms of voltage profiles and loss reductions are illustrated in Figs. 5 and 6. Approximately 120 W was the difference
between the best and the worst (local minima) results under scenario II. This was due to the DG-unit size in the worst result
being 100 kVA less.
A. Test Case 1
In this test case, an exact solution method was created to
verify the results of the proposed ABC algorithm. The exact
method provided the optimal result by examining all possible
solution combinations and then retaining the optimal one. Although the exact method is time and memory consuming, it
will answer the pertinent question raised: how far is the proposed algorithms optimal result from the exact optimal one?
Table II lists the optimal solutions obtained by the exact method
for both scenarios. Finally, the proposed ABC algorithm results
are recorded in Table III.
Clearly, as shown in Table III, the best results of the proposed
ABC algorithm, in both scenarios, were identical to those opti-
B. Test Case 2
The number of possible solution combinations for this test
case and the remaining ones were tremendously large. Consequently, the exact method in these test cases would have required massive amounts of time and memory. As an alternative,
the proposed ABC algorithm was exhaustively utilized to solve
those test cases with a 2000
. The convergence characteristic of the exhaustive ABC algorithm under different scenarios is shown in Fig. 7. It is important to state that the proposed
ABC and exhaustive-ABC algorithms successfully achieved the
same best solutions for test cases 2 4. As Table IV shows, further compensation to the system under different load scenarios
2096
TABLE III
SIMULATION RESULTS OF THE ABC ALGORITHM OVER 30 INDEPENDENT RUNS AT TEST CASE 1
D. Test Case 4
Fig. 6. Compensation results of test case 1 for 69-bus system due to load scenario II.
2097
TABLE IV
SIMULATION RESULTS OF THE ABC ALGORITHM OVER 30 INDEPENDENT RUNS AT TEST CASE 2
Fig. 8. Compensation results of test case 2 for 69-bus system due to load scenario I.
Fig. 9. Compensation results of test case 2 for the 69-bus system due to load
scenario II.
that obtained without limiting the DG-unit size. The enhancement results in terms of voltage profile and loss reduction are
illustrated in Fig. 18.
F. Comparative Study
Although the proposed ABC algorithm proved its robustness
in solving the previous test cases, an additional radial distribution feeder system was considered. The IEEE 33-bus and 69-bus
radial distribution feeder systems were adopted for comparison
purposes. Therefore, the results of the proposed ABC algorithm
were compared with the solutions obtained based on the analytical method [9] and GA method [26]. Tables VIII and IX summarize the optimal solutions achieved by these methods. The
DG-unit applications in [9] and [26] were limited to supply real
power only. In addition, scenario I was utilized in this comparison. The single-line diagram of the 33-bus feeder system
is shown in Fig. 19.
Observing Tables VIII and IX, the results in terms of optimal placement of the DG-unit were identical. However, if the
optimal DG-unit sizes in the analytical or GA methods were
rounded off to the closest practical rate, the accuracy of the results would be affected. The proposed algorithm avoids this limitation and the accuracy of the results is guaranteed. Besides
that, a slight improvement in loss reduction is achieved by the
proposed ABC algorithm in both systems.
2098
TABLE V
SIMULATION RESULTS OF THE ABC ALGORITHM OVER 30 INDEPENDENT RUNS AT TEST CASE 3
Fig. 11. Compensation results of test case 3 for the 69-bus system due to load
scenario I.
Fig. 12. Compensation results of test case 3 for the 69-bus system due to load
scenario II.
G. Discussion
Deregulating electric power networks is one of the factors that hasten DG-unit applications. In addition, renewable
resources push the DG-unit applications problem to a different-dimension (i.e., supply-uncertainty). Both consumers
and utilities benefit from the DG-unit application, for example,
in terms of reliability and energy savings. However, employing
the DG-unit practically is not an easy task. Many factors:
environmental, social, economical, and even political, affect the
final optimal attainment solution. Therefore, the decision-maker
has some different questions to consider in the optimization
problem: whether the optimal DG-unit placement is practically
available; whether the appropriate DG-units type is allowable
at that location; which one, utility or consumer, has control on
that DG-unit, and so on. All of these variables will significantly
influence the optimal solution. Consequently, different DG-unit
application problems have their own practical constraints and,
thus, the results obtained for one problem are not necessarily
valid for another.
2099
TABLE VI
SIMULATION RESULTS OF THE ABC ALGORITHM OVER 30 INDEPENDENT RUNS AT TEST CASE 4
Fig. 14. Compensation results of test case 4 for the 69-bus system due to load
scenario I.
Fig. 15. Compensation results of test case 4 for the 69-bus system due to load
scenario II.
Fig. 16. Voltage profile enhancement of all test cases due to different load scenarios.
other methods. Among all test cases, test case 2 had the maximum power loss reductions as well as voltage improvements.
2100
TABLE VIII
COMPARISON OF OPTIMAL DG-UNIT RESULTS FOR THE 33-BUS FEEDER
SYSTEM
TABLE IX
COMPARISON OF OPTIMAL DG-UNIT RESULTS FOR THE 69-BUS FEEDER
SYSTEM
Fig. 17. Power loss reductions of all test cases due to different load scenarios.
TABLE VII
SIMULATION RESULTS OF THE ABC ALGORITHM OVER 30 INDEPENDENT RUNS
AT TEST CASE 5
REFERENCES
[1] C. L. T. Borges and D. M. Falcao, Impact of distributed generation
allocation and sizing on reliability, losses and voltage profile, in Proc.
IEEE Power Tech Conf., Bologna, Italy, 2003, vol. 2, pp. 15.
[2] IEEE Standard for Interconnecting Distributed Resources with Electric
Power systems, IEEE Std. 1547-2003, 2003, pp. 116.
[3] T. A. Short, Electric Power Distribution Handbook, 1st ed. Boca
Raton, FL: CRC, 2003.
[4] A. D. T. Le, M. A. Kashem, M. Negnevitsky, and G. Ledwich, Optimal distributed generation parameters for reducing losses with economic consideration, in Proc. IEEE Power Eng. Soc. Gen. Meeting,
Jun. 2007, pp. 18.
[5] A. D. T. le, M. A. Kashem, M. Negnevitsky, and G. Ledwich, Maximising voltage support in distribution systems by distributed generation, in Proc. IEEE TENCON Conf., 2005, pp. 16.
[6] M. A. Kashem, A. D. T. Le, M. Negnevitsky, and G. Ledwich, Distributed generation for minimization of power losses in distribution systems, in Proc. IEEE Power Eng. Soc. Gen. Meeting, 2006, pp. 18.
[7] M. Mardaneh and G. B. Gharehpetian, Siting and sizing of DG
units using GA and OPF based technique, in Proc. IEEE Region 10
TENCON Conf., Nov. 2124, 2004, vol. 3, pp. 331334.
[8] B. A. de Souza and J. M. C. de Albuquerque, Optimal placement of
distributed generators networks using evolutionary programming, in
Proc. Transm. Distrib. Conf. Expo.: Latin Amer., 2006, pp. 16.
[9] N. Acharya, P. Mahat, and N. Mithulananthan, An analytical approach
for DG allocation in primary distribution network, Elect. Power Syst.
Res., vol. 28, no. 10, pp. 669678, Dec. 2006.
[10] F. S. Abu-Mouti and M. E. El-Hawary, A new and fast power flow
solution algorithm for radial distribution feeders including distributed
generations, in Proc. IEEE Int. Conf. Syst., Man, Cybern., Oct. 2007,
pp. 26682673.
[11] P. P. Barker and R. W. De Mello, Determining the impact of distributed generation on power systems part 1: Radial distribution systems, in Proc. IEEE Power Eng. Soc. Summer Meeting, Jul. 1620,
2000, vol. 3, pp. 16451656.
[12] M. E. El-Hawary, Electrical power systems: Design and analysis, in
IEEE Press Power Systems Eng. Ser. New York: Wiley, 1995, pp.
6666.
[13] D. Karaboga, An idea based on honey bee swarm for numerical optimization, in Tech. Rep. TR06. Kayseri, Turkey: Dept. Comput. Eng.,
Erciyes Univ., 2005.
[14] D. Karaboga and B. Basturk, Artificial Bee Colony (ABC) Optimization
Algorithm for Solving Constrained Optimization Problems. Berlin,
Germany: Springer-Verlag, 2007, vol. LNAI 4529, pp. 789798.
[15] B. Basturk and D. Karaboga, An artificial bee colony (ABC) algorithm
for numeric function optimization, in Proc. IEEE Swarm Intell. Symp.,
Indianapolis, IN, May 1214, 2006.
[16] D. Karaboga and B. Basturk, A powerful and efficient algorithm for
numerical function optimization: Artificial bee colony (ABC) algorithm, J. Global Optimiz., vol. 39, pp. 459471, 2007.
[17] R. S. Rao, S. V. L. Narasimham, and M. Ramalingaraju, Optimization
of distribution network configuration for loss reduction using artificial
bee colony algorithm, Int. J. Elect. Power Energy Syst. Eng., vol. 1,
no. 2, 2008.
[18] D. Karaboga and B. Basturk, On the performance of artificial bee
colony (ABC) algorithm, Appl. Soft Comput., vol. 8, no. 1, pp.
687697, 2008.
[19] D. Karaboga, B. B. Akay, and C. Ozturk, Artificial bee colony (ABC)
optimization algorithm for training feed-forward neural networks,
Lect. Notes Comput. Sci.: Modeling Decisions for Artif. Intell., vol.
4617, pp. 318319, 2007.
[20] C. T. Ioan, The particle swarm optimization algorithm: Convergence
analysis and parameter selection, Inf. Process. Lett., vol. 85, pp.
317325, 2003.
[21] K. Deb, An efficient constraint handling method for genetic algorithms, Comput. Meth. Appl. Mech. Eng., vol. 186, no. 24, pp.
311338, 2000.
2101
Fahad S. Abu-Mouti (S07) received the B.Sc. degree in electrical engineering from Qatar University,
Doha, Qatar, in 2003 and the M.A.Sc. degree in
electrical engineering from Dalhousie University,
Halifax, NS, Canada, in 2008, where he is currently
pursuing the Ph.D. degree.
From 2003 to 2006, he joined the Saudi Electricity
Company, Riyadh, Saudi Arabia, where he was in
charge of the O&M section. In 2009, he received
a government scholarship. His research interests
include distributed generation and renewable energy
resources applications, power system operation and control, planning, and
metaheuristic optimization algorithms.
Mr. Abu-Mouti is a member of the Saudi Council of Engineers.