betaFeedback

WorksEngineering

Robust Optimal Network Reduction for Distribution Systems

Abstract

Network reduction replaces large networks with smaller equivalents to speed up power flow and optimization studies. Optimal Kron-based Reduction of Networks (Opti-KRON) finds the optimal set of nodes to faithfully represent a large-scale radial network for representative loading scenarios. Under unseen nodal injections, however, its accuracy can drop. This paper extends Opti-KRON to uncertain nodal injections using robust uncertainty sets and a Wasserstein ambiguity set, with voltage magnitude error guarantees. To improve scalability, we develop a presolve screening step to eliminate redundant constraints and variables while preserving the feasible set. We also adopt adversarial constraint generation to reduce memory requirements by iteratively adding worst-case nodal injections. On a real 8,387-node feeder at a threshold of 0.001~p.u., the reduction removes 49.9% of the nodes. For one uncertainty set, adversarial constraint generation cuts the required memory by a factor of more than 18.

Introduction

The computational burden of power flow and optimization problems in distribution systems increases with network size. Network reduction lowers this burden by replacing a large feeder with a smaller equivalent network. However, reducing network size introduces modeling errors.

Various network reduction methods have been developed to reduce distribution networks while preserving the accuracy of nodal voltages [1], [2]. Optimal Kron-based Reduction of Networks (Opti-KRON) formulates network reduction as a mixed-integer linear program (MILP) that selects the nodes to keep. It minimizes the number of kept nodes while keeping the voltage magnitude errors within a threshold for a set of representative loading scenarios [3, 4, 5]. Kron reduction eliminates the other nodes from the nodal admittance equations and gives an equivalent network on the kept nodes [1].

The accuracy of Opti-KRON depends on the loading scenarios considered during the reduction process. As nodal injections vary due to changes in demand and generation, operating conditions outside these scenarios may result in voltage magnitude errors above the threshold. Robust optimization accounts for such variations by considering a set of possible realizations of uncertain nodal injections [6]. However, the resulting robust optimization problems can be computationally prohibitive for large feeders. To address these challenges, this paper makes the following contributions:

  • Robust optimal network reduction: We extend Opti-KRON to uncertain nodal injections through robust uncertainty sets and a Wasserstein ambiguity set. Under LinDistFlow, the voltage magnitude error is linear in the injections for a given reduction, which allows exact reformulations of the error constraints.

  • Scalable solution methods: We develop screening rules based on voltage differences within candidate clusters and bounds on error coefficients to eliminate infeasible node assignments and redundant error constraints. We also adopt adversarial constraint generation to avoid constructing large robust counterparts by iteratively adding worst-case nodal injections.

  • Validation on realistic networks: We validate and compare methods on large-scale distribution feeders.

Robust Opti-KRON

Kron-Based Reduction and Voltage Magnitude Error

Opti-KRON reduces a network by keeping a subset of its nodes, called super-nodes [4]. Each of the other nodes, called reduced nodes, is assigned to one super-node. A super-node and its reduced nodes form a cluster, and the injections of the cluster are aggregated at the super-node. The reduced nodes then carry no injection. The voltage of a super-node is used as an estimate for the voltages of its reduced nodes. The voltage magnitude error of a node is the difference between this estimate and the node’s voltage magnitude in the full network. Figure 1 shows the clusters of a 30-node feeder and the resulting reduced network.

Figure 1. A 30-node radial feeder (top) and its reduced network with nine super-nodes (bottom), whose lines follow from Kron reduction. Each color represents a cluster of nodes.

For a radial feeder with node set V={1,…,n}\mathcal{V} = \{1,\ldots,n\} and slack node ss, the assignment is a binary matrix A∈{0,1}n×nA \in\{0,1\}^{n \times n}, where Aij=1A_{ij}=1 if node jj is assigned to super-node ii, and Aii=1A_{ii}=1 marks a super-node. The candidate set C\mathcal{C} contains the pairs (i,j)(i,j) of nodes that are at most HH edges apart, where HH is the hop limit. The hop limit keeps the clusters small and removes distant candidate pairs from the problem. Node jj can be assigned to super-node ii only if (i,j)∈C(i,j) \in\mathcal{C}. A valid assignment satisfies

