International Journal of Advances in Applied Sciences (IJAAS)

Vol. 10, No. 2, June 2021, pp. 149~155

ISSN: 2252-8814, DOI: 10.11591/ijaas.v10.i2.pp149-155  149

Real power loss diminution by rain drop optimization algorithm

Lenin Kanagasabai
Department of EEE, Prasad V. Potluri Siddhartha Institute of Technology, Kanuru, Vijayawada, Andhra Pradesh, India

Article Info ABSTRACT

Article history: In this work Rain Drop Optimization (RDO) Algorithm is projected to reduce
power loss. Proceedings of Rain drop have been imitated to model the RDO
Received Apr 29, 2020 algorithm. Natural action of rain drop is flowing downwards form the peak
Revised Mar 15, 2021 and it may form small streams during the headway from the mountain or hill.
Accepted Apr 16, 2021 As by gravitation principle raindrop flow as stream then as river form the
peak of mountains or hill then it reach the sea as global optimum. Proposed
Rain Drop Optimization (RDO) Algorithm evaluated in IEEE 30, bus test
Keywords: system. Power loss reduction, voltage deviation minimization, and voltage
stability improvement has been achieved.
Optimal reactive power
Rain drop optimization
algorithm
Transmission loss
This is an open access article under the CC BY-SA license.

Corresponding Author:
Lenin Kanagasabai
Department of EEE
Prasad V. Potluri Siddhartha Institute of Technology
Kanuru, Vijayawada, Andhra Pradesh-520007, India
Email: [email protected]

1. INTRODUCTION
Real power loss reduction is main objective of this work. Various methods conventional [1]-[6] and
Evolutionary techniques [7]-[19] are applied to solve the problem. Rain Drop Optimization (RDO) Algorithm
applied to reduce the power loss. Rain drop actions have been imitated to model the algorithm. Natural
behavior of rain drop is flowing downwards form the peak and it will form small streams during the
progression from the hill. With reference to the gravitation the raindrop flow as stream then as river from the
peak of mountains or hill then finally it reaches the sea. Reaching the sea by passing many areas including
valleys is global optimum. Raindrops are engendered in arbitrary mode in the initial iteration itself, then each
rain drop will assign a neighborhood by itself then in arbitrary mode neighbor points are produced. Projected
algorithm begins with arbitrarily engendered solution afterwards exploration has been done sequentially
around the present point until end of the end criterion and also revision of the present value will be there
throughout the procedure. Rain Drop Optimization (RDO) Algorithm evaluated in standard IEEE 30, bus test
system. Voltage deviation and power minimization achieved along with voltage enhancement.

2. PROBLEM FORMULATION
Solving the optimal reactive power dispatch (ORPD) problem plays a significant role in the efficient
operation and planning of the power system. The aim of solving the ORPD is to determine the best operating
point of system for maximizing the voltage stability, minimizing the system loss and the voltage deviations.
The best operating point includes the terminal voltages of the generators, taps of transformers and the
injected reactive powers of the shunt compensators. The solution of the ORPD problem is formulated as an

Journal homepage: http://ijaas.iaescore.com

150  ISSN: 2252-8814

optimization problem applied for assigning set control parameters for a certain objective function, satisfying
the operating constraints of the system.

Minimization F̃(x̅, y̅) (1)

Subject to (2)

E(x̅, y̅) = 0 (2)

I(x̅, y̅) = 0 (3)

x = [VG1 , . . , VGNg ; QC1 , . . , QCNc ; T1 , . . , TNT ] (4)

y = [PGslack ; VL1 , . . , VLNLoad ; QG1 , . . , QGNg ; SL1 , . . , SLNT ] (5)

Fitness function (F1 ) (6) is defined to diminish the power loss (MW),

2 2
F1 = PMin = Min [∑NTL
m Gm [Vi + Vj − 2 ∗ Vi Vj cosØij ]] (6)

Fitness function (F2 ) minimization of Voltage deviation is (7),

N desired 2 Ng 2
LB
F2 = Min [∑i=1 |VLk − VLk | + ∑i=1|Q GK − QLim
KG | ] (7)

Fitness function (F3 ) (8) voltage stability index (L-index) is (9), (10), (11).

F3 = Min LMax (8)

LMax = Max[Lj ]; j = 1; NLB (9)

