2018
DOI: 10.1109/tpwrs.2018.2842093
|View full text |Cite
|
Sign up to set email alerts
|

Chronological Time-Period Clustering for Optimal Capacity Expansion Planning With Storage

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
70
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
8
1

Relationship

1
8

Authors

Journals

citations
Cited by 130 publications
(88 citation statements)
references
References 34 publications
0
70
0
Order By: Relevance
“…Moreover, they compared the results of this approach to those of a perfect foresight approach for the fully resolved time horizon and a model-predictive control and proved the superiority of the approach, as it preserved the chronology of time steps. This was also pointed out in comparison to a typical periods approach by Pineda et al [72], who used the centroid-based hierarchical Ward's algorithm [73] with the side condition to only merge adjacent time steps. Bahl et al [74], meanwhile, introduced a similar algorithm as Fazlollahi et al [69] inspired by Lloyd's algorithm and the partitioning around medoids algorithm [75,76] with multiple initializations.…”
Section: Segmentationmentioning
confidence: 85%
“…Moreover, they compared the results of this approach to those of a perfect foresight approach for the fully resolved time horizon and a model-predictive control and proved the superiority of the approach, as it preserved the chronology of time steps. This was also pointed out in comparison to a typical periods approach by Pineda et al [72], who used the centroid-based hierarchical Ward's algorithm [73] with the side condition to only merge adjacent time steps. Bahl et al [74], meanwhile, introduced a similar algorithm as Fazlollahi et al [69] inspired by Lloyd's algorithm and the partitioning around medoids algorithm [75,76] with multiple initializations.…”
Section: Segmentationmentioning
confidence: 85%
“…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 a worst approximation of the wind generation, cf. [2]. The chronological clustering uses the same principle as the hierarchical clustering with the additional condition to cluster only consecutive hours of the original time series {x t } t=1,...,8760 , [2].…”
Section: B Clusteringmentioning
confidence: 99%
“…[2]. The chronological clustering uses the same principle as the hierarchical clustering with the additional condition to cluster only consecutive hours of the original time series {x t } t=1,...,8760 , [2].…”
Section: B Clusteringmentioning
confidence: 99%
“…+ ⇒ Scenario generation and reduction has been a topic of great interest in the power systems literature. Most existing methods use clustering [19,[22][23][24] or sampling methods to reduce the number of scenarios from a randomly generated initial set. In a recent review article, Park et al [25] compared four methods for scenario reduction using a two-stage stochastic transmission planning model, including random sampling, importance sampling [26], the distance-based method [17,27,28], iterative scenario reduction approaches, and stratified scenario sampling [25].…”
Section: Stochastic Transmission Planningmentioning
confidence: 99%