A

Optimization-based partitioning of high voltage grids

IET conference proceedings., vol. 2026, pp. 934–938

Abstract

This paper presents an optimization-based method for partitioning meshed high voltage grids into subnetworks. A mixed-integer linear program is formulated that minimizes the total distance between grid cells and their assigned root nodes for each subnetwork while ensuring N-1 secure supply from the overlying extra-high voltage grid. Connectivity of the resulting subnetworks is guaranteed through single commodity flow constraints. The methodology is demonstrated through a case study on a high voltage grid region in southwestern Germany, partitioning the network into ten subnetworks. The resulting subnetworks exhibit significant variation in size, with total line lengths ranging from 119 km to 1,534 km. The proposed formulation provides a foundation for future extensions incorporating AC power flow constraints and multi-scenario load conditions.

Authors 4

  1. RWTH Aachen University

    Affiliation as printed

    IAEW at RWTH Aachen University, Aachen, Germany

  2. RWTH Aachen University

    Affiliation as printed

    RWTH Aachen University, Aachen, Germany

  3. Laurids Koch Aachen

    RWTH Aachen University

    Affiliation as printed

    RWTH Aachen University, Aachen, Germany

  4. Andreas Ulbig Aachen

    RWTH Aachen University · Fraunhofer Institute for Applied Information Technology

    Affiliation as printed

    Fraunhofer FIT, Aachen, Germany

    IAEW at RWTH Aachen University, Aachen, Germany

Cited by 0 stored of 0

References 0