The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Clustering methods to find representative periods for the optimization of energy systems: An initial framework and comparison
Abstract
Modeling time-varying operations in complex energy systems optimization problems is often computationally intractable, and time-series input data are thus often aggregated to representative periods. In this work, we introduce a framework for using clustering methods for this purpose, and we compare both conventionally-used methods (k-means, k-medoids, and hierarchical clustering), and shape-based clustering methods (dynamic time warping barycenter averaging and k-shape). We compare these methods in the domain of the objective function of two example operational optimization problems: battery charge/discharge optimization and gas turbine scheduling, which exhibit characteristics of complex optimization problems. We show that centroid-based clustering methods represent the operational part of the optimization problem more predictably than medoid-based approaches but are biased in objective function estimate. On certain problems that exploit intra-daily variability, such as battery scheduling, we show that k-shape improves performance significantly over conventionally-used clustering methods. Comparing all locally-converged solutions of the clustering methods, we show that a better representation in terms of clustering measure is not necessarily better in terms of objective function value of the optimization problem.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Elements of Statistical Learning
Hastie, T., Tibshirani, R., & Friedman, J. (2009) · Springer Series in Statistics · doi:10.1007/978-0-387-84858-7 · Cited by 25,970
(2014) · Climate Change 2013 – The Physical Science Basis · doi:10.1017/cbo9781107415324.004 · Cited by 23,880
Hierarchical Grouping to Optimize an Objective Function
Ward, J. H. (1963) · Journal of the American Statistical Association · doi:10.1080/01621459.1963.10500845 · Cited by 20,598
Least squares quantization in PCM
Lloyd, S. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056489 · Cited by 15,836
(2007) · doi:10.5555/1283383.1283494 · Cited by 7,364
Dynamic Programming Algorithm Optimization for Spoken Word Recognition
Sakoe, H., & Chiba, S. (1978) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1978.1163055 · Cited by 6,727
A Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact Well-Separated Clusters
Dunn, J. C. (1973) · Journal of Cybernetics · doi:10.1080/01969727308546046 · Cited by 5,049
Time-series clustering – A decade review
Aghabozorgi, S., Seyed Shirkhorshidi, A., & Ying Wah, T. (2015) · Information Systems · doi:10.1016/j.is.2015.04.007 · Cited by 1,826 · cited 1×
“Other methods are popular in general time-series clustering but – to the best of our knowledge – have not been widely applied to find representative periods for energy systems optimization [22].”
MethodA global averaging method for dynamic time warping, with applications to clustering
Petitjean, F., Ketterlin, A., & Gançarski, P. (2011) · Pattern Recognition · doi:10.1016/j.patcog.2010.09.013 · Cited by 1,138
k-Shape: Efficient and Accurate Clustering of Time Series
Paparrizos, J., & Gravano, L. (2015) · Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data · doi:10.1145/2723372.2737793 · Cited by 680
Clustering of time-series subsequences is meaningless: implications for previous and future research
Keogh, E., & Lin, J. (2005) · Knowledge and Information Systems · doi:10.1007/s10115-004-0172-7 · Cited by 464
Impact of different time series aggregation methods on optimal energy system design
Kotzur, L., Markewitz, P., Robinius, M., & Stolten, D. (2018) · Renewable Energy · doi:10.1016/j.renene.2017.10.017 · Cited by 369
Pfenninger, S. (2017) · Applied Energy · doi:10.1016/j.apenergy.2017.03.051 · Cited by 367
Time series aggregation for energy system design: Modeling seasonal storage
Kotzur, L., Markewitz, P., Robinius, M., & Stolten, D. (2018) · Applied Energy · doi:10.1016/j.apenergy.2018.01.023 · Cited by 301
Carpe diem: A novel approach to select representative days for long-term power system modeling
Nahmmacher, P., Schmid, E., Hirth, L., & Knopf, B. (2016) · Energy · doi:10.1016/j.energy.2016.06.081 · Cited by 286
Integer Programming and the Theory of Grouping
Vinod, H. D. (1969) · Journal of the American Statistical Association · doi:10.1080/01621459.1969.10500990 · Cited by 245
Fazlollahi, S., Bungener, S. L., Mandel, P., Becker, G., & Maréchal, F. (2014) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2014.03.005 · Cited by 159
Heuberger, C. F., Staffell, I., Shah, N., & Dowell, N. M. (2017) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2017.05.012 · Cited by 152
Green, R., Staffell, I., & Vasilakos, N. V. (2014) · IEEE Transactions on Engineering Management · doi:10.1109/tem.2013.2284386 · Cited by 139
Time-series aggregation for synthesis problems by bounding error in the objective function
Bahl, B., Kümpel, A., Seele, H., Lampe, M., & Bardow, A. (2017) · Energy · doi:10.1016/j.energy.2017.06.082 · Cited by 89
An Efficient Robust Solution to the Two-Stage Stochastic Unit Commitment Problem
Blanco, I., & Morales, J. M. (2017) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2017.2683263 · Cited by 79
Bahl, B., Söhler, T., Hennen, M., & Bardow, A. (2018) · Frontiers in Energy Research · doi:10.3389/fenrg.2017.00035 · Cited by 60
Optimization of carbon-capture-enabled coal-gas-solar power generation
Brodrick, P. G., Kang, C. A., Brandt, A. R., & Durlofsky, L. J. (2014) · Energy · doi:10.1016/j.energy.2014.11.003 · Cited by 45
Self-citationOptimal design and operations of a flexible oxyfuel natural gas plant
Teichgraeber, H., Brodrick, P. G., & Brandt, A. R. (2017) · Energy · doi:10.1016/j.energy.2017.09.087 · Cited by 36
Self-citationBrodrick, P. G., Brandt, A. R., & Durlofsky, L. J. (2018) · Applied Energy · doi:10.1016/j.apenergy.2018.06.052 · Cited by 30
Self-citationSelecting and Evaluating Representative Days for Generation Expansion Planning
Almaimouni, A., Ademola-Idowu, A., Kutz, J. N., Negash, A. I., & Kirschen, D. S. (2018) · Power Systems Computation Conference · doi:10.23919/pscc.2018.8442580 · Cited by 21
Metadata
- Authors
- Teichgraeber, H., & Brandt, A. R.
- Venue
- Applied Energy
- Publisher
- Elsevier BV
- Published
- 2019-04
- Volume
- 239
- Pages
- 1283-1293
- ISSN
- 0306-2619 (ISSN-L)
- OpenAlex
- W2912829604
- Cited by
- 257
- References
- 26
- FWCI
- 9.52
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.