Evaluation of Temporal Complexity Reduction Techniques Applied to Storage Expansion Planning in Power System Models

The growing share of renewable energy makes the optimization of power flows in power system models computationally more complicated, due to the widely distributed weather-dependent electricity generation. This article evaluates two methods to reduce the temporal complexity of a power transmission grid model with storage expansion planning. The goal of the reduction techniques is to accelerate the computation of the linear optimal power flow of the grid model. This is achieved by choosing a small number of representative time periods to represent one whole year. To select representative time periods, a hierarchical clustering is used to aggregate either adjacent hours chronologically or independently distributed coupling days into clusters of time series. The aggregation efficiency is evaluated by means of the error of the objective value and the computational time reduction. Further, both the influence of the network size and the efficiency of parallel computation in the optimization process are analysed. As a test case, the transmission grid of the northernmost German federal state of Schleswig-Holstein with a scenario corresponding to the year 2035 is considered. The considered scenario is characterized by a high share of installed renewables.


Introduction
One of the most accepted key strategies to address Global Warming is the substantial increase of the renewable energy capacity. This requires a significant transformation of the power network, from few stable big power plants to many weather-fluctuating widely-distributed small power sources. Therefore, in order to achieve a successful transition of the energy system, a detailed planning of the power grid to distribute energy as well as storage planning to ensure a constant power supply are required. The main objective of this article is to evaluate different time series aggregation methods (TSAMs) to reduce the computational time of the linear optimal power flow (LOPF), which is the linear approximation of the power flow equations while minimizing the total system costs. A TSAM approximates the input time series for one whole year, i.e., the load and the renewable energy generation, by a small set of representative time periods (in our case hours or days). The procedure used in this paper involves the following steps: scale and normalize the time series, cluster the time series in groups of periods, choose a representative of each cluster, adapt the corresponding equations on the linear power flow problem, and rescale the representative time series. The necessary tracking of the state of charge of the storage units makes the implementation of the time series clustering more challenging, since it adds constraints linking different time periods. Moreover, the high share of unpredictable renewable energy sources leads to a potentially less accurate approximation of the renewable energy time series.
The paper is structured as follows. In Section 2 we conduct a brief literary review of temporal complexity reduction of power grids focusing on the methods that use representative periods. In the methodology Section 3, the test case, the linearization of the power flow, the clustering methods, the indicators, and the software and hardware used are described in detail. Section 4 contains the optimization of the reference test case. Sections 5 and 6 contain the main results of the paper, comparing the different TSAMs. Sections 7 and 8 study the influence of the network size and the parallel computation on the results. Finally, the conclusions are drawn in Section 9.

