Metraipolis › archive › dc_bf69cc1ac702

Network Topology Reconfiguration: Optimal Transition Planning — arXiv:2608.12047

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.12047
License (as archived)
CC0-1.0
Archived
2026-10-19T06:06:27.159Z
SHA-256 of the archived text
d283edc04126715c4ef923b80d19aea3cb73b5019f59d4908c45903bf5918e3a
Stable URL of this page
https://metraipolis.com/documento/dc_bf69cc1ac702

How to cite

Network Topology Reconfiguration: Optimal Transition Planning — arXiv:2608.12047 — arXiv (en), https://arxiv.org/abs/2608.12047 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bf69cc1ac702 (Metraipolis archive dc_bf69cc1ac702, sha256 d283edc04126715c4ef923b80d19aea3cb73b5019f59d4908c45903bf5918e3a)
BibTeX
@misc{dcbf69cc1ac702,
  title = {Network Topology Reconfiguration: Optimal Transition Planning — arXiv:2608.12047},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.12047},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bf69cc1ac702; sha256 d283edc04126715c4ef923b80d19aea3cb73b5019f59d4908c45903bf5918e3a},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.12047. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Network topology reconfiguration (NTR) can reduce power system operating costs by co-optimizing generation dispatch and substation switching, but the reported savings describe a target operating point rather than a way to reach it. Reaching this operating point requires a sequence of intermediate operating points, each satisfying the AC power flow equations and thermal limits; because each topology admits its own feasible dispatch region, a naive transition that switches or redispatches first can drive intermediate flows past their thermal limits. Existing methods leave this gap open: snapshot NTR identifies a target but not a route. We formulate the Optimal Transition Planning (OTP) problem, co-optimizing the switching sequence and dispatch trajectory subject to AC feasibility at every intermediate point. We solve this problem with a receding-horizon framework: a DC planner proposes a trajectory that is certified against an AC feasibility filter, and infeasible topologies are excluded using reusable combinatorial cuts. Case studies on congested PGLib-OPF systems up to 1354-bus show that the method produces AC-feasible transitions that reduce operating cost by up to 18.4% compared to the no-switching ACOPF solution on commodity hardware.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-08-13 in eess.SY).
Categorie arXiv: Systems and Control (eess.SY).
Pagina del lavoro: https://arxiv.org/abs/2608.12047 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T05:56:09.570Z dalla pagina https://arxiv.org/catchup/eess.SY/2026-08-13?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).