Vi
Lj = 1 − ∑NPV
i=1 Fji Vj
And { (10)
Fji = −[Y1 ]1 [Y2 ]

V
LMax = Max [1 − [Y1 ]−1 [Y2 ] × i ] (11)
Vj

Equality constraints

0 = PGi − PDi − Vi ∑j∈NB Vj [Gij cos[Øi − Øj ] + Bij sin[Øi − Øj ]] (12)

0 = QGi − QDi − Vi ∑j∈NB Vj [Gij sin[Øi − Øj ] + Bij cos[Øi − Øj ]] (13)

Inequality constraints

min max
Pgslack ≤ Pgslack ≤ Pgslack (14)

Qmin max
gi ≤ Q gi ≤ Q gi , i ∈ Ng (15)

VLmin
i ≤ VLi ≤ VLmax
i , i ∈ NL (16)

Timin ≤ Ti ≤ Timax , i ∈ NT (17)

Qmin
c ≤ Q c ≤ Qmax
C , i ∈ NC (18)

|SLi | ≤ SLmax
i
, i ∈ NTL (19)

Int J Adv Appl Sci, Vol. 10, No. 2, June 2021: 149 – 155
Int J Adv Appl Sci ISSN: 2252-8814  151

VGimin ≤ VGi ≤ VGimax , i ∈ Ng (20)

Multi objective fitness is (21), (22), (23)

2 2
MOF = OF1 + xi OF2 + yOF3 = OF1 + [∑NL min
i=1 xv [VLi − VLi ] + ∑NG min
i=1 xg [QGi − QGi ] ] + xf OF3 (21)
VLmax
i , VLi > VLmax
i
VLmin
i = { min (22)
VLi , VLi < VLmin
i

𝑄𝐺𝑖𝑚𝑎𝑥 , 𝑄𝐺𝑖 > 𝑄𝐺𝑖𝑚𝑎𝑥

𝑄𝐺𝑖𝑚𝑖𝑛 = { (23)
𝑄𝐺𝑖𝑚𝑖𝑛 , 𝑄𝐺𝑖 < 𝑄𝐺𝑖𝑚𝑖𝑛

3. RAIN DROP OPTIMIZATION ALGORITHM

Natural behavior of rain drop is flowing downwards form the peak and it will form small streams
during the progression from the hill [20]. In the projected algorithm rain drops will be a particle in the
population, and it has been described as (24),

DP i = [Yi,1 , Yi,2 , Yi,3 , . . , Yi,k , . . , Yi,n ] i ∈ {1,2,3, . . , m} (24)

DP i symbolize rain drop, number of variables indicated by “n” and Yi,k indicate the k th variable in
the problem, size of the population is defined by “m”. DP i has been assumed as a vector or point in the “N”
dimensional axis and through uniform distribution it has been engendered as function with constraints as
(25).

Yi,k = uniform distribution function (UDF). (Lowerk , Upperk ) (25)

With radius “r” around the point of Rain Drop (RD) in the “N” dimensional axis with respect to the
neighborhood value the change in Rain Drop (RD) value will be modernized. A Rain Drop (RD) “i” which
possess a neighbor point “j” is indicated by NHPji as (26) and (27),

‖(RDi − NHPji ). unit vectork ‖ ≤ ‖radius(r). unit vectork ‖ (26)

raduis(r) = raduisinitial × f(iteration) (27)

Naturally the dominant or main (M) neighbor point NHPMi satisfy amongst of all rain drop RDi and
by objective function (F) the rain drop and neighbor point values are obtained by (28) and (29),

F(NHPMi ) < 𝐹(RDi ) (28)

F(NHPMi ) < 𝐹(NHPji ) (29)

No main point for a single rain drop RDi then predominantly in the position of stationary. Then the
rain drop has been take out of this situation through a procedure of explosion is defined by (30),

NHPexploration = neighbor point × explosion base × explosion counter (30)

The ranking of the rain drops in iteration’s is given by (31) and (32),

D1it = F(RDi )|at t th iteration − F(RDi )|at 1st iteration (31)

D2it = F(RDi )|at t th iteration (32)

order(D1it ), order(D2it ); are orders at iteration t (33)

ω1 , ω2 ; are weight cofficients and ranking it is rank of rain drop RDi

Raindrops are engendered in arbitrary mode in the initial iteration itself, then each rain drop will
assign a neighborhood by itself then in arbitrary mode neighbor points are produced. Throughout the
procedure of the optimization the neighbor point will be within in the exploration space limits and if any
engendered beyond the exploration space limit then it has been modernized by (34) and (35).
Real power loss diminution by rain drop optimization algorithm (Lenin Kanagasabai)
152  ISSN: 2252-8814

if(NHPji ) < Lowerk then(NHPji ) = Lowerk (34)

k k

if(NHPji ) < Upperk then(NHPji ) = Upperrk (35)

k k

Subsequently for each rain drop and its neighbor points cost function will be computed then the
comparison of values between rain drop and neighbor point will be done when there is dominant or main
neighbor point found then the rain drop move towards to that point by altering its position.
− Begin
− Parameters values are engendered
− Fix the each rain drop value as active
− Rain drop’s initial population produced
− Iteration =1
− Drop number =1
− Explosion counter =0
− Is rain drop is active? if yes got to next step or else go to step “o”
− Engender the neighbor points
− Rain drop and neighbor point cost function value computed
− Change of rain drop position when a dominant neighbor point has been found then Explosion counter =0
then go to step “n”
− Otherwise exploration process will be applied
− Fix the rain drop as live
− Swap the rain drop with dominant neighbor point
− Drop number +1
− Is drop number <= number of population? If yes go to step “g”
− Otherwise iteration +1
− Even after applying the exploration process no neighbor point found means then that particular rain drop is
marked as motionless
− After creation of the worth order list then lower order value rain drops are marked as motionless
− Any live or active rain drop found ; Itertaion <= maximum itertaion
− If yes go step “f”
− Otherwise go to next step “w”
− For all rain drops the cost function value will be computed
− Discover the rain drop which possess the minimum cost functional value
− Then optimal solution is the cost and raindrop position
− End

4. SIMULATION RESULTS
Projected Rain Drop Optimization (RDO) Algorithm evaluated in standard IEEE 30 bus system
[21]. Active and reactive power consumption is 2.8340 and 1.2620 per unit in 100 MVA base. Table 1 and
Table 2 shows the parameters [21]; then Table 3 to Table 4 shows the comparison results. Figures 1-4 gives
the graphical comparison.

Table 1. Variables
System [21] Variables Minimum (PU) Maximum (PU)
VG 0.950 1.10
Tt 0.90 1.10
VAR 0.0 5 .0

Table 2. System parameters

Description [21] IEEE 30 bus
NB 30
NG 6
NT 4
NQ 9
NE 41
Power loss 5.660
Base casee for VD (Per Uit) 0.582170

Int J Adv Appl Sci, Vol. 10, No. 2, June 2021: 149 – 155
Int J Adv Appl Sci ISSN: 2252-8814  153

Table 3. Power loss comparison with different metaheuristicalgorithms

DE[22] GSA[23] APO-PSO [24] RDO
Power Loss (MW) 4.555 4.5143 4.398 0.940
Voltage .D (PU) 1.9589 0.87522 1.047 4.226
L-index (PU) 0.55130 0.141090 0.12670 1.044

Table 4. Comparison with reference to voltage stability improvement

DE[22] GSA[23] APO-PSO [24] RDO
Power loss(MW) 6.4755 6.9117 5.698 5.429
Volatge D (PU) 0.0911 0.0676 0.087 0.083
L-index (PU) 0.143520 0.13490 0.13770 0.1314

Table 5. Comparison with reference to voltage deviation minimization

DE[22] GSA[23] APO-PSO [24] RDO
Power loss (MW) 7.0733 4.9752 4.478 4.249
Volatge. D (PU) 1.419 0.21579 1.8579 1.8205
L-index (PU) 0.12460 0.136840 0.12270 0.1173

Table 6. Comparison of values with reference to multi objective formulation

APO-PSO [24] RDO
Power Loss (MW) 4.842 4.738
Volatge .D (PU) 1.009 1.003
L-index (PU) 0.1192 0.1184

Figure 1. Comparison of power loss Figure 2. Comparison with respect to VSI

Figure 3. Comparison of loss with reference with Figure 4. Comparison of loss with reference with
VDM MOF

5. CONCLUSION
In this work optimal reactive power dispatch problem has been successfully solved by Rain Drop
Optimization (RDO) Algorithm. Projected algorithm begins with arbitrarily engendered solution afterwards
exploration has been done sequentially around the present point until end of the end criterion and also
Real power loss diminution by rain drop optimization algorithm (Lenin Kanagasabai)
154  ISSN: 2252-8814

revision of the present value will be there throughout the procedure. Throughout the procedure of the
optimization the neighbor point will be within in the exploration space limits and if any engendered beyond
the exploration space limit then it has been modernized. Rain Drop Optimization (RDO) Algorithm evaluated
in IEEE 30, bus test system. Voltage stability enhanced, power loss reduced with voltage deviation
minimization.

REFERENCES
[1] K. Y. Lee, Y. M. Park, J. L. Ortiz, “Fuel-cost minimisation for both real and reactive-power dispatches,”
Proceedings Generation, Transmission and Distribution Conference, vol. 131, no. 3, pp. 85-93, 1984. [Online].
Available: https://digital-library.theiet.org/content/journals/10.1049/ip-c.1984.0012.
[2] O.Alsac, and B. Scott, “Optimal load flow with steady state security,” IEEE Transaction. PAS -1973, pp. 745-751.
[3] K. Aoki, A. Nishikori, R. Yokoyama, “Constrained Load Flow Using Recursive Quadratic Programming,” in IEEE
Transactions on Power Systems, vol. 2, no. 1, pp. 8-16, Feb. 1987. [Online]. Available:
https://ieeexplore.ieee.org/abstract/document/4335064.
[4] D. S. Kirschen, H. P. Van Meeteren, “MW/voltage control in a linear programming based optimal power flow,” in
IEEE Transactions on Power Systems, vol. 3, no. 2, pp. 481-489, May 1988. [Online]. Available:
https://ieeexplore.ieee.org/abstract/document/192899.
[5] W. -. E. Liu, A. D. Papalexopoulos, W. F. Tinney, “Discrete shunt controls in a Newton optimal power flow,” in
IEEE Transactions on Power Systems, vol. 7, no. 4, pp. 1509-1518, Nov. 1992. [Online]. Available:
https://ieeexplore.ieee.org/abstract/document/207375.
[6] V. H. Quintana, M. Santos-Nieto, “Reactive-power dispatch by successive quadratic programming,” in IEEE
Transactions on Energy Conversion, vol. 4, no. 3, pp. 425-435, Sept. 1989. [Online]. Available:
https://ieeexplore.ieee.org/abstract/document/43245.
[7] V. de Sousa, E. Baptista, G. da Costa, “Optimal reactive power flow via the modified barrier Lagrangian function
approach,” Electric Power Systems Research, vol. 84, no. 1, pp. 159-164, 2012. [Online]. Available:
https://www.sciencedirect.com/science/article/abs/pii/S0378779611002677.
[8] Uğur Arifoğlu, Faruk Yalçin, “System Constrained Active Power Loss Minimization in Practical Multi-terminal
HVDC Systems through GA,” Sakarya University Journal of Science, vol. 22, no. 4, pp. 1163-1173, 2018.
[Online]. Available: http://www.saujs.sakarya.edu.tr/en/download/article-file/486207.
[9] S. Kamel, S. Abdel-Fatah, M. Ebeed, J. Yu, K. Xie, C. Zhao, “Solving Optimal Reactive Power Dispatch Problem
Considering Load Uncertainty,” 2019 IEEE Innovative Smart Grid Technologies - Asia (ISGT Asia), Chengdu,
China, 2019, pp. 1335-1340.
[10] Biplab Bhattacharyya, Nihar Karmakar, “Optimal Reactive Power Management Problem: A Solution Using
Evolutionary Algorithms,” IETE Technical Review, vol. 37, no. 5, pp. 540-548, 2019. [Online]. Available: DOI:
10.1080/02564602.2019.1675541.
[11] Ram Kishan Mahate, Himmat Singh, “Multi-Objective Optimal Reactive Power Dispatch Using Differential
Evolution,” International Journal of Engineering Technologies and Management Research, vol. 6, no. 2, pp. 27-38,
2019. [Online]. Available: https://doi.org/10.29121/ijetmr.v6.i2.2019.353.
[12] Nguyen, Thang Trung, Vo, Dieu Ngoc, “Improved social spider optimization algorithm for optimal reactive power
dispatch problem with different objectives” Neural Computing and Applications, vol. 32, pp. 5919-5950, 2020.
[Online]. Available: https://doi.org/10.1007/s00521-019-04073-4.
[13] S. Yang, W. Wang, C. Liu, Y. Huang, “Optimal reactive power dispatch of wind power plant cluster considering
static voltage stability for low-carbon power system,” in Journal of Modern Power Systems and Clean Energy, vol.
3, no. 1, pp. 114-122, March 2015. [Online]. Available: https://doi.org/10.1007/s40565-014-0091-x.
[14] S. Emiroglu, Y. Uyaroglu, G. Ozdemir, “Distributed Reactive Power Control based Conservation Voltage
Reduction in Active Distribution Systems,” Advances in Electrical and Computer Engineering, vol. 17, no.4, pp.
99-106, 2017. [Online]. Available: doi:10.4316/AECE.2017.04012.
[15] Mojtaba Ghasemi, Mahdi Taghizadeh, Sahand Ghavidel, Jamshid Aghaei, Abbas Abbasian, “Solving optimal
reactive power dispatch problem using a novel teaching–learning-based optimization algorithm,” Engineering
Applications of Artificial Intelligence, vol. 39, pp. 100-108, 2015. [Online]. Available:
https://www.sciencedirect.com/science/article/abs/pii/S0952197614002930.
[16] Wei, Yan-Ling, Nguyen, Thang Trung, Vo, Dieu Ngoc, Van Tran, Hai, Van Dai, Le, “Optimal Dispatch of
Reactive Power Using Modified Stochastic Fractal Search Algorithm,” Complexity, Hindwai, vol. 2019, ID.
4670820, pp. 1076-2787, 2019. [Online]. Available: https://doi.org/10.1155/2019/4670820.
[17] A. Padilha-Feltrin, D. A. Quijano Rodezno, J. R. S. Mantovani, “Volt-VAR Multiobjective Optimization to Peak-
Load Relief and Energy Efficiency in Distribution Networks,” in IEEE Transactions on Power Delivery, vol. 30,
no. 2, pp. 618-626, April 2015. [Online]. Available: https://ieeexplore.ieee.org/abstract/document/6866925.
[18] I. Khan, Z. Li, Y. Xu, W. Gu, “Distributed control algorithm for optimal reactive power control in power grids,”
International Journal of Electrical Power & Energy Systems, vol. 83, pp. 505-513, Dec. 2016. [Online]. Available:
https://www.sciencedirect.com/science/article/abs/pii/S0142061516306366.
[19] A. Castillo, P. Lipka, J. Watson, S. S. Oren, R. P. O'Neill, “A successive linear programming approach to solving
the iv-acopf,” in IEEE Transactions on Power Systems, vol. 31, no. 4, pp. 2752-2763, July 2016. [Online].
Available: https://ieeexplore.ieee.org/abstract/document/7299702.

Int J Adv Appl Sci, Vol. 10, No. 2, June 2021: 149 – 155
Int J Adv Appl Sci ISSN: 2252-8814  155

[20] H. Shah-Hosseini, “The intelligent water drops algorithm: a nature-inspiredswarm-based optimization algorithm,”
International Journal of Bio-Inspired Computation, vol. 1, no. 1-2, pp. 71–79, 2009. [Online]. Available:
https://doi.org/10.1504/IJBIC.2009.022775.
[21] Illinois Center for a Smarter Electric Grid (ICSEG), [Online]. Available: https://icseg.iti.illinois.edu/ieee-30-
bussystem/ (accessed on 25 February 2019).
[22] El Ela A. A, Abido M. A, Spea, S. R, “Differential evolution algorithm for optimal reactive power dispatch,”
Electric Power Systems Research, vol. 81, no. 2, pp. 458-464, 2011. [Online]. Available:
https://www.sciencedirect.com/science/article/abs/pii/S0378779610002385.
[23] Duman. S, Sönmez. Y, Güvenç. U, Yörükeren. N, “Optimal reactive power dispatch using a gravitational search
algorithm,” IET Generation Transmission, & Distribution, vol. 6, no. 6, pp. 563-567, 2012.
[24] Aljohani T. M, Ebrahim A. F, Mohammed O, “Single and Multiobjective Optimal Reactive Power Dispatch Based
on Hybrid Artificial Physics–Particle Swarm Optimization,” Energies, vol. 12, no. 12, pp. 1-24, 2019. [Online].
Available: https://doi.org/10.3390/en12122333.

BIOGRAPHY OF AUTHOR

Lenin Kanagasabai has received his B.E., Degree in Electrical and Electronics Engineering from
University of Madras, M.E., Degree in Power Systems from Annamalai University and
completed PhD in Electrical Engineering from Jawaharlal Nehru Technological University
Hyderabad, India. He published more than 300 international journal research papers and
presently working as Professor in Prasad V. Potluri Siddhartha Institute of Technology, Kanuru,
Vijayawada, Andhra Pradesh -520007.

Real power loss diminution by rain drop optimization algorithm (Lenin Kanagasabai)