1. Introduction
In modern power systems, directional overcurrent relays (DOCRs) form the primary line of defence for isolating faulted segments while preserving the continuity of supply in healthy zones. These relays detect fault current magnitude and direction, making their coordinated operation fundamental to network stability and reliability [
1,
2,
3]. DOCR coordination requires the simultaneous determination of optimal time multiplier settings (TMS) and plug settings (PS) so that each primary relay trips before its designated backup by a prescribed coordination time interval (CTI), while minimising total relay operating time.
The problem grows considerably more demanding in large-scale networks. The extended IEEE 30-bus system—a representative sub-transmission/distribution benchmark—comprises 81 DOCRs protecting 41 lines and 4 transformers across both 132 kV and 33 kV voltage levels [
4,
5]. With 162 decision variables (81 TMS and 81 PS) and 226 primary-–backup coordination constraints, the resulting mixed-integer nonlinear program is intractable for purely analytical methods [
6].
Conventional solution strategies span deterministic mathematical programming, including sequential quadratic programming (SQP) [
7] and mixed-integer linear programming [
8], and population-based metaheuristics such as particle swarm optimisation (PSO) [
9], gravitational search algorithm (GSA) [
10], differential evolution [
11,
12], firefly algorithm [
13], and cuckoo search [
14]. Mathematical programming methods offer convergence guarantees but become computationally prohibitive as problem size increases and are prone to entrapment in local optima when discrete PS values are handled alongside continuous TMS variables [
15]. Population-based metaheuristics scale better, yet suffer from premature convergence in high-dimensional search spaces [
6].
A critical limitation shared by the majority of prior studies is that they are validated exclusively on the reduced 38-relay configuration of the IEEE 30-bus system or on networks with fewer than 120 coordination constraints [
7,
12,
16]. Methods applied to the full 81-relay configuration with 226 constraints are scarce; Abdelaziz et al. [
5] solved a linear programming formulation, and Bayazidi et al. [
4] employed HEPSO and TFWO, achieving 35.73 s on the extended system while emphasising the practical importance of discrete relay settings. Neither study, however, employs clustering-based decomposition, and no prior work has validated T2FCM clustering on a system with more than 200 coordination constraints.
A complementary research direction has pursued decomposition strategies, partitioning large coordination problems into tractable subproblems. Ojaghi and Mohammadi [
17] demonstrated that clustering can reduce the number of distinct setting groups required for adaptive relay coordination. Zand et al. [
18] applied clustering-based zero-miscoordination techniques to group network topologies under N-2 contingencies. However, these approaches rely on crisp clustering assignments, which force fault scenarios near protection-zone boundaries into a single cluster and cannot model the measurement uncertainty inherent in fault current data.
Type-2 Fuzzy C-Means (T2FCM) [
19] overcomes this limitation through interval-valued memberships
, whose footprint of uncertainty (FOU) captures the ambiguity in scenario-cluster assignment. The authors recently introduced the Hybrid Fractional Entropy Evolution (HFEE) framework. In [
20,
21], a fractional PSO–GSA with entropy evolution was validated on small IEEE 3-bus and 8-bus systems, achieving approximately 9–12% improvements in operating time over the base PSO–GSA. A subsequent paper [
22] extended the framework to IEEE 3-, 8-, and 15-bus networks with 15–26% reductions. Each of those studies, however, optimised the full relay network as a single monolithic problem, which becomes increasingly intractable as system size grows.
This work extends the HFEE framework by incorporating T2FCM as a decomposition stage, creating a two-level hierarchical optimisation architecture for large-scale DOCR coordination. An ablation study against monolithic HFEE without clustering isolates the contribution of the T2FCM decomposition stage and quantifies the resulting trade-off between operational efficiency and computational scalability. The principal contributions are as follows:
The HFEE framework [
20] is implemented and validated on the extended IEEE 30-bus system (81 relays, 226 pairs)—a scale not addressed in prior HFEE studies, which were confined to smaller networks of at most 15 buses [
22]. Monolithic HFEE achieves a mean
of 25.30 s, a 29.19% improvement over the prior best result of 35.73 s [
4].
To the best of the authors’ knowledge, this is the first application of T2FCM clustering to DOCR coordination. A two-level hierarchical framework is introduced in which T2FCM partitions the fault scenarios at the upper level, and HFEE independently optimises relay settings for each cluster at the lower level.
An ablation study compares T2FCM+HFEE against monolithic HFEE, demonstrating a 3.68–66.67% reduction in wall-clock computation time through clustering decomposition, at the cost of a higher .
Validation on the extended IEEE 30-bus benchmark confirms zero CTI violations across all active relay pairs, with statistical reliability established over 50 independent runs.
The remainder of this paper is organised as follows.
Section 2 reviews the relevant literature.
Section 3 states the coordination mathematical model.
Section 4 describes the T2FCM and HFEE methodology.
Section 5 presents the test system and experimental setup.
Section 6 reports simulation results and discussion.
Section 7 concludes the study.
6. Results and Discussion
6.1. Statistical Robustness and Sensitivity Analysis
To assess the reliability of both the clustered and non-clustered configurations, 50 independent runs were executed for each method.
For the proposed T2FCM+HFEE framework (, ), ranged from a best of 59.79 s to a worst of 67.53 s, with a mean of 61.54 s, standard deviation of 3.04 s, coefficient of variation (CV) , and 95% confidence interval (CI) s (i.e., s, computed as ).
For the non-clustered HFEE baseline, the best result across all values was 22.85 s at , with a mean of 25.30 s, worst of 26.43 s, standard deviation of 0.51 s, CV , and 95% CI s ( s). The substantially lower CV of the non-clustered variant (2.02% vs. 4.94%) reflects the simpler, single-level search landscape; however, this consistency comes at the cost of ignoring inter-scenario diversity and producing a single relay-setting vector that is not optimised across heterogeneous fault conditions.
A Wilcoxon signed-rank test and a Wilcoxon rank-sum test were applied to the two 50-run distributions; both returned
, confirming that the difference in
between the clustered and non-clustered approaches is statistically significant at the 1% level. The convergence behaviour across the best, mean, and worst runs for both methods is illustrated in
Figure 2 and
Figure 3, and the complete 50-run distributions are compared in the box plot of
Figure 4 and the frequency distribution of
Figure 5. The shaded area between the maximum and minimum values indicates the bandwidth, and all solutions lie within it.
6.2. Ablation Study: Clustered vs. Non-Clustered HFEE
The ablation study isolates the contribution of the T2FCM decomposition stage by comparing two configurations on the same extended IEEE 30-bus system (81 relays, 226 pairs): monolithic HFEE (no clustering) and T2FCM+HFEE.
Operational performance: Monolithic HFEE achieves a mean
of 25.30 s, representing a 29.19% improvement over the prior best result of 35.73 s reported in [
4]. T2FCM+HFEE achieves a mean
of 61.54 s, which is higher in absolute terms. This increase arises because the clustering decomposition optimises each cluster of scenarios independently: within each cluster, HFEE minimises the operating time for that cluster’s scenario subset rather than all 226 scenarios simultaneously, and the CTI threshold is set to the stricter 0.3 s (versus 0.2 s for the baseline). The total
is the sum of per-cluster optimal values, which is inevitably higher than the monolithic optimum.
Computational performance: Wall-clock computation time at
,
is
s (mean ± std,
), compared to 6.79 s for monolithic HFEE—a 3.68% reduction. For
, the computation time is 2.18 s, representing a 66.67% reduction relative to the
reference point and a 67.9% reduction relative to the non-clustered baseline. The computational complexity is analysed in
Section 6.5.
Practical advantages of clustering: Although the clustered formulation does not achieve the lowest absolute
, it offers four practical advantages over the monolithic approach: decomposition scalability (the problem splits into
K independent subproblems of
variables each); parallel computation (
K clusters solved concurrently, offering a theoretical
K-fold speedup); multi-scenario robustness (226 simultaneous fault scenarios versus a single scenario per pair in [
4]); and modular re-optimisation (only affected clusters need updating under network modifications).
Table 6 presents the ablation comparison. The proposed standalone HFEE achieves a mean
of 25.30 s, representing a 29.19% improvement over the prior best result of HEPSO/TFWO (35.73 s [
4]) at the same CTI level of 0.20 s. This confirms that HFEE, applied monolithically without any decomposition, establishes a new state-of-the-art baseline for the extended IEEE 30-bus benchmark. The T2FCM+HFEE configuration (CTI = 0.30 s, K = 6,
) achieves 61.54 s with zero violations under the stricter coordination margin, with a 3.68% reduction in wall-clock computation time and full multi-scenario robustness across 226 simultaneous fault scenarios. K-means+HFEE and FCM+HFEE were excluded from this comparison as preliminary evaluations showed consistent CTI violations on the 226-constraint system, indicating that crisp and type-1 fuzzy partitioning cannot reliably decompose the coordination problem at this scale; this finding further validates the choice of T2FCM as the clustering stage.
6.3. T2FCM Parameter Sweep and Heatmap Analysis
Figure 6 presents the heatmap of
across all 63
configurations. Each cell reports the mean
from 50 independent runs; configurations producing CTI violations are marked with a prohibited symbol. The global feasible minimum is
s at
,
.
Two principal trends are evident. First,
consistently yields the best results across most cluster counts. This indicates that reduced velocity memory promotes broader search-space exploration, which is consistent with the nature of the decomposed subproblems, where each cluster requires the independent discovery of a local optimum in a distinct region of the setting space. Second,
is non-monotonic in
K: performance improves from
towards
as finer decomposition reduces per-cluster coordination conflict, then degrades for
as clusters become too small to span coherent protection zones; wall-clock computation time rises proportionally throughout (
Section 6.5).
For a full visualisation of all 3150 solutions, the 3D surface plot in Appendix (
Figure A1) shows the
–
K–
landscape; the majority of results cluster near the lower operational-time boundary, confirming the robustness of the proposed method.
6.4. Cluster Decomposition for the Best Configuration (, )
Table 7 summarises the relay-to-cluster assignment for the best configuration. The 81 relays are partitioned into six groups, each with its own TMS and PS values.
Cluster 4 has the highest relay count (22) and per-cluster
(15.23 s), corresponding to distribution-level relays in the 33 kV section where meshed topology creates complex coordination requirements. Cluster 6 has the lowest per-cluster
(0.85 s), comprising transformer-adjacent relays operating under simpler coordination constraints. The entropy range (0.811–3.573) indicates some variation in relay load distribution across clusters; this is expected given the heterogeneous nature of the six protection zones. The relay clusters are also shown in
Figure 7, where different colours indicate distinct cluster groupings.
Approximately 15–20% of the 226 scenarios lie near protection-zone boundaries. Crisp clustering methods force these scenarios into a single cluster, potentially splitting operationally coupled relay pairs across cluster boundaries and causing CTI violations. T2FCM’s interval-valued memberships allow such scenarios to maintain partial participation in adjacent clusters, preserving coordination chain integrity. The FOU width furthermore serves as a quantitative confidence indicator: wide intervals flag scenarios where accurate coordination is most critical.
PhysicalInterpretation of Relay Settings at
Boundary Values
The 81 relays are partitioned into six groups, each with its own TMS and PS values, reveals that several relays converge to boundary values of the decision space, specifically
(minimum) or
(maximum), and
(minimum) or
(maximum). These settings are physically meaningful rather than indicative of optimiser failure, for two reasons. First, relays assigned
and
are configured for maximum sensitivity and minimum time delay; this is appropriate for relays positioned close to the fault source, where rapid isolation is critical and the risk of false tripping is low due to the high PSM ratio. Second, relays assigned
(maximum delay) serve as remote backup protection for fault paths where primary relays already provide fast clearance; the large time delay ensures selectivity without requiring tight TMS precision. The fact that all 219 active relay pairs satisfy the 0.3 s CTI requirement with zero violations confirms that these boundary-value settings are coordination-compliant and reflect a genuine engineering optimum for their respective cluster subproblems. The assignment of boundary values to certain relays is further consistent with the discrete-variable treatment of
[
4], where the coarse tap-step resolution naturally drives solutions towards the nearest feasible boundary point when that point satisfies all constraints.
6.5. Computational Complexity and Wall-Clock Time
The total number of fitness evaluations for the monolithic non-clustered approach is
For the clustered approach (
),
Although the total evaluation counts are similar, each per-cluster evaluation call processes only
scenarios rather than all 226, yielding a benchmark cost ratio of approximately
cheaper per cluster call. Furthermore, the
clusters are fully independent and can be solved concurrently on
K cores, offering a theoretical
parallel speedup.
Table 8 reports estimated wall-clock computation times for all 63
configurations, linearly scaled from the measured point
,
(
s,
). Note that wall-clock time scales linearly with
K because each additional cluster adds one independent HFEE run (each of the same 100-iteration budget);
does not affect computation time, so all columns are identical. A comparison of clustered and non-clustered wall-clock times is shown in
Figure 8.
Table 8 also reveals an important trade-off: selecting
reduces computation time to 2.18 s, a 66.67% reduction relative to
and a 67.9% reduction relative to non-clustered HFEE.
However, at
and
,
rises to 86.39 s—a significant penalty in operational performance. This trade-off is visualised in
Figure 9, where each point represents one of the 63 configurations; the non-clustered result is marked with a star. Practitioners can use this figure to select an appropriate
pair based on their specific balance of operational and computational requirements.
Table 8 and
Figure 9 together provide a practical decision guide for selecting
based on engineering priorities. If total operational time is the primary objective,
and
yield the best
of 61.54 s, with a moderate wall-clock time of
s. Conversely, if computational speed is the priority,
and
reduce wall-clock time to
s at the cost of a higher
of 86.39 s. For applications where neither objective is dominant,
and
offer an intermediate trade-off, achieving
s with a wall-clock time of
s. This flexibility allows protection engineers to select a configuration that best suits their specific operational and computational constraints, without re-running the full parameter sweep.
6.6. CTI Margin Validation
To verify coordination integrity for the best configuration (
,
), the CTI margin
was evaluated for all 219 active primary–backup pairs using the optimised relay settings. All 219 pairs satisfied the 0.3 s CTI requirement, with zero violations.
Table 9 presents the TMS and PS values alongside the minimum CTI margin for selected relays. The
† symbol denotes pairs where the directional element resolves the coordination constraint, as described in
Section 5.
The minimum observed CTI margin across all 219 active pairs is 0.200 s (R81), which satisfies the IEC 60255 minimum of 0.2 s [
30] with no surplus; this relay is transformer-adjacent and its margin is constrained by the physical fault-current ratio. The maximum margin is 3.332 s (R80), reflecting the conservative settings assigned to line relays with low fault-current exposure. The relatively wide margin range (0.200–3.332 s) indicates that T2FCM clustering successfully preserves the coordination hierarchy across all active pairs, including those near protection-zone boundaries.
6.7. Comparison with State-of-the-Art Methods
The proposed T2FCM+HFEE method achieves a mean
of 61.54 s with zero CTI violations on the 81-relay extended system with six groups have their corresponding TMS and PS values listed in
Table 10. Compared with methods limited to the 38-relay configuration (fewer than 120 constraints), the proposed framework handles a problem that is
larger in decision variables and
more constrained, demonstrating scalability for large-scale protection systems. The SQP-based method of Birla et al. [
7] achieved 116.50 s on only 38 relays; the proposed method achieves 61.54 s on 81 relays—a 47.2% reduction despite a significantly larger problem, and a 67% improvement over Al-Bhadely and Inan [
25] on the same relay count.
A direct comparison between T2FCM+HFEE and HEPSO/TFWO is not straightforward, as the two methods operate under different problem formulations and objectives: HEPSO/TFWO targets absolute
minimisation per pair, whereas the proposed clustering framework prioritises computational scalability and multi-scenario robustness, accepting a trade-off in absolute operational time. A valid comparison is possible between the non-clustered HFEE and HEPSO/TFWO under identical conditions (CTI = 0.2 s, 81 relays, 226 pairs): non-clustered HFEE achieves a mean
of 25.30 s, representing a 29.19% improvement over HEPSO/TFWO at the same constraint level. Among clustering-based methods, Zand et al. [
18] achieved 52.33 s on the 38-relay system using a Fmincon algorithm with K-means; the proposed approach addresses a significantly larger and more constrained problem (226 pairs vs. fewer than 120).
The entropy term
in the velocity update (Equation (
16)) enhances both swarm exploration and coordination balance: the
factor amplifies the exploratory component when diversity is high, while a low
triggers reinitialisation, preventing premature convergence. Simultaneously, the relay-time entropy
in the objective (Equation (
6)) promotes uniform relay utilisation, consistent with [
20,
21].
Figure 10 presents the 4-quadrant performance analysis. Methods in the top-left quadrant (e.g., SQP) exhibit high
at low constraint counts—the weak region. Methods in the top-right quadrant (e.g., HACO) are constrained but operationally slow. Methods in the bottom-left quadrant (e.g., IDA, EEO, EWSO) achieve low
but on low-constraint systems. The optimal trade-off region (bottom-right) captures methods that achieve low
at high constraint counts; TFWO and both proposed methods (non-clustered HFEE and T2FCM+HFEE) fall in this region. Non-clustered HFEE achieves the lowest
(25.30 s) at the highest constraint count (226), with high computational time; the clustered proposal achieves low computational time at the cost of higher
, with the added benefits described in
Section 4.2.4.
7. Conclusions
This study presented and validated both a standalone HFEE framework and a T2FCM clustering-decomposed HFEE framework for the coordination of directional overcurrent relays on the extended IEEE 30-bus system (81 relays, 226 primary—backup coordination pairs).
Standalone HFEE (monolithic, no clustering) achieves a 29.19% improvement over the reported best result of 35.73 s on the same system [
4]—establishing a new state-of-the-art baseline for the extended IEEE 30-bus benchmark. T2FCM+HFEE achieves a mean
of 61.54 s with zero CTI violations across all active relay pairs. The clustering decomposition reduces wall-clock computation time by 3.68–66.67% relative to the non-clustered baseline depending on
K, at the cost of a higher absolute
. The fractional order
consistently yields the best results, confirming that reduced velocity memory promotes effective exploration in the decomposed subproblems.
The two-level hierarchical architecture demonstrates scalability for simultaneous sub-transmission and distribution relay coordination, handling 162 decision variables and 226 constraints through six independently optimisable subproblems. The communicationless, entirely offline multi-group deployment strategy—compatible with the MiCOM P127 relay’s eight-group capability—requires no hardware upgrades or real-time communication links.
The primary limitations of this study are as follows: (1) the clustered
is higher than monolithic methods, accepted in exchange for scalability and parallel decomposability; (2) the clustered framework requires each relay to store
K distinct (PS, TMS) pairs—one per cluster—meaning a
configuration demands six independent setting groups per relay; this is compatible with the MiCOM P127’s eight-group capability [
32] but may exceed the capacity of legacy relay hardware; (3) highly imbalanced clusters may reduce the theoretical
K-fold parallel speedup.
Future work will extend the framework to dynamic fault scenarios, integrate distance relays alongside DOCRs, and explore multi-objective formulations balancing , computational cost, and protection reliability.