English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

The model of directional over current relays (DOCRs) coordination is considered as an optimization problem. It is generally formulated as linear programming (LP), non-linear programming (NLP) and mixed integer non-linear programming (MINLP), according to the nature of the design variables. For each kind of formulation, the main goal is to minimize the summation of operating times of primary relays, by setting optimal values for decision variables as time dial setting (TDS) and pickup current setting (IP) or plug setting (PS). In this paper, we proposed an oppositional Jaya (OJaya) algorithm with distance-adaptive coefficient (DAC), to effectively solve the DOCRs coordination problem. Firstly, by oppositional learning (OL), the searching space of Jaya is expanded and the diversity of its population is strengthened; secondly, by DAC, the population’s trends of running towards the best position and escaping from the worst position is accelerated. The performance of OJaya is evaluated by 3-bus, 8-bus, 9-bus and 15-bus testing systems, in aspects of convergence rate, objective function value, robustness and computation efficiency. The results indicate the effectiveness and superiority of OJaya in solving DOCRs coordination problems compared with standard Jaya.

Oppositional Jaya Algorithm With Distance-Adaptive Coefficient in Solving Directional Over Current Relays Coordination Problem