TY - JOUR
T1 - Optimal reactive power dispatch with uncertainties in load demand and renewable energy sources adopting scenario-based approach
AU - Biswas, Partha P.
AU - Suganthan, P. N.
AU - Mallipeddi, R.
AU - Amaratunga, Gehan A.J.
N1 - Publisher Copyright:
© 2018 Elsevier B.V.
PY - 2019/2
Y1 - 2019/2
N2 - Optimizing reactive power flow in electrical network is an important aspect of system study as the reactive power supports network voltage which needs to be maintained within desirable limits for system reliability. A network consisting of only conventional thermal generators has been extensively studied for optimal active and reactive power dispatch. However, increasing penetration of renewable sources into the grid necessitates power flow studies incorporating these sources. This paper presents a formulation and solution procedure for stochastic optimal reactive power dispatch (ORPD) problem with uncertainties in load demand, wind and solar power. Appropriate probability density functions (PDFs) are considered to model the stochastic load demand and the power generated from the renewable energy sources. Numerous scenarios are created running Monte-Carlo simulation and scenario reduction technique is implemented to deal with reduced number of scenarios. Real power loss and steady state voltage deviation of load buses in the network are set as the objectives of optimization. Success history based adaptive differential evolution (SHADE) is adopted as the basic search algorithm. SHADE has been successfully integrated with a constraint handling technique, called epsilon constraint (EC) handling, to handle constraints in ORPD problem. The effectiveness of a proper constraint handling technique is substantiated with case studies for deterministic ORPD on base configurations of IEEE 30-bus and 57-bus systems using SHADE-EC algorithm. The single-objective and multi-objective stochastic ORPD cases are also solved using the SHADE-EC algorithm. The results are discussed, compared and critically analyzed in this study.
AB - Optimizing reactive power flow in electrical network is an important aspect of system study as the reactive power supports network voltage which needs to be maintained within desirable limits for system reliability. A network consisting of only conventional thermal generators has been extensively studied for optimal active and reactive power dispatch. However, increasing penetration of renewable sources into the grid necessitates power flow studies incorporating these sources. This paper presents a formulation and solution procedure for stochastic optimal reactive power dispatch (ORPD) problem with uncertainties in load demand, wind and solar power. Appropriate probability density functions (PDFs) are considered to model the stochastic load demand and the power generated from the renewable energy sources. Numerous scenarios are created running Monte-Carlo simulation and scenario reduction technique is implemented to deal with reduced number of scenarios. Real power loss and steady state voltage deviation of load buses in the network are set as the objectives of optimization. Success history based adaptive differential evolution (SHADE) is adopted as the basic search algorithm. SHADE has been successfully integrated with a constraint handling technique, called epsilon constraint (EC) handling, to handle constraints in ORPD problem. The effectiveness of a proper constraint handling technique is substantiated with case studies for deterministic ORPD on base configurations of IEEE 30-bus and 57-bus systems using SHADE-EC algorithm. The single-objective and multi-objective stochastic ORPD cases are also solved using the SHADE-EC algorithm. The results are discussed, compared and critically analyzed in this study.
KW - Epsilon constraint handling
KW - Optimal reactive power dispatch
KW - Scenario-based approach
KW - Solar power
KW - Success history based adaptive differential evolution
KW - Wind power
UR - https://www.scopus.com/pages/publications/85058381888
U2 - 10.1016/j.asoc.2018.11.042
DO - 10.1016/j.asoc.2018.11.042
M3 - Article
AN - SCOPUS:85058381888
SN - 1568-4946
VL - 75
SP - 616
EP - 632
JO - Applied Soft Computing
JF - Applied Soft Computing
ER -