Literature Review
In this section, we conduct a brief literary review of temporal complexity reduction of power grids focusing on the methods that use representative periods. In [1] some methods are presented to select representative periods and some indicators are introduced to evaluate the accuracy of the time series representations. Those methods include heuristics, clustering algorithms, random selection, mixed integer linear program (MILP), and hybrid approaches. However, the methods are not evaluated in terms of the accuracy or the time reduction of the linear optimization of the network. Nevertheless, a MILP to optimize the temporally aggregated network is stated, but, as noted in [2] (page 431), for large networks a MILP would be computationally too complicated to solve. Most of the recent articles essentially follow the clustering method presented in [2], specially regarding the normalization and the rescaling of the data. They use the hierarchical clustering with decoupled periods, which amounts to consider each cluster of time series as an isolated entity and, afterwards, paste the results of all clusters together. This method is prone to highly underestimate the storage capacity, since it does not have a coherent state of charge for interperiod storage. For this reason, in [3], the coupling periods method is introduced, which adds extra equations to the decoupling periods method to keep track of the storage units state of charge. In [4], different clustering algorithms are evaluated, like the k-means clustering, the hierarchical clustering, and the hierarchical clustering with added load and feed-in peak periods. In a succeeding article [5], two different sets of equations are introduced to define the linear problem, in order to simplify the coupling periods method for days by the introduction of new variables to take care of the intra-day state of charge and the inter-day state of charge separately. This results in a remarkable computational time reduction for an island energy system (but with no storage planning). A similar method, clustering periods of hours and adding a different set of equations to keep track of the state of charge, is presented in [6] as a system states model with a reduced frequency matrix. Finally, in [7], the time series aggregation method of chronological periods is used, which forces the clustering algorithm to cluster just adjacent time periods. This approach remarkably simplifies the equations taking care of the state of charge, hence allowing a much faster computation.
In [8], a method is presented to systematically analyze the trade-off between complexity and accuracy of energy system models. This is useful in order to anticipate if a certain complexity reduction technique would have a big influence in the computational time and the deviation from the benchmark. Regarding temporal resolution, they conclude that it is strongly related to the solving time. It is also observed [8] (page 21), that the temporal resolution has a stronger impact on the accuracy of the optimization than the spatial resolution, specially if the model have temporal linking constraints, like ramping or dynamic state of charge (as in our case).
The present contribution compares the clustering of coupling days non-chronologically [3], which will be denoted here by coupling clustering, with the clustering of the hours chronologically [7], denoted here by chronological clustering in the context of storage expansion planning. The comparison will be in terms of computational time and error. In [7], the chronological clustering is not compared to the coupling clustering, but it is shown to be more efficient than the decoupling periods method [2], which ignores the consistency of the state of charge. This result is expectable in a system with a large storage capacity. To our knowledge, the present is the first article which compares the chronological clustering to another method that keeps a consistent state of charge. Other clustering methods (like k-means), other linear problem implementations (with different constraint formulations), or other types of periods (like weeks) will not be considered here, since we set the scope of this study to the two methods known to be computationally the more robust and efficient, cf. [2][3][4][5]7,9]. The approaches used will be evaluated on a reference energy system developed in the Open Electricity Grid Optimization project (open_eGo) [10]. The linear optimization problem is solved by the open source Python package Python for Power System Analysis (PyPSA) [11]. In contrast to many of the publications mentioned above, which consider between 10 and 50 time series, our test case uses 437 time series generating a linear problem with up to 6 million variables and 6 million equations. In addition, this contribution compares the computational time reduction (not only the precision of the approximation) and, further, analyses the influence of the size of the network and the potential of parallel computation.

Methodology
In this section we present our methodology, which consists of a test case, the LOPF, the clustering methods that will be evaluated, the indicators, and the hardware and software used in our experiments.

Test case
As a test case, we use a 152 node version of the German federal state of Schleswig-Holstein power transmission grid in an exogenous scenario for 2035 as described in [12]. This data is publicly available and we use it via the open source Python package eTraGo [13] (using the grid version "0.2.11" and the scenario "SH NEP 2035"). This power system is characterized by the high availability of wind energy and the possibility of expanding the storage (both interday and intraday) almost infinitely at a competitive annualized cost, i.e., it is a storage capacity expansion planning problem. Both the high wind availability and storage expansion option, make the system computationally more challenging to optimize. The spatial clustering of the network to 152 nodes is done using the PyPSA tool "kmeans_clustering". A plot of the resulting network is shown in Figure 1, where the size of each bus is proportional to its installed capacity. Table 1 contains the global installed capacity used in the model.
The main characteristics of the power grid and its components are summarized in Table 2 after the references in [12,15,16]. Notice that, in the model, no capital costs are considered for generators, i.e., its installed capacity is fixed. Note also that wind and solar energy generation are assumed to have no operational costs. The properties that will most certainly influence the LOPF are the large installed capacities of wind energy (due to its unpredictable nature) and the option to extend the storage units capacity almost endlessly at a competitive (annualized) price. There are two types of storage systems considered in the model: batteries with a round-trip efficiency of η dis η char = 87% and a smaller power input, functioning as intra-day storage (with an energy to power ration of q = 6) and compressed hydrogen stored in underground salt caverns functioning as inter-day storage (with an energy to power ration of q = 168). This latter has a very low round-trip efficiency of 30%, but has a much bigger power input.   Table 2. Main characteristics of the power grid components. Generator costs (including fuel and CO 2 prices as well as variable and fixed costs) are derived by [12], storage units parameter by [15,16].

Linear Optimization Power Flow
The linear problem computing the LOPF is implemented using the free software toolbox PyPSA [11]. It is well-known that the linearization of the power flow equations introduces only negligible errors in the case that the voltage angle differences across the branches are small, the branch resistances are negligible compared to their reactances, and voltage magnitudes can be kept at nominal values (which is the case when simulating transmission systems). From the many equivalent formulations to compute the LOPF in PyPSA, the Angles+Flow multi-period formulation with long term storage will be used here. Next, we list all the equations of this formulation using the variables and parameters as defined in Table 3. For a detailed formulation we refer to [17]. Table 3. Variables, coefficients and indices of the Angles+Flow multi-period with long term storage formulation of the LOPF. The objective function minimizing the total costs is:

Definition
where, the weighting is such that ∑ t ω t = 8760. The buses power balance is defined by: with power dispatch bounds:g The power flow limits are expressed by: and the Kirchhoff current laws take the form: We also consider the following constraints: 0 ≤ e i,r,t ≤ q i,r H i,r ∀i, r and t, and the time linking constraint keeping track of the state of charge: assuming a cyclic indexing, i.e., e i,r,0 = e i,r,T . That means that the state of charge is forced to be the same at the beginning and at the end of the year. Notice that the weighting ω t as an exponent of the losses means that we account for the accumulated losses for each hour in ω t with respect to the previous state of charge (but assuming no losses of the charged and discharged energy in the those internal hours).
Notice that the only time linking constraint, i.e., containing variables depending on both t and t − 1, is Equation (12). This means that only this equation has to be modified after the time series aggregation, in order to keep the time coherence.

Time Series Aggregation Techniques
Next we describe in details the two TSAMs evaluated in this paper. The open source packages tsam [18], and eTraGo [13], were used to perform the time series aggregations and to adapt the test case network. The packages were conveniently adapted to perform the chronological clustering, the linear problem formalization from [5], and a more elaborate data pre-processing.

Data Preprocessing
The first step of a TSAM is to normalize the different time series so that the clustering would not be affected by the different orders of magnitudes of the time series. The load is normalized with respect to the maximum load value at each grid bus, whereas the energy generation is normalized across all buses, cf. [2]. Then, the time series for the load, wind and solar energy generators at all buses are concatenated in a single time series {x t } t=1,...,8760 with x t = (l 1,t , . . . , l I,t ,g 1,wind,t , . . . ,g I,wind,t ,g 1,solar,t , . . . ,g I,solar,t ).

Clustering
The coupling clustering for days groups the time series of the reference network in periods {x d } d=1,...,365 , After that, the hierarchical clustering (as implemented in the Python package Scikit-learn.cluster.AgglomerativeClustering using Ward's algorithm) is applied to aggregate the days in a fixed number, k, of groups (not necessary consecutive, i.e., in a non-chronological order). In the first step, this clustering method aggregates two days with minimum deviation in their data sets x d −x d , where · indicates the Euclidean norm. Then it aggregates the two clusters that minimizes the total within-cluster variance according to Ward's linkage criterion [19]. This procedure is repeated until the desired number of clusters k is reached. The coupling clustering is chosen since it performs better than other clustering methods in the context of TSAMs, cf. [4]. The choice of daily periods has the advantage of better approximating data with daily patterns, like the load and the solar generation, but at the price of approximating less accurately the wind generation, cf. [7]. The chronological clustering uses the same principle as the coupling clustering with the additional condition to cluster only consecutive hours, i.e., chronologically, of the time series of the reference network {x t } t=1,...,8760 [7]. Notice that the clustering is applied to load and generators in block, since it produces a more drastic simplification of the reference network in contrast to what would happen if the cluster would be done for each generator and the load independently.
After the clustering step, the medoid of each cluster is chosen as representative period, that is, the element of the cluster that is closer to the mean value of all the cluster components. Notice that, other clustering algorithms choose the centroid of the cluster instead, which is the mean value of all the elements in the cluster. However, in the context of TSAMs, the representative periods produce better approximations than the centroid periods since they do not discard extreme periods, cf. [4]. A visualization of the two clustering methods is shown in Figure 2 for 5 representative days (respectively 120 h) of a wind generator. Since the chronological clustering is not forced to use daily patterns (like the coupling clustering), it is able to capture more accurately the abrupt changes in the wind intensity. On the other hand, the load and the solar energy are very poorly approximated by the chronological clustering when not enough representative hours are considered.

Data Rescaling
After the clustering, the data needs to be rescaled or normalized (to reverse the preprocessing done in Section 3.3.1), cf. [2] (Step 6).

Adapting the Linear Problem
The chronological method [7], reduces the equations of the linear problem. This is achieved by using just the equations corresponding to the representative hours and defining the weighting ω t at a representative hour t as the number of components represented by t. The coupling method [3] (Method M1), makes the same reduction to the representative days, but also requires to keep the time linking constraints regarding the state of charge, Equation (12), for every single hour of the year, i.e., coupling the days in the right chronological order. This is done using a map of the distribution of each representative day through the year. Notice that, the chronological clustering reduces all the time dependent variables, equalities, and inequalities from 8760 to the number of clusters k. On the other hand, the coupling clustering has to keep all the 8760 equations corresponding to the state of charge (and the variables involved).

Indicators
In order to compare the LOPF of the temporally aggregated networks to the reference network, we use the so called average objective error (AOE) [7], which has the following general formula: where z andz are, respectively, the objective values of the network before and after the temporal aggregation. Recall that the objective value is the annual cost (which strongly depends on the built storage capacities). The same formula applied to the computational time calculates the average time reduction (ATR). The AOE and the ATR are the most common indicators used to evaluate the trade-off between the accuracy and the complexity of an energy model, cf. [3][4][5]7]. More conceptual indicators are considered in [20], but they only consider temporal aggregations that do not change the model output (Section 6.2.1, [20]). In order to compare the accuracy of the clustering before the optimization, following [2], we will use the Pearson correlation. If {l i,t } i∈I,0≤t≤8760 denotes the time series at node i of the load aggregated time series, the Pearson correlation is defined as: wherel i andl i are the respective mean values of the time series. The Pearson correlation of the load, Corr load , is the average value of all Corr i for all i ∈ I. It is similarly defined for the time series of solar and wind energy. Other indicators that were considered for evaluating the accuracy of the clustering were the normalized root square error, the covered variability (Equation (12), [2]), the skewness and the Kurtosis. All these indicators (also applied to the duration curves of the time series, cf. Appendix B, [2]) were tested in the preparation of this paper, but finally discarded, since they gave no further hints than the Pearson correlation.