∑iAij=1,Aij≤Aii,Ass=1,∀i,j,(1)\sum_i A_{ij} = 1,\quad A_{ij} \le A_{ii},\quad A_{ss}=1,\quad\forall i,j, \tag*{(1)}
Aij≤Aik,∀(i,j)∈C, k∈Pij,(2)A_{ij} \le A_{ik},\quad\forall(i,j) \in\mathcal{C},\ k \in\mathcal{P}_{ij}, \tag*{(2)}
Aij=0,∀(i,j)∉C.(3)A_{ij}=0,\quad\forall(i,j) \notin\mathcal{C}. \tag*{(3)}

Constraints (1a) assign every node to one super-node and keep the slack node. In (1b), Pij\mathcal{P}_{ij} is the set of nodes on the path between ii and jj, so every cluster is a connected subtree.

We model the voltages with the LinDistFlow equations [7]. Let the network be rooted at the slack node ss, with edge set EE of n−1n-1 edges and vectors of edge resistances rr and reactances xx. Let p,q∈Rnp,q \in\mathbb{R}^{n} be the active and reactive nodal injections, with generation positive. For voltage magnitudes v∈Rnv \in\mathbb{R}^{n} near 1 p.u., we use the approximation

v=v01+KPp+KQq,(4)v = v_0\mathbf{1} + K_Pp + K_Qq, \tag*{(4)}
KP=ΓTdiag⁡(r)Γ,KQ=ΓTdiag⁡(x)Γ,(5)K_P = \Gamma^{\mathsf{T}}\operatorname{diag}(r)\Gamma,\qquad K_Q = \Gamma^{\mathsf{T}}\operatorname{diag}(x)\Gamma, \tag*{(5)}

where v0v_0 is the slack voltage magnitude and Γ∈{0,1}(n−1)×n\Gamma\in\{0,1\}^{(n-1)\times n} has Γej=1\Gamma_{ej}=1 if node jj is downstream of edge ee. Thus KP,jkK_{P,jk} is the resistance shared by the paths from ss to jj and to kk. For three-phase networks, we use the phase-coupled LinDistFlow model of [8] converted to voltage magnitudes as in (2), with one row per existing node-phase pair and with KPK_P and KQK_Q built from the phase impedance matrices of the lines. A node can be assigned only to a super-node that has all its phases. Injections are aggregated phase by phase, and the voltage magnitude error is defined for each phase.

Under the aggregated injections ApAp and AqAq, the voltage magnitudes become v~=v01+KPAp+KQAq\tilde{v}=v_0\mathbf{1}+K_PAp+K_QAq; the entries of v~\tilde{v} at the super-nodes are the voltage magnitudes of the reduced network. The voltage magnitude error of node jj assigned to super-node ii is then

eij(A,u)=v~i−vj=cij(A)Tu,(6)e_{ij}(A,u)=\tilde{v}_i-v_j=c_{ij}(A)^{\mathsf{T}}u, \tag*{(6)}
cij(A)=[(KPA)i,:−(KP)j,:(KQA)i,:−(KQ)j,:],(7)c_{ij}(A)=\begin{bmatrix}(K_PA)_{i,:}-(K_P)_{j,:}\\(K_QA)_{i,:}-(K_Q)_{j,:}\end{bmatrix}, \tag*{(7)}

where u=[p;q]u=[p;q]. For a fixed assignment, the error is linear in uu, and its coefficients are affine in AA. In [4], the error was computed from voltages and currents of representative AC power flow solutions. Here, (4) is a LinDistFlow approximation of the voltage magnitude error. The robust formulations below are exact for this approximate error, not for the voltage magnitude error of the AC power flow.

Robust Reduction Problem

Let Eˉ\bar{E} be the voltage magnitude error threshold. The robust reduction problem finds the assignment with the fewest super-nodes such that every error stays within Eˉ\bar{E} for every injection in an uncertainty set U\mathcal{U}:

min⁡A∑iAii(8)\min_A \sum_i A_{ii} \tag*{(8)}
s.t.max⁡u∈Ucij(A)Tu≤Eˉ+Mij(1−Aij), ∀(i,j)∈C,(9)\text{s.t.}\quad\max_{u\in\mathcal{U}} c_{ij}(A)^{\mathsf{T}}u \le\bar{E}+M_{ij}(1-A_{ij}),\ \forall(i,j)\in\mathcal{C}, \tag*{(9)}
min⁡u∈Ucij(A)Tu≥−Eˉ−Mij(1−Aij), ∀(i,j)∈C,(10)\min_{u\in\mathcal{U}} c_{ij}(A)^{\mathsf{T}}u \ge-\bar{E}-M_{ij}(1-A_{ij}),\ \forall(i,j)\in\mathcal{C}, \tag*{(10)}

