z-logo
open-access-imgOpen Access
Robust coordination of directional overcurrent relays using a matheuristic algorithm
Author(s) -
Costa Mateus H.,
Saldanha Rodney R.,
Ravetti Martin G.,
Carrano Eduardo G.
Publication year - 2017
Publication title -
iet generation, transmission and distribution
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.92
H-Index - 110
eISSN - 1751-8695
pISSN - 1751-8687
DOI - 10.1049/iet-gtd.2016.1010
Subject(s) - overcurrent , convergence (economics) , computer science , algorithm , relay , electric power system , constraint (computer aided design) , sequence (biology) , mathematical optimization , transmission (telecommunications) , power system protection , differential (mechanical device) , power (physics) , mathematics , engineering , telecommunications , physics , geometry , quantum mechanics , aerospace engineering , biology , economics , genetics , economic growth
Directional overcurrent relays are often used in the protection of electrical power transmission and distribution systems. These devices are installed along the network, and they must be coordinated to operate as fast as possible and in the adequate sequence. However, the coordination of relays is a complex problem, due to its discrete non‐linear nature and its hard constraint structure. A matheuristic algorithm to provide coordination of directional overcurrent is proposed in this work. The algorithm combines a differential evolution strategy and linear programming formulations. In addition, two local search procedures are proposed to improve convergence and to handle continuous and discrete relay setups. Results for five instances show that the proposed method is able to obtain identical or better solutions than those already reported in the literature with considerably lower computational cost. Furthermore, the algorithm can directly handle robust coordination by considering possible changes in the systems conditions.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here