The 7th International Conference on Modern Power Systems (MPS 2017)
Optimal Capacitor Placement and Sizing
Considering Load Profile Variations Using
Moth-Flame Optimization Algorithm
Oğuzhan Ceylan♦ and Sumit Paudyal†
♦
Istanbul Kemerburgaz University, Turkey;
†
Michigan Technological University, USA;
Email: oguzhan.ceylan@kemerburgaz.edu.tr, sumitp@mtu.edu
Abstract—This paper develops a mathematical model for
optimal capacitor placement and sizing in radial distribution
systems. The optimization model finds placement and sizes of
capacitors considering variations on load profiles with 15-minute
resolution. A recently developed heuristic algorithm, Moth-flame
Optimization Algorithm, is modified and used to solve the model.
Optimization model is tested on a modified 33-node distribution
feeder. Two simulation cases are considered: the first one assumes
a constant tap position of the regulators, the second one adjusts
the tap positions optimally to some constant daily values. The
simulation results show the improvement of the voltage profiles
with the modified Moth-flame Optimization.
Index Terms—optimization, voltage regulation, capacitor
placement, capacitor sizing, moth-flame optimization, radial
distribution systems.
I. I NTRODUCTION
With the changes in power and energy systems in the last
two decades such as deregulation, integration of renewables,
both the philosophical and operational mentality are gradually
changing. From the operation point of view, since the loads
are not constant over time and the outputs of renewable
energy sources are intermittent, control techniques involving
coordinated operation of tap changing transformers and
capacitors are required. Commonly adopted method in system
operation is to use capacitors so that power factor and
the voltage profiles on the system can be improved and
power losses can be reduced [1]. On the other hand, tap
operations of the voltage regulators are also helpful in
obtaining better voltage profiles. From the operation point
of view, if these devices (capacitors, voltage regulators) are
optimally coordinated together, then better voltage profiles can
be obtained. On the other hand, since these devices are based
on mechanical switch operations, frequent operations of the
devices shorten their lifespans; thus, it is advisable to keep
their daily operations within limits despite of high variability
in load and renewables throughout day.
On planning side, installation locations and sizes of
capacitors are essential in distribution systems to reduce power
losses, improve the voltage profiles; hence, the capacitor
allocation and sizing problem are modeled as optimization
problems. There are generally two approaches in solving
optimization problems. The first is based on mathematical
analysis and the second is based on numerical calculations.
978-1-5090-6565-3/17/$31.00 ©2017 IEEE
One may also classify the numerical based optimization
methods into two: derivative based ones and non-derivative
based ones. If the derivatives of the functions in optimization
models are cumbersome to find or the derivatives do not exist,
then non-derivative based methods are preferred. Generally,
such methods are inspired by natural phenomena. The most
popular one is the Genetic Algorithms inspired from the
evolution process in nature [2]. Later, other methods inspired
from the behavior of bird and fish schools, particle swarm [3],
improvisation process of musicians, harmony search [4] etc.,
are developed.
Study on capacitor siting/sizing and their effects on
distribution systems goes back to 60’s [5], [6]. Dynamic
programming [7] was one of the first approaches used to
solve this problem. Later, other approaches such as nonlinear
programming [8], mixed integer linear programming [9],
[10], etc., are applied. Since these type of problems are
combinatorial and complex problems, intelligent optimization
methods are justifiable to use. There are several GA-based
approaches in literature to solve this type of problem including
[11], [12]. Similarly, the authors in [13] use GA-based
approach to find optimal places and sizes of the capacitors.
Some other methods used for solving capacitor siting and
sizing problems are particle swarm optimization [14], tabu
search [15], etc. Recently a new heuristic method aiming
to lower power losses and improve voltage profiles was
developed in [16]. In [17], authors developed a method to
optimally select distributed generators (DGs) and capacitors
to place in distribution systems.
This paper models optimal capacitor sizing and allocation
problem by using recently developed Moth-flame Optimization
(MFO) Algorithm [18]. The objective is to minimize the
voltage deviations considering variations in load profiles and
also to keep the voltage magnitudes in safe ranges. In this
context,
• the first model determines the tap positions, and sizes
and the locations of the capacitors by using representative
daily load profiles.
• the second model considers constant tap positions of the
voltage regulators for representative daily load profiles,
then the model obtains the optimal capacitor size and
location values for other load profiles.
 The rest of the paper is organized as follows: We propose however, when they are in an environment with artificial light,