(1)–(5). {#eq:6d}

When node jj is assigned to super-node ii (Aij=1A_{ij}=1), (6b) and (6c) keep its voltage magnitude error between −Eˉ-\bar{E} and Eˉ\bar{E} for every injection in U\mathcal{U}. When Aij=0A_{ij}=0, the constant Mij≥0M_{ij}\ge0 makes both constraints inactive for every assignment that satisfies (1). If U\mathcal{U} is a finite set of loading scenarios, (6b) and (6c) enforce the LinDistFlow error bound at every scenario, as in scenario-based Opti-KRON.

Uncertainty Representation

We build the uncertainty sets from NN training samples u1,…,uNu^1,\ldots,u^N of the nodal injections. A coordinate of uu is active if it is nonzero in at least one sample, and S\mathcal{S} is the set of active coordinates. All other coordinates are zero in every set. Table I lists the uncertainty sets and the worst case of a linear function cTuc^{\mathsf{T}}u over each set. For the robust uncertainty sets, replacing the maximum in (6b) by this worst case gives an exact reformulation, called the robust counterpart [9]. For (6c), the robust counterpart uses Table I with −cij(A)-c_{ij}(A).

The box bounds each active coordinate between its smallest and largest sampled values, ℓ\ell and hh. Its midpoint and half-width are uˉ=(ℓ+h)/2\bar{u}=(\ell+h)/2 and δ=(h−ℓ)/2\delta=(h-\ell)/2. In the worst case, each coordinate of uu is at its upper bound where the matching coordinate of cc is positive, and at its lower bound otherwise.

The convex hull contains all convex combinations of the samples, and it lies inside the box. Since the error is linear in uu, its maximum over the convex hull is reached at one of the samples. The robust counterpart therefore enforces the bound at every training sample.

The ellipsoid describes how the injections vary together. Its center μ\mu is the mean of the training samples on S\mathcal{S}, and LL is the Cholesky factor of the covariance Σ=LLT≻0\Sigma=LL^{\mathsf{T}}\succ0 of the active coordinates. In this paper, we consider a radius Ω\Omega equal to a quantile of the scaled distances ∥L−1(us−μ)∥2\|L^{-1}(u^s-\mu)\|_2 of the training samples [9 Ch. 2]. Because of the Euclidean norm term in Table I, the robust counterpart is a second-order cone constraint, and problem (6) is a mixed-integer second-order cone program (MISOCP).

The Wasserstein ambiguity set Q\mathcal{Q} contains every distribution Q\mathbb{Q} of the active coordinates with W(Q,P^N)≤ρW(\mathbb{Q},\widehat{\mathbb{P}}_N)\leq\rho, where WW is the type-1 Wasserstein distance with a norm ∥⋅∥\|\cdot\| as transport cost, and P^N\widehat{\mathbb{P}}_N is the empirical distribution of the training samples [10]. For this set, the worst case is the largest conditional value-at-risk (CVaR) of cTu\mathbf{c}^{\mathsf{T}}\mathbf{u} at level 1−ϵ1-\epsilon, with ϵ∈(0,1]\epsilon\in(0,1]. If the active coordinates can vary freely,

sup⁡Q∈QCVaR⁡1−ϵQ(cTu)=max⁡u∈UWcTu\sup_{\mathbb{Q}\in\mathcal{Q}}\operatorname{CVaR}^{\mathbb{Q}}_{1-\epsilon}(\mathbf{c}^{\mathsf{T}}\mathbf{u})=\max_{\mathbf{u}\in\mathcal{U}_W}\mathbf{c}^{\mathsf{T}}\mathbf{u}

[10], where

UW={∑kθkuk+d:0≤θk≤1Nϵ, ∥d∥≤ρϵ, ∑kθk=1}.(11)\mathcal{U}_W=\left\{\sum_k\theta_k\mathbf{u}^k+\mathbf{d}:0\leq\theta_k\leq\frac{1}{N\epsilon},\ \|\mathbf{d}\|\leq\frac{\rho}{\epsilon},\ \sum_k\theta_k=1\right\}. \tag*{(11)}

In this paper, we consider the worst-case CVaR of each error separately for each node and sign [6]. As for Ω\Omega, we consider a radius ρ/ϵ\rho/\epsilon equal to a quantile of the distances of the training samples to the subset of UW\mathcal{U}_W with d=0\mathbf{d}=0 [10].

Scalable Solution Methods

Constructing and solving the robust counterpart of (6) can be computationally expensive for large feeders and data libraries. We address this challenge in two ways: a presolve screening step to reduce the problem size and adversarial constraint generation to solve (6) through a sequence of smaller scenario-based MILPs.

Constraint Screening

A candidate pair (i,j)(i,j) is infeasible if no feasible solution of (6) has Aij=1A_{ij}=1. An error constraint of pair (i,j)(i,j) is redundant if it holds for every valid assignment with Aij=1A_{ij}=1. Infeasible pairs and redundant error constraints can be removed without changing the feasible set or the optimal value of (6). We develop two screening tests based on voltage magnitude differences and bounds on the error coefficients.

The first test exploits voltage magnitude differences between nodes that must share a super-node. If Aij=1A_{ij}=1, constraint (1b) assigns the nodes in Pij\mathcal{P}_{ij} to super-node ii, so all nodes in Fij=Pij∪{i,j}\mathcal{F}_{ij}=\mathcal{P}_{ij}\cup\{i,j\} share super-node ii. For any two nodes a,b∈Fija,b\in\mathcal{F}_{ij}, the super-node voltage cancels in the difference of their errors:

eia(A,u)−eib(A,u)=vb−va=dabTu,(12)e_{ia}(A,\mathbf{u})-e_{ib}(A,\mathbf{u})=v_b-v_a=\mathbf{d}_{ab}^{\mathsf{T}}\mathbf{u}, \tag*{(12)}

where dab\mathbf{d}_{ab} follows from (2) and is independent of AA. If both errors are within ±E‾\pm\overline{E}, their difference cannot exceed 2E‾2\overline{E} in magnitude. Hence, pair (i,j)(i,j) is infeasible if

max⁡u∈U∣dabTu∣>2E‾(13)\max_{\mathbf{u}\in\mathcal{U}}\left|\mathbf{d}_{ab}^{\mathsf{T}}\mathbf{u}\right|>2\overline{E} \tag*{(13)}

for some a,b∈Fija,b\in\mathcal{F}_{ij} on the same phase. This maximum follows from Table 1, applied to dab\mathbf{d}_{ab} and −dab-\mathbf{d}_{ab}.

SetDefinitionWorst case of cTuc^{\mathsf{T}}u
Boxℓ≤u≤h\ell\le u\le hcTuˉ+δT∣c∣c^{\mathsf{T}}\bar{u}+\delta^{\mathsf{T}}|c|
Convex hullconv⁡{u1,…,uN}\operatorname{conv}\{u^1,\ldots,u^N\}max⁡kcTuk\max_k c^{\mathsf{T}}u^k
EllipsoiduS=μ+Ly, ∣y∣2≤Ωu_{\mathcal{S}}=\mu+Ly,\ |y|_2\le\OmegacSTμ+Ω∣LTcS∣2c_{\mathcal{S}}^{\mathsf{T}}\mu+\Omega|L^{\mathsf{T}}c_{\mathcal{S}}|_2
WassersteinW(Q,P^N)≤ρW(\mathbb{Q},\widehat{\mathbb{P}}_N)\le\rhosup⁡Q∈PEQ(cTu)\sup_{\mathbb{Q}\in\mathcal{P}} \mathbb{E}_{\mathbb{Q}}(c^{\mathsf{T}}u)

Table 1. Uncertainty sets and the worst case of cTuc^{\mathsf{T}}u.

The second test exploits the structure of the error coefficients in (5). Although cij(A)\mathbf{c}_{ij}(A) depends on the whole assignment, each entry depends only on the super-node of a single node. In particular, the entry multiplying pkp_k is

cij,k(A)=(KPA)ik−KP,jk=KP,ib−KP,jk,(14)c_{ij,k}(A)=(K_PA)_{ik}-K_{P,jk}=K_{P,ib}-K_{P,jk}, \tag*{(14)}

where bb is the super-node of node kk (Abk=1A_{bk}=1). Let Ck={b:(b,k)∈C}\mathcal{C}_k=\{b:(b,k)\in\mathcal{C}\} denote the remaining candidate super-nodes of node kk. Since b∈Ckb\in\mathcal{C}_k, this entry satisfies

cij,k(A)∈[min⁡b∈CkKP,ib−KP,jk,max⁡b∈CkKP,ib−KP,jk].(15)c_{ij,k}(A)\in\left[\min_{b\in\mathcal{C}_k}K_{P,ib}-K_{P,jk},\max_{b\in\mathcal{C}_k}K_{P,ib}-K_{P,jk}\right]. \tag*{(15)}

Analogous bounds hold for the entries multiplying qkq_k, with KQK_Q replacing KPK_P. Moreover, if Aij=1A_{ij}=1, every node k∈Fijk\in\mathcal{F}_{ij} is assigned to super-node ii, so the entries multiplying pkp_k and qkq_k are known exactly. We use these intervals to compute a lower bound h‾ij\underline{h}_{ij} and an upper bound h‾ij\overline{h}_{ij} of the worst-case error max⁡u∈Ucij(A)Tu\max_{\mathbf{u}\in\mathcal{U}}\mathbf{c}_{ij}(A)^{\mathsf{T}}\mathbf{u}. Both bounds hold for every assignment with Aij=1A_{ij}=1, and they lead to two conclusions:

h‾ij>E‾ ⇒ pair (i,j) is infeasible,(16)\underline{h}_{ij}>\overline{E}\ \Rightarrow\ \text{pair }(i,j)\text{ is infeasible}, \tag*{(16)}
h‾ij≤E‾ ⇒ constraint (6b) is redundant.(17)\overline{h}_{ij}\leq\overline{E}\ \Rightarrow\ \text{constraint (6b) is redundant}. \tag*{(17)}

The same test with −cij(A)-\mathbf{c}_{ij}(A) applies to (6c).

For the box, each term cmu‾m+∣cm∣δ‾mc_m\overline{u}_m+|c_m|\underline{\delta}_m of the worst case in Table 1 depends on one entry. The sum of the smallest values of these terms over their intervals is the lower bound, and the sum of the largest values is the upper bound. For the convex hull, the bounds follow from bounds of cij(A)Tuk\mathbf{c}_{ij}(A)^{\mathsf{T}}\mathbf{u}^k at each sample, and each sample constraint is tested on its own. For the Wasserstein ambiguity set, we maximize the weighted sum of the sample bounds over the weights in (7) and bound the additional term (ρ/ϵ)∥cij(A)∥∗(\rho/\epsilon)\|\mathbf{c}_{ij}(A)\|_* over the coefficient intervals, where ∥⋅∥∗\|\cdot\|_* is the dual norm of ∥⋅∥\|\cdot\|. For the ellipsoid, we bound the linear term and each entry of LTcij,S(A)L^{\mathsf{T}}\mathbf{c}_{ij,S}(A) to obtain only an upper bound on the worst-case error in Table 1.

Without the condition Aij=1A_{ij}=1, the intervals (11) and the upper bounds hold for every assignment. We choose MijM_{ij} at least as large as each of these upper bounds, for both signs, minus E‾\overline{E}. Each infeasible pair removes a candidate super-node, which can narrow the intervals of other pairs. In addition, by (1b), if pair (i,k)(i,k) is infeasible and k∈Pijk\in\mathcal{P}_{ij}, pair (i,j)(i,j) is infeasible too. We therefore repeat the second test and this path rule for a few passes, until no new infeasible pair is found or the pass limit is reached.

Adversarial Constraint Generation

After screening, problem (6) can also be solved by adversarial constraint generation, a cutting-set method [11] in which an adversary searches U\mathcal{U} for the worst-case injections of a given reduction, as in robust optimization [6]. The method enforces the error bounds only at a finite set of these injections. It alternates between the adversary and a master problem, which is (6) with U\mathcal{U} replaced by this finite set Ut⊂U\mathcal{U}^t\subset\mathcal{U}. The error constraints of the master problem are linear, as for the convex hull. Adversarial constraint generation therefore avoids the robust counterpart, and it can help when this counterpart grows with the number of samples or is conic [12].

Since Ut⊂U\mathcal{U}^t\subset\mathcal{U}, the optimal value of the master problem is a lower bound on that of (6), and its reduction AtA^t may violate the bounds at injections outside Ut\mathcal{U}^t. In AtA^t, each node jj is assigned to one super-node ii, and we write ejt(u)=eij(At,u)e_j^t(\mathbf{u})=e_{ij}(A^t,\mathbf{u}) for its error. For each node, the adversary finds the injection that causes the largest violation for AtA^t. The largest violation over all nodes is

Δt=max⁡jmax⁡u∈U∣ejt(u)∣−E‾.(18)\Delta^t=\max_j\max_{\mathbf{u}\in\mathcal{U}}\left|e_j^t(\mathbf{u})\right|-\overline{E}. \tag*{(18)}

For a fixed node, the error is cTu\mathbf{c}^{\mathsf{T}}\mathbf{u} with c=cij(At)\mathbf{c}=\mathbf{c}_{ij}(A^t). Its largest magnitude over U\mathcal{U} is the larger of the maxima of cTu\mathbf{c}^{\mathsf{T}}\mathbf{u} and

Algorithm 1 Adversarial constraint generation

Require: U\mathcal{U}, E‾\overline{E}, U0⊂U\mathcal{U}^{0} \subset\mathcal{U}, KK

  1. for t=0,1,2,…t = 0, 1, 2, \ldots do

  2. At←A^{t} \leftarrow optimal solution of (6) with Ut\mathcal{U}^{t} in place of U\mathcal{U}

  3. (Δt,U^t)←(\Delta^{t}, \widehat{\mathcal{U}}^{t}) \leftarrow adversary (13) for AtA^{t}

  4. if Δt≤0\Delta^{t} \le0 then

  5. return AtA^{t}

  6. end if

  7. Ut+1←Ut∪U^t\mathcal{U}^{t+1} \leftarrow\mathcal{U}^{t} \cup\widehat{\mathcal{U}}^{t}

  8. end for

−cTu-c^{\mathsf{T}}u, given by Table I. The set U^t\widehat{\mathcal{U}}^{t} contains the worst-case injections of at most KK violated nodes, those with the largest violations. The added injections violate the error bound for AtA^{t}, so the master problem cannot return AtA^{t} again. If Δt≤0\Delta^{t} \le0, AtA^{t} is feasible for (6), and by the lower bound it is optimal. Since the number of assignments is finite, Algorithm 1 stops after finitely many iterations.

Case Studies

We test the methods on South Alburg, a real three-phase feeder in Vermont with 8,387 nodes, and on the IEEE European LV test feeder with 907 nodes [13]. South Alburg has one month of historical hourly load data: 29 days are training samples, and one day is the test day. The European LV feeder has one day of one-minute profiles, and all 1,440 samples are training samples. We use H=5H = 5, E‾=0.001\overline{E} = 0.001 p.u., ϵ=0.01\epsilon= 0.01, and the ℓ1\ell_{1}, ℓ2\ell_{2} and ℓ∞\ell_{\infty} norms as transport cost. On both feeders, we also vary E‾\overline{E} from 0.001 to 0.005 p.u. The radii Ω\Omega and ρ/ϵ\rho/\epsilon are the 95% quantiles of the distances defined in § 1.1-C. The covariance of the ellipsoid is estimated by principal orthogonal complement thresholding with at most five factors [14]. Each set is solved with the robust counterpart of (6), called the direct model, and with Algorithm 1 with K=3K = 3. As a baseline, we use scenario-based Opti-KRON [4], solving (6) with U\mathcal{U} equal to the two training samples of largest and smallest total net active injection. We initialize U0\mathcal{U}^{0} with these samples if they lie in U\mathcal{U}. We use Gurobi with a zero optimality gap and a 24-h time limit. Computation times include constraint screening and solving. All runs use eight threads at the Vermont Advanced Computing Center.

Reduction for Each Set

Figure 2(a) shows the reduction of the European LV feeder. At E‾=0.001\overline{E} = 0.001 p.u., it ranges from 75.0% for the ℓ1\ell_{1} Wasserstein set to 83.0% for the convex hull. The convex hull lies inside the box, so the box cannot give a larger reduction. The Wasserstein sets are not nested with the box, and the ℓ2\ell_{2} and ℓ∞\ell_{\infty} sets reduce the feeder more than the box. As E‾\overline{E} grows, all curves, including the baseline, approach 88.6%, the largest reduction that the structural constraints alone allow.

Figure 2. Reduction versus the voltage magnitude error threshold for (a) the European LV feeder and (b) South Alburg. W, ℓp\ell_p: Wasserstein ambiguity set with the ℓp\ell_p norm as transport cost.

On South Alburg, the reduction also increases with E‾\overline{E}, but, unlike on the European LV feeder, the gap between the sets does not close (Figure 2(b)). At E‾=0.001\overline{E} = 0.001 p.u., the convex hull and the box reduce the feeder by 49.9% and 46.8%, against

16.6% to 31.8% for the ellipsoid and the Wasserstein sets. The box and the convex hull stay within the sampled range of each coordinate. In contrast, the ellipsoid and the Wasserstein sets use a single radius calibrated across all 5,614 active coordinates, while each voltage magnitude error is sensitive mainly to a subset of injections. The worst case of each error can exploit the entire radius in these directions. This allows larger deviations than those observed in the training samples.

The scenario-based baseline reduces South Alburg by 69.3% at the same threshold, but its voltage magnitude errors reach 102.7E‾\overline{E} on the other training samples. The gap between the scenario-based and robust reductions illustrates the price of robustness [15]. On the European LV feeder, the gap is smaller: the baseline gives 86.7% at E‾=0.001\overline{E} = 0.001 p.u., and the gap almost closes as E‾\overline{E} grows.

Computational Performance

On the European LV feeder, screening keeps 54% to 70% of the 11,227 candidate pairs at E‾=0.001\overline{E} = 0.001 p.u. and 89% to 98% at 0.005 p.u. Table II compares the computation time on

SetDirect WithDirect WithoutAlgorithm 1 WithAlgorithm 1 Without
Convex hull174OOM2664,133
Box4.164.49.92,473

Table II. Computation time (s) with and without constraint screening

feeder with and without screening for Eˉ=0.001\bar{E} = 0.001 p.u. Where both runs finished, the run without screening takes about 16 to 250 times as long. The direct model of the convex hull without screening has 109 million constraints and runs out of memory (OOM) at 128 GiB.

On South Alburg, screening takes between 18 seconds (for the box) and 66 minutes (for the ellipsoid). It removes 54.4% to 90.3% of the binary variables as infeasible pairs and 91.7% to 99.99% of the error constraints. For the convex hull, the error constraints drop from 231 million to 2.9 million.

The direct model and Algorithm 1 give the same number of super-nodes where both runs finished, and the direct model is at least as fast (Table III). For the box, screening removes most error constraints, and the robust counterpart does not grow with the number of samples. For the ellipsoid, the direct model exceeds the memory limit of 480 GiB while it is built, and only Algorithm 1 proves the minimal number of super-nodes.

SetDirectAlgorithm 1
Convex hull6.1 h / 958.8 h / 36
Box4 min / 2019 min / 21
EllipsoidOOM / >4808.4 h / 26
Wasserstein, ℓ1\ell_114 min / 2016 min / 21
Wasserstein, ℓ2\ell_229 min / 2629 min / 22
Wasserstein, ℓ∞\ell_\infty26 min / 4632 min / 22

Table III. Computation time / peak memory (GiB) on South Alburg.

In the finished runs, Algorithm 1 needs at most 36 GiB, against 95 and 46 GiB for the direct convex-hull and ℓ∞\ell_\infty Wasserstein models. As Eˉ\bar{E} grows, screening removes fewer candidate pairs, and the direct models need more memory: at Eˉ=0.002\bar{E} = 0.002 p.u., the direct convex-hull and ℓ1\ell_1 and ℓ2\ell_2 Wasserstein models need 125 to 227 GiB, while Algorithm 1 needs at most 58 GiB.

Discussion

The choice of the set is a trade-off between reduction, computation time and accuracy on unseen loading. On the test day of South Alburg, only one of the 24 hours lies in the box and none in the convex hull. Both reductions exceed Eˉ\bar{E} in 8 hours, with errors up to 7.1Eˉ7.1\bar{E} with LinDistFlow and 7.3Eˉ7.3\bar{E} with AC power flow. The violations happen in 4 nodes, with the largest contribution from the load at the bus of the worst node, up to 17 times its largest training value. Projected onto their own sets, these hours satisfy the bound, as certified. With the more conservative ellipsoid and Wasserstein sets, the test-day errors stay below Eˉ\bar{E}. The box gives a large reduction in minutes, but its accuracy depends on whether future injections stay in the sampled range.

Conclusion

This paper extended Opti-KRON to account for uncertain nodal injections. Under the LinDistFlow model, the proposed formulation enforces voltage magnitude error bounds over robust uncertainty sets and worst-case CVaR bounds under a Wasserstein ambiguity set. On the South Alburg feeder, the sets that stay within the sampled range of the injections gave the largest reductions. Constraint screening removed most error constraints before the solve. For one robust uncertainty set, only Algorithm 1 proved the minimal number of super-nodes, as the direct model ran out of memory.

The guarantee holds only for the approximate LinDistFlow errors and for injections in the set. On the test day, the largest reductions exceeded the voltage magnitude error threshold in hours where some loads lay far outside their training range. Future work will calibrate the size of the sets on separate data and for each voltage magnitude error, since each error depends mainly on a few injections. A margin on the threshold could cover the difference between the LinDistFlow and AC errors. We also plan to use the robust reductions in OPF problems, where the threshold tightens the voltage limits.

References

  1. [1]F. Dörfler and F. Bullo, “Kron reduction of graphs with applications to electrical networks,” IEEE Trans. Circuits Syst. I, Reg. Papers, vol. 60, no. 1, pp. 150–163, 2013.
  2. [2]Z. K. Pecenak, V. R. Disfani, M. J. Reno, and J. Kleissl, “Inversion reduction method for real and complex distribution feeder models,” IEEE Trans. Power Syst., vol. 34, no. 2, pp. 1161–1170, 2019.
  3. [3]S. Chevalier and M. Almassalkhi, “Towards optimal Kron-based reduction of networks (Opti-KRON) for the electric power grid,” in 2022 IEEE 61st Conference on Decision and Control (CDC), 2022, pp. 5713–5718.arxiv.org/abs/2204.05554
  4. [4]O. Mokhtari, S. Chevalier, and M. Almassalkhi, “Structure-preserving optimal Kron-based reduction of radial distribution networks,” IEEE Trans. Power Syst., 2026, early access, doi: 10.1109/TPWRS.2026.3726028.DOI
  5. [5]O. Mokhtari, S. Chevalier, and M. Almassalkhi, “Optimal Kron-based reduction of networks (Opti-KRON) for three-phase distribution feeders,” Electric Power Systems Research, vol. 263, p. 113615, 2027.arxiv.org/abs/2510.19608
  6. [6]L. A. Roald, D. Pozo, A. Papavasiliou, D. K. Molzahn, J. Kazempour, and A. Conejo, “Power systems optimization under uncertainty: A review of methods and applications,” Electric Power Syst. Res., vol. 214, 2023, Art. no. 108725.
  7. [7]M. E. Baran and F. F. Wu, “Network reconfiguration in distribution systems for loss reduction and load balancing,” IEEE Trans. Power Del., vol. 4, no. 2, pp. 1401–1407, Apr. 1989.
  8. [8]L. Gan and S. H. Low, “Convex relaxations and linear approximation for optimal power flow in multiphase radial networks,” in Proc. Power Syst. Comput. Conf. (PSCC), 2014, pp. 1–9.arxiv.org/abs/1406.3054
  9. [9]A. Ben-Tal, L. El Ghaoui, and A. Nemirovski, Robust Optimization. Princeton, NJ: Princeton University Press, 2009.
  10. [10]P. Mohajerin Esfahani and D. Kuhn, “Data-driven distributionally robust optimization using the Wasserstein metric: Performance guarantees and tractable reformulations,” Math. Program., vol. 171, no. 1-2, pp. 115–166, 2018.
  11. [11]A. Mutapcic and S. Boyd, “Cutting-set methods for robust convex optimization with pessimizing oracles,” Optim. Methods Softw., vol. 24, no. 3, pp. 381–406, 2009.DOI
  12. [12]D. Bertsimas and M. Sim, “Reformulation versus cutting-planes for robust optimization,” Comput. Manag. Sci., vol. 13, no. 2, pp. 205–217, 2016.DOI
  13. [13]K. P. Schneider et al., “Analytic considerations and design basis for the IEEE distribution test feeders,” IEEE Trans. Power Syst., vol. 33, no. 3, pp. 3181–3188, May 2018.DOI
  14. [14]J. Fan, Y. Liao, and M. Mincheva, “Large covariance estimation by thresholding principal orthogonal complements,” J. R. Stat. Soc. Ser. B Stat. Methodol., vol. 75, no. 4, pp. 603–680, 2013.arxiv.org/abs/1201.0175
  15. [15]D. Bertsimas and M. Sim, “The price of robustness,” Oper. Res., vol. 52, no. 1, pp. 35–53, 2004.

Paper details

vlnc:W_yg5jmg88
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Engineering

Not recorded for this paper

View statement
Looking for related papers…
Contents