The topology of low-voltage distribution networks (LVDNs) is crucial for system analysis, e.g., distributed energy resources (DERs) integration, network hosting capacity analysis, state estimation, and electric vehicle charging management. However, it is frequently unavailable or incomplete. This paper develops a data-driven topology identification approach for LVDNs with a high proportion of underground cables. The proposed approach exploits the fact that underground cables usually follow the street pattern, thus relying on open street map (OSM) and smart meter (SM) data. Three stages compose the proposed approach: In the first stage, a hierarchical minimum spanning tree algorithm is proposed to generate the initial topology with an accurate number of sub-branches from the pre-processed OSM data and peak demand. In the second stage, based on the limited SM data, the location of breakpoints in mesh topology caused by circle roads is verified and reconstructed to guarantee the radial structure of LVDNs. Finally, given multiple incomplete SM datasets, three data-driven optimization models based on a state estimation model are constructed to mitigate the error of cable length induced by OSM data. The feasibility of the proposed topology identification approach is verified on three actual LVDNs in The Netherlands and multiple incomplete SM datasets. Furthermore, the minimal amount of SM data needed to minimize the error of cable length is analyzed.

In this paper, we present two multidimensional power flow formulations based on a fixed-point iteration (FPI) algorithm to efficiently solve hundreds of thousands of Power flows (PFs) in distribution systems. The presented algorithms are the base for a new TensorPowerFlow (TPF) tool and shine for their simplicity, benefiting from multicore Central processing unit (CPU) and Graphics processing unit (GPU) parallelization. We also focus on the mathematical convergence properties of the algorithm, showing that its unique solution is at the practical operational point. The proof is validated using numerical simulations showing the robustness of the FPI algorithm compared to the classical Newton–Raphson (NR) approach. In the case study, a benchmark with different PF solution methods is performed, showing that for applications requiring a yearly simulation at 1-minute resolution, the computation time is decreased by a factor of 164, compared to the NR in its sparse formulation. Finally, a set of applications is described, highlighting the potential of the proposed formulations over a wide range of analyses in distribution systems.