Fig. 1

Graphical representation of the workflow (left to right). An exemplary initial network graph \({\mathcal {G}}\) is displayed to the left. We apply four aggregation methods (k-means, \(f^\mathrm {cap}(v)\), \(f^\mathrm {time}(v)\), Q) that are introduced in chapter Methods and summarised in Table 1. Each of the methods considers a different feature of the network. The clustered graphs are used to solve a reduced capacity expansion problem that minimises the total system costs. Results are evaluated on the resulting regions (chapter Evaluation of the Regions)) and on the optimal capacities and power flows (chapter Evaluation of the Capacity Expansion model)