Solver and Hardware
We use the optimization solver Gurobi with an academic licence [21], and with the Barrier solving method (with deactivated crossover). This method was selected to enable parallel computations. We fixed the convergence tolerances to 10 −4 . The computations were conducted on a server with 48 Intel(R) Xeon(R) Gold 6128 CPUs @ 3.40 GHz and 3 TB RAM.

Test Case Optimization
The LOPF of the test case (without temporal aggregation) results in a cost value of 103 million EUR and it is calculated in ca. 110 min. All the battery storage units are optimized to a capacity around 0.25 MW and 1.5 MWh and most of the compressed hydrogen underground storage caverns are around 8.7 MW and 1.5 GWh. Notice that this capacity is similar to the capacity established by other research papers for similar scenarios, cf. [16] (page 53). The total storage capacity of the non-aggregated test case sums up to 74.87 GWh. At the beginning of the year, the LOPF considers an almost full global state of charge (64.36 GWh), which is reasonable since there are no costs for the energy stored the previous year, see Figure 3. On the other hand, the state of charge is imposed to be the same for each storage unit at the beginning and at the end of the year.
The total share of dispatched energy carriers is shown in Table 4. The energy is highly dominated by wind energy (71.58%) and the total renewable energy share amounts to 90.98%. This is a consequence of the fact that wind energy does not have management costs, that the storage potential is very large and economically competitive, and that the wind capacity in the region of Schleswig-Holstein is meant for exportation to less windy regions (but in our model we set it only for internal consumption).  Although the load is mostly covered by wind and solar, in less windy periods there is not enough renewable energy generation to cover the energy demand, even using all the available stored energy. As an example, we plot the generated power for March stacked by carrier in Figure 4. There is a big power curtailment of 74.11% of wind energy and of 44.33% of solar energy, which is neither used nor stored. This is a consequence of the fact that the installed generation capacity is fixed, but the storage is optimized in order to minimize the costs. It is also magnified by large wind generation capacity of the region. So adding new transmission lines to adjacent regions or increasing the capacity of the existing lines would certainly decrease the curtailment.

Time Series Aggregation Efficiency
The Pearson correlation of the aggregated time series is shown in Figure 5. This graphic shows how the different time series get better approximated with more representative periods. Note that the coupling clustering approximates the load and the solar energy better than it does for wind energy (since the latter does not show a daily pattern). The chronological clustering, on the other hand, approximates the wind energy better and it needs relatively a lot of representative hours to be able to approximate the solar energy and the load. Considered altogether, both clustering methods monotonically improve the approximation with the increase of representative periods, showing a good potential for the application that this article pursues.

