Simon H. Tindemans
Please Note
109 records found
1
Congestion management in the day-ahead timeframe
Lessons from The Netherlands
To optimize the dispatch of batteries, a model is required that can predict the state of energy (SOE) trajectory for a chosen open-loop power schedule to ensure admissibility (i.e., that schedule can be realized). However, battery dispatch optimization is inherently challenging when batteries cannot simultaneously charge and discharge, which begets a non-convex complementarity constraint. In this letter, we develop a novel composition of energy storage elements that can charge or discharge independently and provide a sufficient linear energy storage model of the composite battery. This permits convex optimization of the composite battery dispatch while ensuring the admissibility of the resulting (aggregated) power schedule and its disaggregation to the individual elements.
EnergySHR
A platform for energy dataset sharing and communications
Aggregate Peak EV Charging Demand
The Influence of Segmented Network Tariffs
Aggregate peak Electric Vehicle (EV) charging demand is a matter of growing concern for network operators as it severely limits the network's capacity, preventing its reliable operation. Various tariff schemes have been proposed to limit peak demand by incentivizing flexible asset users to shift their demand from peak periods. However, fewer studies quantify the effect of these tariff schemes on the aggregate level. In this paper, we compare the effect of a multi-level segmented network tariff with and without dynamic energy prices for individual EV users on the aggregate peak demand. Results based on real charging transactions from over 1200 public charging points in the Netherlands show that the segmented network tariff with flat energy prices results in more diverse load profiles with increasing aggregation, as compared to cost-optimized dispatch based on only dynamic day-ahead energy prices. When paired with dynamic energy prices, the segmented tariff still outperforms only dynamic energy price-based tariffs in reducing peaks. Results show that a balance between power thresholds and price per threshold is crucial in designing a suitable tariff, taking into account the needs of the power network. We also provide valuable insights to network operators by calculating the diversity factor for various peak demands per charging point.
Smart charging of electric vehicles can alleviate grid congestion and reduce charging costs. However, various electric vehicle models currently lack the technical capabilities to effectively implement smart charging since they cannot handle charging pauses or delays. These models enter sleep mode when charging is interrupted, preventing resumption afterwards. To avoid this, they should be continuously charged with their minimum charging power, even when a charging pause would be desirable, for instance with high electricity prices. This research examines this problem to inform various stakeholders, including policymakers and manufacturers, and stimulates the adoption of proactive measures that address this problem. Here, we demonstrate through technical charging tests that around one-third of tested car models suffer from this issue. Through model simulations we indicate that eliminating paused and delayed charging problems would double the smart charging potential for all applications. Lastly, we propose concrete legal and practical solutions to eliminate these problems.
Probabilistic modelling of power systems operation and planning processes depends on data-driven methods, which require sufficiently large datasets. When historical data lacks this, it is desired to model the underlying data generation mechanism as a probability distribution to assess the data quality and generate more data, if needed. Kernel density estimation (KDE) based models are popular choices for this task, but they fail to adapt to data regions with varying densities. In this paper, an adaptive KDE model is employed to circumvent this, where each kernel in the model has an individual bandwidth. The leave-one-out maximum log-likelihood (LOO-MLL) criterion is proposed to prevent the singular solutions that the regular MLL criterion gives rise to, and it is proven that LOO-MLL prevents these. Relying on this guaranteed robustness, the model is extended by adjustable weights for the kernels. In addition, a modified expectation–maximization algorithm is employed to accelerate the optimization speed reliably. The performance of the proposed method and models are exhibited on two power systems datasets using different statistical tests and by comparison with Gaussian mixture models. Results show that the proposed models have promising performance, in addition to their singularity prevention guarantees.
Anomaly detection is of considerable significance in engineering applications, such as the monitoring and control of large-scale energy systems. This article investigates the ability to accurately detect and localize the source of anomalies, using an autoencoder neural network-based detector. Correlations between residuals are identified as a source of misclassifications, and whitening transformations that decorrelate input features and/or residuals are analyzed as a potential solution. For two use cases, regarding spatially distributed wind power generation and temporal profiles of electricity consumption, the performance of various data processing combinations was quantified. Whitening of the input data was found to be most beneficial for accurate detection, with a slight benefit for the combined whitening of inputs and residuals. For localization of anomalies, whitening of residuals was preferred, and the best performance was obtained using standardization of the input data and whitening of the residuals using the zero-phase component analysis (ZCA) or zero-phase component analysis-correlation (ZCA-cor) whitening matrix with a small additional offset.
Electric demand and renewable power are highly variable, and the solution of a planning model relies on capturing this variability. This paper proposes a hybrid multi-area method that effectively captures both the intraday and interday chronology of real data considering extreme values, using a limited number of representative days, and time points within each day. An optimization-based representative extraction method is proposed to improve intraday chronology capturing. It ensures higher precision in preserving data chronology and extreme values than hierarchical clustering methods. The proposed method is based on a piecewise linear demand and supply representation, which reduces approximation errors compared to the traditional piecewise constant formulation. Additionally, sequentially linked day blocks with identical representatives, created through a mapping process, are employed for interday chronology capturing. To evaluate the efficiency of the proposed method, a comprehensive expansion co-planning model is developed, including transmission lines, energy storage systems, and wind farms.
Quantitative risk analysis is essential for power system planning and operation. Monte Carlo methods are frequently employed for this purpose, but their inherent sampling uncertainty means that accurate estimation of this uncertainty is essential. Basic Monte Carlo procedures are unbiased and, in the limit of large sample counts, have a well-characterised error distribution. However, for small time budgets and ill-behaved distributions (such as those for rare event risks), we may not always operate in this limit. Moreover, multilevel Monte Carlo was recently proposed as a computationally efficient alternative to regular Monte Carlo. In this approach, great asymptotic speedups are achieved by reducing the number of full model evaluations. This further challenges the assumption that normally distributed errors can be used. This paper investigates the sampling error distributions for a practical resource adequacy case study, in combination with the Multilevel Monte Carlo method. It further proposes a practical test for validating error estimates, based on a bootstrap approach.