the optimization models for optimal capacitor location and they might start flying spirally around them [18].
sizing in Section II. In section III, we briefly explain MFO Similar to other nature inspired algorithms, the first step in
and develop the algorithm for optimal capacitor location and MFO is the initialization, which consists of creating moths
sizing problems. Section IV discusses the case studies. and flames. Moths are defined as [18],
 
II. O PTIMIZATION M ODELS FOR C APACITOR L OCATION m1,1 m1,2 · · · · · · m1,d
AND S IZING  m2,1 m2,2 · · · · · · m2,d 
M = . (3)
 
.. .. .. .. 
We model 3 different cases, their mathematical models are  .. . . . . 
given as follows: mn,1 mn,2 · · · · · · mn,d
• Case A: This case considers the size and location of
In (3), the dimension of the problem is d and mi,j represents
capacitors. The aim is minimizing the voltage deviations
the numerical value of each variable. All mi,j values should
over a period of time. The model is as follows,
be randomly chosen in predefined search space ranges. The
end of day N size of the initial moths are n. Also, each row of M in (3)
X X
Minimize ||Vi,t − 1|| represents a candidate solution.
t=1 i=1 The fitness values of the moths are stored in OM vector
subject to 0.95 ≤ Vi,t ≤ 1.05 [18],  
Caploc ∈ busi i = 2, 3 · · · , 33 (1) OM1
 OM2 
Capsize ≤ Capmax OM =  . 
 
(4)
 .. 
Tapmin ≤ Tap ≤ Tapmax
OMn
NCap = m
In the solution process, flames need to be defined as well.
where, Vi,t represents the voltage magnitude on bus i
The moths search all the solution space however the flames
at time t, Caploc represents the location of a capacitor,
represent the best solutions up to that iteration. Flames and
Capsize represents the size of a capacitor, Capmax
their fitness function values are modeled as [18],
represents the maximum allowed size of fixed capacitor  
(1000 kVAr in the simulations). Ncap , and m represent F1,1 F1,2 · · · · · · F1,d
the number of the capacitors used and the maximum  F2,1 F2,2 · · · · · · F2,d 
F = . (5)
 
capacitors available (4 in the simulations), respectively. .. .. .. .. 
 .. . . . . 
Tapmin , Tap, and Tapmin represent the minimum tap
Fn,1 Fn,2 ··· · · · Fn,d
position, actual tap position, and maximum tap position  
of the voltage regulators, respectively. In addition to the OF1
above model, power flow equations are also required,  OF2 
OF =  .  (6)
 
which are not modeled here explicitly. However, we have  .. 
used a ladder logic based to solve the power flow.
OFn
• Case B: This case considers capacitor sizes and locations
only. The optimization model is as follows, MFO consists of three functions: I, P, and T.
end of day N • I function: This is the initialization part of the method,
X X
Minimize ||Vi,t − 1|| where random solution candidates are created and named
t=1 i=1 as moths. Then the fitness values are calculated.
subject to 0.95 ≤ Vi,t ≤ 1.05 • P function: This function is the main function of the
(2) MFO. Solution space is searched by changing the position
Caploc ∈ busi i = 2, 3 · · · , 33
of each moth according to a flame by using a logarithmic
Capsize ≤ Capmax spiral function given in (7). With this function, MFO
NCap = m simulates the movement of moths around light.
This case assumes that the tap positions of the regulators S(Mi , Fj ) = Di ebt cos(2πt) + Fj (7)
are set to 4, and are not changed through the simulations.
• Case C: This case is same as Case B. The only difference where, Mi , Fj , Di represent the ith moth, the j th
is the preset tap positions. This case assumes that the tap flame. and the distance between the ith moth and j th
positions are preset to 0. flame, respectively. Here b is a constant number, and t
is a random number in a range of [-1,1]. During the
III. M OTH F LAME O PTIMIZATION simulation, this range might be changed from r to 1,
MFO is a recently developed heuristic algorithm which is where r linearly decreases from -1 to -2.
based on the behavior of moths against light. For instance, • T function: T function is used to determine the stopping
moths normally use moonlight as their navigation system; condition. There are two possible stopping criteria. In
 the first metod, MFO algorithm runs for a predefined