Time Reduction and Error
The average objective error (AOE) and the average time reduction (ATR) for an increasing number of representative periods for the different TSAMs are shown in Figure 6. With the chronological clustering, the error is reduced almost monotonically to zero, although it is very high when we consider just few representative hours. Most notably, the computational time is reduced very significantly. For instance, with 2400 representative hours we have an AOE of less than 1% and a time reduction of 88%. Notice that, the AOE is mostly negative, meaning that the global costs of the system, i.e., the objective value, is underestimated. This means that the storage capacity needed by the system is underestimated, see Figure 7. This is probably due to the inaccurate representation of the variability of the available wind energy, which is also the most curtailed, see Figure 8.  Notice that wind energy is always above the 60% share. On the other hand, the coupling clustering shows a more chaotic error convergence and the time reduction is not considerable. In fact, above 50 representative days it takes more time to compute than the reference problem, which makes this temporal aggregation useless. This might seem a contradiction with the fact that the temporal aggregation creates a smaller linear problem, but we must also account for the modifications of the equations representing the state of charge, Section 3.3.4, which increase the relations between the variables and, thus, the complexity of the problem. Even if the AOE is very small for 40 representative days, it only reduces the computational time by 30%. Even worse is the fact that the error does not reduce gradually nor monotonically, hence making it difficult to decide for a convenient number of representative days to use.
Different methods to decide the number of representative periods (before the temporal clustering) have been proposed, cf. [2] (Section 5.1) or [22]. However this is a challenging issue and there are no conclusive results. Even more, the methods available do not help in our case, since there is no correlation between the error of the clustering ( Figure 5) and the AOE ( Figure 6). The only reliable process is to progressively compare the objective value of the network aggregated to k nodes with the network aggregated to k − 1 nodes and stop when the difference between the objective values is small enough. Nevertheless, it can only be helpful with the chronological clustering approach. In the case of the coupling clustering, because of its chaotic behaviour, this method does not give a good indicator of the error convergence, see Figure 6.
The chaotic behaviour of the AOE obtained for the coupling clustering was not mentioned in the article where the method was introduced [3]. This may be due to the much smaller network used (see Section 7) and that the optimization is carried out using a MILP. This behaviour can be, nevertheless, observed in [5] (Figure 6) for an island system with two storage units. However, contrary to our results, in this reference, the computational time is always reduced by the coupling clustering. As we will see in Section 7, this is a consequence of the fact that they use a much smaller network compared to ours. In [4], they also introduce two alternative implementations of the coupling clustering aimed at further reducing the computational time. However, when tested with our test case, we obtain a similar ATR ( Figure 6) as for the original method formulation in [3].
The results of the chronological clustering are consistent with the results in [7] (Figure 3), where the method was introduced. However, in that article, it is compared to the clustering of (non-adjacent) representative days without changing the time linking constraints tracking the state of charge (Equation (12)). That makes the error much bigger than the coupling method presented here (to the point of making the clustering methods useless as already observed in [3,4]). The advantage of the methods compared in [7] is that the computational time reduction is similar in all of them, cf. [7] (Figure 4), and no anomaly (as in Figure 6) is observed. What our results show is that the coupling clustering can actually give very good approximations, but in an unpredictable way and not necessarily reducing the computational time.

Influence of the Power Network Size
The results of Section 6 for our test case were also confirmed by repeating the calculations for other power networks of similar or bigger size constructed from the open_eGo network, cf.
[10], and the PyPSA-Eur network, cf. [23]. However, if the size of the power network is reduced, the computational time reduction of the coupling clustering has a better behavior. In order to reduce the network we use the spatial clustering method implemented in [11]. Roughly, it first uses a k-mean clustering algorithm to cluster the buses into k groups and chooses the centroid as the representative of each cluster. Then the lines connecting the same clusters have their capacity aggregated into a single line connecting the respective centroids and all the generators, loads and storage units attached to the buses of one cluster are attached to the centroid.
In Figure 9, we show the AOE and the ATR, respectively, for the test case of a power network spatially clustered to 10 nodes. As in the original test case, the AOE of the coupling method still has a rather chaotic behavior, whereas the chronological clustering behaves in a better way. However, in this case, the coupling clustering does reduce significantly the computational time, although not as much as the chronological clustering. For instance, using just 50 representative days (correspondingly 1200 h) both algorithms have a similar AOE, but the ATR of the chronological clustering is of 96% whereas for the coupling clustering it is of 74%.
It is also interesting to stress the remarkable computational simplification of the spatial clustering. The computational time is reduced by more than 95% and the error is just of 0.01%. Hence, if we are not interested in the spatial distribution of the storage planning, the spatial clustering is a much more efficient method to reduce the computational time than the TSAMs, at least in the system under study with a high dependency on wind energy generation, cf. [8] (page 21).

