pith. sign in

arxiv: 2406.11332 · v2 · submitted 2024-06-17 · 🧮 math.OC · cs.SY· eess.SY

Power Distribution Network Reconfiguration for Distributed Generation Maximization

Kin Cheong Sou , Gabriel Malmer , Lovisa Thorin , Olof Samuelsson This is my paper

Pith reviewed 2026-05-24 00:10 UTC · model grok-4.3

classification 🧮 math.OC cs.SYeess.SY
keywords network reconfigurationdistributed generationhosting capacityDistFlow equationsbilinear programmingspatial branch-and-boundpower distribution systemsoptimal power flow
0
0 comments X

The pith

Exact bilinear DistFlow program solved by spatial branch-and-bound enables real-time joint topology and dispatch optimization to maximize distributed generation hosting capacity.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes that common relaxations and approximations for power flow in reconfiguration problems produce incorrect results, as demonstrated by counterexamples. It proposes instead an exact bilinear program derived directly from the DistFlow equations, solved globally via spatial branch-and-bound. If this holds, distribution operators can increase hosting capacity for distributed generation through reconfiguration without new infrastructure, while meeting real-time computation requirements on systems up to hundreds of buses.

Core claim

The central claim is that formulating the network reconfiguration problem for DG maximization using the exact DistFlow equations as a bilinear program and solving it with spatial branch-and-bound yields reliable optimal solutions for both topology and dispatch, with computation times compatible with real-time operation on benchmark networks and a 533-bus real-world system.

What carries the argument

Bilinear program from the exact DistFlow equations, solved by spatial branch-and-bound to handle the nonconvexity arising from topology choices and power flows.

If this is right

  • Reconfiguration becomes a practical tool to raise DG hosting capacity without infrastructure upgrades.
  • Joint optimization of topology and dispatch is feasible without relying on approximations that can err.
  • Real-time operation is supported on both standard test cases and large real networks.
  • Utilities gain a method that avoids erroneous results from interior-point, linearized, or second-order cone approaches.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same bilinear-plus-SBB structure might apply to other nonconvex distribution problems such as volt-var optimization.
  • If runtimes remain acceptable, periodic re-optimization could respond to changing DG output or load.
  • Success on a 533-bus system suggests the approach could be tested on even larger meshed or multi-feeder networks.

Load-bearing premise

The spatial branch-and-bound implementation on this bilinear formulation will scale to produce solutions fast enough for real-time operation on 533-bus systems.

What would settle it

Running the method on the 533-bus system and finding that solution times exceed real-time limits or that obtained solutions are suboptimal compared to a verified global optimum would falsify the claim.

Figures

Figures reproduced from arXiv: 2406.11332 by Gabriel Malmer, Kin Cheong Sou, Lovisa Thorin, Olof Samuelsson.