number of iterations. In the second method, the best value
obtained for the current iteration is checked, and if the
difference of this value to a best value obtained in k th
iteration before is less than a predefined tolerance value,
then the algorithm stops.
A. MFO Based Optimal Capacitor Sizing and Allocation
Algorithm
The optimal capacitor sizing and allocation problem is
solved using MFO as following,
1) Parameter initialization: Initialize the parameters of MFO.
Generally the size of moths and flames are selected
between 30 and 50 depending on the number of variables.
2) Initialization of moths and flames: For Case A, we need
to determine 4 capacitor locations, 4 capacitor sizes, and
2 tap positions. For Case B and C, tap positions are Fig. 2. Daily active load profiles for 3 different simulation days with 15-
assumed to be known and constant. Hence, the size of the minute resolution.
moths and flames will be n = 10, 8, and 8, respectively,
for three cases.
3) Fitness function evaluation: Evaluate the functions given
in optimization models (1) and (2) for each solution
candidate.
4) Solution space search: Move the moths around the
solution space by using equation (7).
5) Check the stopping criterion.
IV. C ASE S TUDIES
We tested our optimization models on a modified 33-bus
distribution system [19]. We placed two voltage regulators:
between nodes 5 and 6, and between nodes 27 and 28 as
shown in Fig. 1.

Fig. 3. Daily reactive load profiles for 3 different simulation days with 15-
minute resolution.

We solved 3 cases defined above (Case-A, B, and C) for

Fig. 1. 33-bus distribution system.
We used a MATLAB based MFO source code provided in
[18] and modified it for optimal capacitor allocation and sizing
problem. We develop a ladder iterative technique [20] to solve
the power flow. We ran the simulations on a PC with 2.40 GHz,
Quad Core CPU and 8.00 GB RAM.
We randomly created three load profiles by scaling the base
loads of the system with 15-minute resolution. The active and
reactive load profiles are shown in Fig. 2 and 3, respectively.
Note that the magnitude of the loads in the first representative
daily load profile (load condition-I) is less than the second one
(load condition-I), and that of second is less than the third one
(load condition-III).
these 3 representative daily loads. The daily voltage plots for
3 days before and after capacitor placement are given in Fig
4, 5 and 6, respectively. In all figures, red lines show the daily
voltage magnitudes when the tap positions of the regulators are
set to 0, and no capacitors exist in the system. In the figures,
blue lines in Case A represent the daily voltage magnitudes
with optimal tap positions of voltage regulators and the sizes
and the locations of capacitors. Green lines in Cases B show
voltage magnitudes with optimal sizes and the locations of
capacitors, and with taps set to 4. Similarly, black lines in
Cases C show voltage magnitudes with optimal sizes and the
locations of capacitors, and with taps set to 0.
Optimal capacitor locations, capacitor sizes, and tap
positions are given in Tables I, II and III for load condition-I,
II and III, respectively. For load condition-I, Case A, optimal
location of the capacitors include two buses on the second
and third laterals, the other optimal locations are found on the
main lateral. Case B, finds an optimal location bus on the first
 TABLE I
S UMMARY OF THE R ESULTS FOR L OAD CONDITION I

Case A
Optimal Capacitor
Location 14 25 31 5
Optimal Capacitor
Size, kVAr 829.3 999.9 758.8 999.9
Optimal Tap
Position 2 1 – –
Case B
Optimal Capacitor
Location 16 22 25 24
Optimal Capacitor
Size, kVAr 648.7 299.9 738.8 999.9
Preset Tap
Position 4 4 – –
Case C
Optimal Capacitor
Fig. 4. Load condition-I, daily voltage magnitudes before and after optimal Location 13 6 28 31
capacitor allocation and sizing. Optimal Capacitor
Size, kVAr 961.5 999.9 999.9 771.7
Preset Tap
Position 0 0 – –

TABLE II
S UMMARY OF THE R ESULTS FOR L OAD CONDITION II

Case A
Optimal Capacitor
Locations 24 26 27 14
Optimal Capacitor
Size, kVAr 999.9 999.7 859.0 692.8
Optimal Tap
Positions 1 2 – –
Case B
Optimal Capacitor
Locations 24 21 16 25
Optimal Capacitor
Size, kVAr 904.9 315.5 498.7 442.9
Preset Tap
Fig. 5. Load condition-II, daily voltage magnitudes before and after optimal Positions 4 4 – –
capacitor allocation and sizing. Case C
Optimal Capacitor
Locations 31 26 13 28
Optimal Capacitor
Size, kVAr 743.7 999.8 970.2 999.9
Preset Tap
Positions 0 0 – –

Since the tap positions are preset to 0 in Case C, the sizes of

