Power, Control, and Data Processing Systems

Power, Control, and Data Processing Systems

Modified Metaheuristic Approach for Overcurrent Relay Coordination in Distribution Networks

Document Type : Original Research

Authors
1 Department of Electrical Engineering, Shab.C., Islamic Azad University, Shabestar, Iran
2 Department of Electrical Engineering, Shab.C., Islamic Azad University, Shabestar, Iran.
3 Department of Electrical Engineering, Ur.C., Islamic Azad University, Urmia, Iran.
10.30511/pcdp.2026.2088443.1071
Abstract
Because conventional computational approaches falter under heavily constrained and nonlinear conditions, properly setting protective distribution relays remains an arduous task. While the metaheuristic algorithms have been applied to this problem, existing approaches typically optimize only time and current settings while assuming fixed relay characteristics, limiting the achievable coordination performance. This paper addresses this gap by proposing a unified Gravitational Search Algorithm (GSA) framework that simultaneously optimizes time multiplier settings, current settings, and relay characteristic selection from eight standard curves. By leveraging a combination of MATLAB for optimization and DIgSILENT for fault current estimation, this study evaluates its approach. The effectiveness of the technique is demonstrated through testing on both 30-bus and 9-bus distribution systems, where its performance is benchmarked against Informative Differential Evolution and Particle Swarm Optimization. Results demonstrate that the GSA-based approach achieves superior convergence and lower objective function values, with statistical analysis confirming its robustness and effectiveness in reducing relay operating times compared to the existing methods.
Keywords
Subjects


Articles in Press, Accepted Manuscript
Available Online from 10 September 2026

  • Receive Date 11 May 2026
  • Revise Date 03 September 2026
  • Accept Date 10 September 2026
  • First Publish Date 10 September 2026
  • Publish Date 10 September 2026