Figure 1
Figure 1. Figure 1: 33-bus distribution system from [1] with five tie [PITH_FULL_IMAGE:figures/full_fig_p005_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Reconfiguration with K = 2 (line {2, 22} opened and line {24, 28} closed). Bus color shows the voltage level and the percentage of current rating of bottleneck lines are shown. Total DG output is 4.33 MW. and another switch closed) with the usual voltage limits of 0.95 pu and 1.05 pu. The result is shown in [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗
Figure 4
Figure 4. Figure 4: 3-bus distribution system example demonstrating fail [PITH_FULL_IMAGE:figures/full_fig_p006_4.png] view at source ↗
Figure 6
Figure 6. Figure 6: Benchmark 33bw (600 A line rating): actual voltage [PITH_FULL_IMAGE:figures/full_fig_p007_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: Map of the 533-bus distribution system. The width of [PITH_FULL_IMAGE:figures/full_fig_p008_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: Setup of the wind scenario in the normal radial [PITH_FULL_IMAGE:figures/full_fig_p008_8.png] view at source ↗
Figure 11
Figure 11. Figure 11: 3D bar chart displaying the HC at each node. The blue, [PITH_FULL_IMAGE:figures/full_fig_p009_11.png] view at source ↗
Figure 12
Figure 12. Figure 12: Share of nodes, x%, that exhibit a HC increase of y% or higher from reconfiguration. Red depict the increase from K = 0 to K = 2, yellow from K = 0 to K = 4. the HC is also higher at urban nodes than at rural. A large share of red or yellow in a bar indicates that the HC at that node can be improved substantially by reconfiguration. A large share of the urban nodes, but also some rural, exhibit this subst… view at source ↗
read the original abstract

Network reconfiguration can significantly increase the hosting capacity (HC) for distributed generation (DG) in radially operated systems, thereby reducing the need for costly infrastructure upgrades. However, when the objective is DG maximization, jointly optimizing topology and power dispatch remains computationally challenging. Existing approaches often rely on relaxations or approximations, yet we provide counterexamples showing that interior point methods, linearized DistFlow and second-order cone relaxations all yield erroneous results. To overcome this, we propose a solution framework based on the exact DistFlow equations, formulated as a bilinear program and solved using spatial branch-and-bound (SBB). Numerical studies on standard benchmarks and a 533-bus real-world system demonstrate that our proposed method reliably performs reconfiguration and dispatch within time frames compatible with real-time operation.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 1 minor

Summary. The manuscript claims that common relaxations and approximations (interior-point methods, linearized DistFlow, SOC relaxations) produce erroneous solutions for joint network reconfiguration and DG dispatch aimed at maximizing hosting capacity, supports this with counterexamples, and proposes an exact-DistFlow bilinear formulation solved via spatial branch-and-bound. It asserts that numerical studies on standard benchmarks and a 533-bus real-world system show the method reliably produces solutions within real-time compatible time frames.

Significance. If the numerical claims hold with verifiable performance data, the work would be significant for distribution-system planning because it supplies an exact, non-relaxed approach to a practically relevant combinatorial problem where approximation errors can lead to infeasible or suboptimal configurations. The use of the exact DistFlow equations without parameter fitting or self-referential reductions is a methodological strength.

major comments (2)
  1. [Abstract] Abstract: the central claim that the SBB method 'reliably performs reconfiguration and dispatch within time frames compatible with real-time operation' on the 533-bus system rests on numerical studies whose runtimes, optimality gaps, hardware platform, solver tolerances, and branching statistics are not reported, preventing verification that the bilinear terms (voltage-current products) and switch decisions admit efficient spatial branching at this scale.
  2. [Numerical studies] Numerical studies section: without concrete data on node exploration, wall-clock times, or gap closure for the 533-bus instance, the assertion that the approach scales to real-world sizes cannot be evaluated and directly undermines the real-time compatibility claim.
minor comments (1)
  1. The counterexamples for existing methods should specify the network sizes, the exact nature of the erroneous solutions (e.g., infeasibility or sub-optimality), and how they were detected.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for highlighting the need for verifiable computational details to support the scalability and real-time claims for the 533-bus system. We address both major comments below and will revise the manuscript to include the requested data.

read point-by-point responses

  1. Referee: [Abstract] Abstract: the central claim that the SBB method 'reliably performs reconfiguration and dispatch within time frames compatible with real-time operation' on the 533-bus system rests on numerical studies whose runtimes, optimality gaps, hardware platform, solver tolerances, and branching statistics are not reported, preventing verification that the bilinear terms (voltage-current products) and switch decisions admit efficient spatial branching at this scale.

    Authors: We agree that the abstract does not contain the supporting numerical details. In the revised version we will expand the abstract to reference a new table (or subsection) that reports wall-clock times, final optimality gaps, hardware platform, solver tolerances, and branching statistics for the 533-bus instance, thereby allowing direct verification of the real-time compatibility claim. revision: yes

  2. Referee: [Numerical studies] Numerical studies section: without concrete data on node exploration, wall-clock times, or gap closure for the 533-bus instance, the assertion that the approach scales to real-world sizes cannot be evaluated and directly undermines the real-time compatibility claim.

    Authors: We concur that the numerical studies section currently lacks the concrete performance metrics for the 533-bus case. The revision will add a dedicated table (and accompanying text) listing node exploration counts, wall-clock times, gap closure trajectories, hardware specifications, solver tolerances, and branching statistics for every benchmark, including the 533-bus system. This will substantiate the scaling and real-time claims. revision: yes

Circularity Check

0 steps flagged

No circularity detected; derivation applies standard SBB to exact bilinear DistFlow model

full rationale

The paper formulates the DG maximization problem directly from the exact DistFlow equations as a bilinear program and solves it via spatial branch-and-bound. No load-bearing step reduces by construction to a fitted parameter, self-definition, or self-citation chain. Counterexamples to relaxations are external verification, and numerical results on benchmarks plus the 533-bus system constitute independent empirical support rather than a renaming or ansatz smuggling. The derivation chain is self-contained.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The work rests on the standard DistFlow model and the correctness of spatial branch-and-bound for bilinear programs; no free parameters or invented entities are introduced.

axioms (1)
  • domain assumption Exact DistFlow equations model radial distribution network power flow accurately enough for the optimization task.
    Invoked as the foundation for the bilinear program in the abstract.

pith-pipeline@v0.9.0 · 5664 in / 1103 out tokens · 22669 ms · 2026-05-24T00:10:25.699416+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

32 extracted references · 32 canonical work pages

  1. [1]

    Network reconfiguration in distribution systems for loss reduction and load balancing,

    M. E. Baran and F. F. Wu, “Network reconfiguration in distribution systems for loss reduction and load balancing,”IEEE Power Engineering Review, vol. 9, no. 4, pp. 101–102, 1989

    work page 1989

  2. [2]

    Minimum loss network reconfig- uration using mixed-integer convex programming,

    R. A. Jabr, R. Singh, and B. C. Pal, “Minimum loss network reconfig- uration using mixed-integer convex programming,” IEEE Transactions on Power systems, vol. 27, no. 2, pp. 1106–1115, 2012

    work page 2012

  3. [3]

    A new formulation of distribution network reconfiguration for reducing the voltage volatility induced by distributed generation,

    Y . Song, Y . Zheng, T. Liu, S. Lei, and D. J. Hill, “A new formulation of distribution network reconfiguration for reducing the voltage volatility induced by distributed generation,” IEEE Transactions on Power Sys- tems, vol. 35, no. 1, pp. 496–507, 2019

    work page 2019

  4. [4]

    Assessing the potential of network reconfiguration to improve dis- tributed generation hosting capacity in active distribution systems,

    F. Capitanescu, L. F. Ochoa, H. Margossian, and N. D. Hatziargyriou, “Assessing the potential of network reconfiguration to improve dis- tributed generation hosting capacity in active distribution systems,”IEEE Transactions on Power Systems , vol. 30, no. 1, pp. 346–356, 2014

    work page 2014

  5. [5]

    A linear branch flow model for radial distribution networks and its application to reactive power optimization and network reconfiguration,

    T. Yang, Y . Guo, L. Deng, H. Sun, and W. Wu, “A linear branch flow model for radial distribution networks and its application to reactive power optimization and network reconfiguration,” IEEE Transactions on Smart Grid , vol. 12, no. 3, pp. 2027–2036, 2020

    work page 2027

  6. [6]

    Toward optimal multiperiod network recon- figuration for increasing the hosting capacity of distribution networks,

    Y .-Y . Fu and H.-D. Chiang, “Toward optimal multiperiod network recon- figuration for increasing the hosting capacity of distribution networks,” IEEE Transactions on Power Delivery , vol. 33, no. 5, 2018

    work page 2018

  7. [7]

    Efficient network reconfiguration using minimum cost maximum flow-based branch exchanges and random walks-based loss estimations,

    C. Ababei and R. Kavasseri, “Efficient network reconfiguration using minimum cost maximum flow-based branch exchanges and random walks-based loss estimations,” IEEE Transactions on Power Systems , vol. 26, no. 1, pp. 30–37, 2010

    work page 2010

  8. [8]

    A review of transmission switching and network topology optimization,

    K. W. Hedman, S. S. Oren, and R. P. O’Neill, “A review of transmission switching and network topology optimization,” in 2011 IEEE power and energy society general meeting . IEEE, 2011, pp. 1–7

    work page 2011

  9. [9]

    Network reconfiguration of distribution sys- tems using improved mixed-integer hybrid differential evolution,

    C.-T. Su and C.-S. Lee, “Network reconfiguration of distribution sys- tems using improved mixed-integer hybrid differential evolution,” IEEE Transactions on power delivery , vol. 18, no. 3, pp. 1022–1027, 2003

    work page 2003

  10. [10]

    An improved ts algorithm for loss- minimum reconfiguration in large-scale distribution systems,

    D. Zhang, Z. Fu, and L. Zhang, “An improved ts algorithm for loss- minimum reconfiguration in large-scale distribution systems,” Electric power systems research, vol. 77, no. 5-6, pp. 685–694, 2007

    work page 2007

  11. [11]

    Path- based distribution network modeling: application to reconfiguration for loss reduction,

    E. R. Ramos, A. G. Exp ´osito, J. R. Santos, and F. L. Iborra, “Path- based distribution network modeling: application to reconfiguration for loss reduction,” IEEE Transactions on power systems, vol. 20, no. 2, pp. 556–564, 2005

    work page 2005

  12. [12]

    Optimal transmission switching,

    E. B. Fisher, R. P. O’Neill, and M. C. Ferris, “Optimal transmission switching,” IEEE Transactions on Power Systems , vol. 23, no. 3, pp. 1346–1355, 2008

    work page 2008

  13. [13]

    Transmission system topology optimization for large-scale offshore wind integration,

    H. Ergun, D. Van Hertem, and R. Belmans, “Transmission system topology optimization for large-scale offshore wind integration,” IEEE Transactions on Sustainable Energy , vol. 3, no. 4, pp. 908–917, 2012

    work page 2012

  14. [14]

    Joint grid topology reconfiguration and design of watt-var curves for ders,

    M. K. Singh, S. Taheri, V . Kekatos, K. P. Schneider, and C.-C. Liu, “Joint grid topology reconfiguration and design of watt-var curves for ders,” in 2022 IEEE Power & Energy Society General Meeting (PESGM). IEEE, 2022, pp. 1–5

    work page 2022

  15. [15]

    Branch flow model: Relaxations and convexification – Part I,

    M. Farivar and S. H. Low, “Branch flow model: Relaxations and convexification – Part I,” IEEE Transactions on Power Systems, vol. 28, no. 3, pp. 2554–2564, 2013

    work page 2013

  16. [16]

    Convex models of distribution system reconfiguration,

    J. A. Taylor and F. S. Hover, “Convex models of distribution system reconfiguration,” IEEE Transactions on Power Systems , vol. 27, no. 3, pp. 1407–1413, 2012

    work page 2012

  17. [17]

    New formulation and strong misocp relaxations for ac optimal transmission switching problem,

    B. Kocuk, S. S. Dey, and X. A. Sun, “New formulation and strong misocp relaxations for ac optimal transmission switching problem,” IEEE Transactions on Power Systems , vol. 32, no. 6, pp. 4161–4170, 2017

    work page 2017

  18. [18]

    Robust distribution network reconfiguration,

    C. Lee, C. Liu, S. Mehrotra, and Z. Bie, “Robust distribution network reconfiguration,” IEEE Transactions on Smart Grid , vol. 6, no. 2, pp. 836–842, 2014

    work page 2014

  19. [19]

    Increasing res hosting capacity in distribution networks through closed-loop reconfiguration and volt/var control,

    J. M. Home-Ortiz, L. H. Macedo, R. Vargas, R. Romero, J. R. S. Mantovani, and J. P. Catal ˜ao, “Increasing res hosting capacity in distribution networks through closed-loop reconfiguration and volt/var control,” IEEE Transactions on Industry Applications , vol. 58, no. 4, pp. 4424–4435, 2022

    work page 2022

  20. [20]

    Optimal renewable energy curtailment minimization control using a combined electromo- bility and grid model,

    M. ˇCiˇci´c, C. Vivas, C. C. de Wit, and F. Rubio, “Optimal renewable energy curtailment minimization control using a combined electromo- bility and grid model,” in IFAC 2023-The 22nd World Congress of the International Federation of Automatic Control , 2023

    work page 2023

  21. [21]

    Mat- power: Steady-state operations, planning, and analysis tools for power systems research and education,

    R. D. Zimmerman, C. E. Murillo-S ´anchez, and R. J. Thomas, “Mat- power: Steady-state operations, planning, and analysis tools for power systems research and education,” IEEE Transactions on power systems , vol. 26, no. 1, pp. 12–19, 2010

    work page 2010

  22. [22]

    Horst and H

    R. Horst and H. Tuy, Global optimization: Deterministic approaches . Springer Science & Business Media, 2013

    work page 2013

  23. [23]

    Relaxed connected dominating set problem for power system cyber–physical security,

    K. C. Sou and J. Lu, “Relaxed connected dominating set problem for power system cyber–physical security,” IEEE Transactions on Control of Network Systems , vol. 9, no. 4, pp. 1780–1792, 2022

    work page 2022

  24. [24]

    Joint renewable generation maximization and radial distribution network reconfiguration,

    K. C. Sou and K. Gir ´on, “Joint renewable generation maximization and radial distribution network reconfiguration,” in 2022 IEEE PES Innovative Smart Grid Technologies-Asia (ISGT Asia) , pp. 16–20

    work page 2022

  25. [25]

    S. P. Boyd and L. Vandenberghe, Convex optimization . Cambridge university press, 2004

    work page 2004

  26. [26]

    Optimal power flow of radial networks and its variations: A sequential convex optimization approach,

    W. Wei, J. Wang, N. Li, and S. Mei, “Optimal power flow of radial networks and its variations: A sequential convex optimization approach,” IEEE Transactions on Smart Grid , vol. 8, no. 6, pp. 2974–2987, 2017

    work page 2017

  27. [27]

    Reconfiguration of distribution systems for loss reduction using tabu search,

    M. A. Guimaraes and C. A. Castro, “Reconfiguration of distribution systems for loss reduction using tabu search,” in IEEE Power System Computation Conference (PSCC) , vol. 1, 2005, pp. 1–6

    work page 2005

  28. [28]

    Maximization of distribution network hosting capacity through optimal grid reconfiguration and distributed generation capacity allocation/control,

    R. Cadjenovic and D. Jakus, “Maximization of distribution network hosting capacity through optimal grid reconfiguration and distributed generation capacity allocation/control,” Energies, vol. 13, no. 20, p. 5315, 2020

    work page 2020

  29. [29]

    Resilient scheduling of control software updates in radial power distribution systems,

    K. C. Sou and H. Sandberg, “Resilient scheduling of control software updates in radial power distribution systems,” IEEE Transactions on Control of Network Systems , 2023. [Online]. Available: https://doi.org/10.1109/TCNS.2023.3338254

    work page doi:10.1109/tcns.2023.3338254 2023

  30. [30]

    Network reconfiguration for renewable generation maximization,

    G. Malmer and L. Thorin, “Network reconfiguration for renewable generation maximization,” Master’s thesis, Lund University, 2023

    work page 2023

  31. [31]

    State-of-the-art of hosting capacity in modern power systems with distributed generation,

    S. M. Ismael, S. H. Abdel Aleem, A. Y . Abdelaziz, and A. F. Zobaa, “State-of-the-art of hosting capacity in modern power systems with distributed generation,” Renewable Energy , vol. 130, pp. 1002–1020, 2019

    work page 2019

  32. [32]

    Optimizing the grid: A regulator’s guide to hosting capacity analyses for distributed energy resources,

    S. Stanfield, S. Safdi, S. Mihaly, and L. Weinberger, “Optimizing the grid: A regulator’s guide to hosting capacity analyses for distributed energy resources,” Interstate Renewable Energy Council, Tech. Rep., 2017

    work page 2017