Flexible mesh-shaped distribution network topology with adaptive geographical layered-clustered probabilistic planning

With the large-scale integration of distributed renewable energy, traditional distribution network topologies lack the flexibility to fully exploit wide-area source-load complementarity and flexible resources, limiting the efficient and secure accommodation of distributed generation (DG). To address this, we propose a mesh-shaped distribution network topology with a three-terminal soft open point (SOP) as the core device, balancing existing grid features with retrofit complexity. Given the high-dimensional, complex MILP resulting from planning under strong stochasticity, we introduce a novel geographical layered-clustered planning method. This method, utilizing an improved fast-unfolding algorithm, considers spatio-temporal source-load distribution, customer reliability, and line-construction needs during clustering, effectively decomposing the planning problem into parallelizable subproblems to improve efficiency. A real-world case study validates the proposed method, identifying the most suitable application scenarios for the mesh-shaped topology. Compared to conventional feeder-partition-based planning, our method accommodates current target structures’ construction requirements while saving over 80% of computation time with only a 1.71% loss in optimality.

Authors

Publication Details

Journal
International Journal of Electrical Power & Energy Systems
Published
2026-01-22
DOI
https://doi.org/10.1016/j.ijepes.2026.111583
Primary Topic
Optimal Power Flow Distribution
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Flexible mesh-shaped distribution network topology with adaptive geographical layered-clustered probabilistic planning

Bin Xu, Peng Zhang, Qizhe Li, Bo Peng et al.
International Journal of Electrical Power & Energy Systems
Optimal Power Flow Distribution
article

Flexible mesh-shaped distribution network topology with adaptive geographical layered-clustered probabilistic planning

Bin Xu, Peng Zhang, Qizhe Li, Bo Peng, Shaohan Lu, Hong Liu
article en

Abstract

With the large-scale integration of distributed renewable energy, traditional distribution network topologies lack the flexibility to fully exploit wide-area source-load complementarity and flexible resources, limiting the efficient and secure accommodation of distributed generation (DG). To address this, we propose a mesh-shaped distribution network topology with a three-terminal soft open point (SOP) as the core device, balancing existing grid features with retrofit complexity. Given the high-dimensional, complex MILP resulting from planning under strong stochasticity, we introduce a novel geographical layered-clustered planning method. This method, utilizing an improved fast-unfolding algorithm, considers spatio-temporal source-load distribution, customer reliability, and line-construction needs during clustering, effectively decomposing the planning problem into parallelizable subproblems to improve efficiency. A real-world case study validates the proposed method, identifying the most suitable application scenarios for the mesh-shaped topology. Compared to conventional feeder-partition-based planning, our method accommodates current target structures’ construction requirements while saving over 80% of computation time with only a 1.71% loss in optimality.

International Journal of Electrical Power & Energy SystemsVol. 175
Affordable and clean energy
Openalex Percentile: Top 78%
Optimal Power Flow Distribution
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.