Influence of Parallel Computation
The Barrier algorithm from the Gurobi solver with the academic license allows for running parallel computations with up to 8 CPU threads. To evaluate the benefits of using parallel computation combined with the TSAMs, we repeat the previous computations from Section 6, previously done with 4 CPU threads, with 1, 2 and 8 CPU threads. However, it is also important to notice that the computational time reduction is known not to increase linearly nor indefinitely when increasing the number of threads, cf. [24] (page 55).
The absolute computational time for the coupling clustering and the chronological clustering as well as the different number of CPU threads used are shown in Figure 10. For the coupling clustering, there is no time reduction for 50 representative days or more (like for the case of 4 CPU threads in Figure 6). For 40 days, the time reduction achieved by the parallel computation (comparing 1 thread to 8 threads) is of a similar magnitude of that of the clustering with 4 threads. On the other hand, for the chronological clustering, the advantages of parallel computation are less remarkable, since the time reduction achieved by the temporal clustering in Figure 6 is bigger than the one achieved by the parallel computing.

Conclusions
This article evaluates two time series aggregation methods to reduce the computational time of the linear optimal power flow computation for a power grid highly depending on wind generation and with storage planning: the coupling clustering of independent days and the chronological clustering of consecutive hours. The fact that the storage planning include both intra-day and inter-day storage makes other existing methods (with no coherent state of charge equations) inappropriate. The use of the hierarchical clustering instead of other clustering methods is based in a consistent better behavior in the consulted literature.
The present paper can help to choose a complexity reduction technique, with a remarkable impact in the time reduction of the optimization process. This would allow the optimization of larger storage planning energy models, which can help in making important decisions in energy policy to facilitate the transition into a carbon-neutral energy system.
The chronological clustering gave the best results in terms of computational time reduction. Also the error obtained converges rather monotonically to zero when increasing the number of typical hours, hence having a more predictable behavior.
The coupling day clustering is not always able to reduce the computational time and the error does not converge smoothly to zero, hence making it difficult to use in practice. This behavior is expected with power networks of a similar (or bigger) size and characteristics to the test case. However, for much smaller networks, the coupling method improves considerably. The reason behind the bad performance of the coupling method is that the reduction of equations was canceled out by the intertwining of the time linking constraints keeping track of the state of charge of the storage units. Furthermore, the use of more CPU threads does not contribute significantly to the computational time reduction already achieved by the TSAMs, specially with the chronological method.
It is also worth mentioning, that the spatial clustering is a much more efficient method to reduce the computational time than the TSAMs, which agrees with other sources, like [8] (page 21). That is in case that the spatial distribution of the storage planning is not relevant for the research study.
The error of the clustering method itself ( Figure 5) is not sufficient to assess the error of the objective value ( Figure 6), as observed also in other studies, cf. [25] (p. 20) or [26] (p. 11). This makes it difficult to anticipate the best number of representative periods. Hence, there is no optimal temporal clustering method for all possible and addressed research questions. But for the special case of an energy system highly depending on wind energy or in general time series with rather non-regular pattern, we suggest the use of the chronological clustering. In this case, the number of representative periods can be identified by using the convergence of the optimal objective value as we increase the number of representative periods.
The results of this article can benefit model energy projects to choose a complex reduction technique for the optimization of an energy model. This is a crucial step in the optimization process, since some techniques would result in unacceptable errors or, as we highlighted here, in no computational time reduction at all. To put it concisely, we showed that the chronological clustering performs the best, when dealing with large storage planning energy network models with time linking constraints. This clarifies some discussions in previous publications by comparing the two most valued methods that keep track of the storage units state of charge. We also showed that, if the spatial distribution of storage is not necessary, the temporal clustering can be combined very efficiently with a spatial clustering. Funding: This research was funded by the open_eGo project, which was supported by the German Federal Ministry for Economic Affairs and Energy under the funding code: BMWi 0325881D.