Coordination of directional overcurrent relays in the interconnected power systems using effective tuning of harmony search algorithm

[Display omitted] •Optimum coordination of Directional Overcurrent Relays (DOCRs).•Linear, nonlinear and mixed-integer nonlinear programming optimization model.•Tuning of algorithm parameters.•Implementation of HSA over five different test cases.•Comparative study of HSA with different optimization...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Sustainable computing informatics and systems Ročník 15; s. 1 - 15
Hlavní autoři: Rajput, Vipul N., Pandya, Kartik S.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Inc 01.09.2017
Témata:
Directional overcurrent relay
Harmony search algorithm
Optimization
Optimum relay coordination
Power system protection
Relay settings
Directional overcurrent relay
Power system protection
Optimum relay coordination
Optimization
Relay settings
Harmony search algorithm
ISSN:2210-5379
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:[Display omitted] •Optimum coordination of Directional Overcurrent Relays (DOCRs).•Linear, nonlinear and mixed-integer nonlinear programming optimization model.•Tuning of algorithm parameters.•Implementation of HSA over five different test cases.•Comparative study of HSA with different optimization methods. In the optimum coordination of Directional Overcurrent Relays (DOCRs), the appropriate relay settings, namely, Plug Setting (PS) and Time Multiplier Setting (TMS), are selected to minimize the operating time of relays subject to various coordination and boundary constraints. In the large interconnected power systems, the key issue with DOCRs protection is to achieve correct relay coordination with satisfying all coordination constraints. In this paper, the parameters of Harmony Search Algorithm (HSA) are tuned to effectively solve the relay coordination problem on five different test cases. Also, the relay coordination problem is formulated as Linear Programming Problem (LPP), Non-linear Programming Problem (NLPP) and Mixed-Integer non-linear programming Problem (MINLPP). In addition, the superiority of proposed method is demonstrated by comparing the obtained results with those obtained by the Genetic Algorithm (GA), hybrid GA-Nonlinear Programming (GA-NLP), Firefly Algorithm (FFA), and Cuckoo Search Algorithm (CSA).
ISSN:2210-5379
DOI:10.1016/j.suscom.2017.05.002