Abstract

This paper proposes an enhanced version of grey wolf optimizer (EGWO) to solve the coordination problem of directional overcurrent relays (DOCRs). The EGWO is proposed to improve the convergence characteristics and computation time of the conventional grey wolf optimizer (GWO) by selecting a suitable balance between exploration and exploitation phases. This balance is achieved by exponential decreasing of the control parameter during the iterative process. The EGWO is explored in all search space during predetermined iterations, and then it fast converges to the best optimal solution by local exploitation around the optimal solutions. The proposed optimization technique is applied to solve the coordination problem of DOCRs. The main objective of optimal coordination of DOCRs is to minimize total operating time of all primary relays with sustaining the selectivity between relay pairs. The feasibility and performance of the proposed technique for solving the coordination problem of DOCRs are investigated using four different systems, compared with several well-known techniques. The obtained results prove the effectiveness and superiority of the proposed technique compared with these techniques. The proposed technique is able to find the optimal relay settings and minimize the total operating time of relays (with a reduction ratio about 19.3995% relative to the conventional GWO) without any miscoordination. In addition, DIgSILENT PowerFactory is used to validate the proposed technique.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.