Fig. 6. Load condition-III, daily voltage magnitudes before and after optimal
capacitor allocation and sizing.
lateral, two buses on the second lateral, and one bus close to
the far end bus on the main lateral. Case C finds optimal two
buses on the main lateral, and two buses on the third lateral.
the capacitors are the highest ones, Case B finds the minimum
sizes.
In load condition-II, Case-A finds one optimal bus on the
second lateral, two buses on the third lateral and one bus on
the main lateral. Case-B finds two buses on the second lateral,
a bus on the first lateral, and one bus close to far end of the
main lateral. Case-C finds three buses on the third lateral and
one bus on the main lateral. For this load condition, similar
to load condition-I, the highest capacitor sizes are found for
Case-C and the smallest capacitor sizes are found for Case-B.
In load condition-III, Case-A finds two buses on the second
lateral, one bus on the third lateral and one bus on the main
lateral. Case-B finds two buses on the second lateral, one bus
on the first lateral, and one bus on the main lateral. Case-C
finds two buses on the third lateral and two buses on the main
 TABLE III model and gives slightly better results compared to other cases.
S UMMARY OF THE R ESULTS FOR L OAD CONDITION III The numerical results of Case-C which use capacitor sizes and
Case A locations and preset tap positions provide the worst voltage
Optimal Capacitor profiles. In future, to make the computations more realistic,
Locations 25 28 24 14 we are planning to extend this study by making simulations
Optimal Capacitor
Size, kVAr 999.9 752.4 999.9 858.6 on yearly basis, and taking economical considerations.
Optimal Tap
Positions 3 2 – – R EFERENCES
Case B [1] A. Elsheikh, Y. Helmy, Y. Abouelseoud, and A. Elsherif,
Optimal Capacitor “Optimal capacitor placement and sizing in radial electric
Locations 20 15 24 25 power systems,” Alexandria Engineering Journal, vol. 53,
Optimal Capacitor no. 4, pp. 809 – 816, 2014. [Online]. Available:
Size, kVAr 491.1 803.2 999.9 999.9 http://www.sciencedirect.com/science/article/pii/S1110016814001021
Preset Tap [2] D. E. Goldberg and J. H. Holland, “Genetic algorithms and machine
Positions 4 4 – – learning,” Machine Learning, vol. 3, no. 2, pp. 95–99, 1988. [Online].
Case C Available: http://dx.doi.org/10.1023/A:1022602019183
Optimal Capacitor [3] R. Eberhart and J. Kennedy, “A new optimizer using particle swarm
Locations 31 28 13 7 theory,” in Micro Machine and Human Science, 1995. MHS ’95.,
Optimal Capacitor Proceedings of the Sixth International Symposium on, Oct 1995, pp.
Size, kVAr 976.8 999.9 948.8 999.9 39–43.
Preset Tap [4] Z. W. Geem, J. H. Kim, and G. Loganathan, “A new
Positions 0 0 – – heuristic optimization algorithm: Harmony search,” SIMULATION,
vol. 76, no. 2, pp. 60–68, 2001. [Online]. Available:
http://dx.doi.org/10.1177/003754970107600201
TABLE IV [5] R. F. Cook, “Optimizing the application of shunt capacitors for reactive-
S TATISTICAL A NALYSES volt-ampere control and loss reduction,” Transactions of the American
Institute of Electrical Engineers. Part III: Power Apparatus and Systems,
Mean Voltage Magnitude vol. 80, no. 3, pp. 430–441, April 1961.
Load [6] J. V. Schmill, “Optimum size and location of shunt capacitors on
Condition Reference Case-A Case-B Case-C distribution feeders,” IEEE Transactions on Power Apparatus and
I 0.9575 0.9920 0.9936 0.9917 Systems, vol. 84, no. 9, pp. 825–832, Sept 1965.
II 0.9609 0.9920 0.9937 0.9948 [7] H. Dura, “Optimum number, location, and size of shunt capacitors in
III 0.9599 0.9976 0.9985 0.9966 radial distribution feeders a dynamic programming approach,” IEEE
Standard Deviation Transactions on Power Apparatus and Systems, vol. PAS-87, no. 9, pp.
I 0.0265 0.0081 0.0096 0.0082 1769–1774, Sept 1968.
II 0.0248 0.0092 0.0109 0.0087 [8] A. Augugliaro, L. Dusonchet, and S. Mangione, “Optimal
III 0.0270 0.0122 0.0128 0.0120 capacitive compensation on radial distribution systems using
Maximum Voltage nonlinear programming,” Electric Power Systems Research,
I 1.0000 1.0086 1.0218 1.0087 vol. 19, no. 2, pp. 129 – 135, 1990. [Online]. Available:
II 1.0000 1.0104 1.0235 1.0132 http://www.sciencedirect.com/science/article/pii/0378779690900639
III 1.0000 1.0256 1.0326 1.0245 [9] R. Jabr, “Optimal placement of capacitors in a radial network using
Minimum Voltage conic and mixed integer linear programming,” Electric Power Systems
I 0.9038 0.9683 0.9679 0.9676 Research, vol. 78, no. 6, pp. 941 – 948, 2008. [Online]. Available:
II 0.9038 0.9615 0.9600 0.9676 http://www.sciencedirect.com/science/article/pii/S0378779607001526
III 0.9038 0.9732 0.9734 0.9726 [10] M. E. Baran and F. F. Wu, “Optimal capacitor placement on radial
distribution systems,” IEEE Transactions on Power Delivery, vol. 4,
no. 1, pp. 725–734, Jan 1989.
[11] S. Sundhararajan and A. Pahwa, “Optimal selection of capacitors for
lateral. The order of capacitor sizes of Cases-A, B and C are radial distribution systems using a genetic algorithm,” IEEE Transactions
same to those of Load Conditions-I and II. on Power Systems, vol. 9, no. 3, pp. 1499–1507, Aug 1994.
[12] G. Boone and H.-D. Chiang, “Optimal capacitor placement
Table IV provides the statistical analysis for all load in distribution systems by genetic algorithm,” International
conditions and Cases. From the table, it can be seen that Journal of Electrical Power Energy Systems, vol. 15,
the maximum voltages are obtained for Case-B in all load no. 3, pp. 155 – 161, 1993. [Online]. Available:
http://www.sciencedirect.com/science/article/pii/014206159390030Q
conditions. The mean voltage values of this Case are the [13] Q. K. Mohsin, X. Lin, F. F. M. Flaih, S. M. Dawoud, and
closest ones to 1 pu for load condition-I and III. The maximum M. Kdair, “Optimal placement and capacity of capacitor bank in
voltage magnitudes, standard deviations for Case-A, and C are radial distribution system,” in 2016 International Conference on Energy
Efficient Technologies for Sustainability (ICEETS), April 2016, pp. 416–
better compared to those of Case-B. From these results, one 423.
may claim that Case-A gives slightly better results. [14] S. Singh and A. Rao, “Optimal allocation of capacitors
in distribution systems using particle swarm optimization,”
V. C ONCLUSION AND F UTURE W ORK International Journal of Electrical Power Energy Systems,
vol. 43, no. 1, pp. 1267 – 1275, 2012. [Online]. Available:
This paper formulated optimal capacitor allocation and http://www.sciencedirect.com/science/article/pii/S0142061512003213
sizing problems and solved using modified Moth Flame [15] D. F. Pires, A. G. Martins, and C. H. Antunes, “A multiobjective model
Optimization Algorithm. Cases are simulated by using for var planning in radial distribution networks based on tabu search,”
IEEE Transactions on Power Systems, vol. 20, no. 2, pp. 1089–1094,
three daily 15-minute interval load profile data. From the May 2005.
simulations, it is observed that since Case-A takes capacitor
sizes, locations and tap positions into consideration in the
[16] A. Askarzadeh, “Capacitor placement in distribution systems for power
loss reduction and voltage improvement: a new methodology,” IET
Generation, Transmission Distribution, vol. 10, no. 14, pp. 3631–3638,
2016.
[17] M. Doostan, S. Navaratnan, S. Mohajeryami, and V. Cecchi, “Concurrent
placement of distributed generation resources and capacitor banks
in distribution systems,” in 2016 North American Power Symposium
(NAPS), Sept 2016, pp. 1–6.
[18] S. Mirjalili, “Moth-flame optimization algorithm: A novel
nature-inspired heuristic paradigm,” Knowledge-Based Systems,
vol. 89, pp. 228 – 249, 2015. [Online]. Available:
http://www.sciencedirect.com/science/article/pii/S0950705115002580
[19] M. E. Baran and F. F. Wu, “Network reconfiguration in distribution
systems for loss reduction and load balancing,” IEEE Transactions on
Power Delivery, vol. 4, no. 2, pp. 1401–1407, Apr 1989.
[20] W. H. Kersting, Distribution System Modeling and Analysis, 2012.