Divide and Conquer? ${k}$-Means Clustering of Demand Data Allows Rapid and Accurate Simulations of the British Electricity System

摘要

We use a $k$-means clustering algorithm to partition national electricity demand data for Great Britain and apply a novel profiling method to obtain a set of representative demand profiles for each year over the period 1994–2005. We then use a simulated dispatch model to assess the accuracy of these daily profiles against the complete dataset on a year-to-year basis. We find that the use of data partitioning does not compromise the accuracy of the simulations for most of the main variables considered, even when simulating significant intermittent wind generation. This technique yields 50-fold gains in terms of computational speed, allowing complex Monte Carlo simulations and sensitivity analyses to be performed with modest computing resource.