Renewable sources are increasing their presence in power systems to achieve the goal of decarbonizing the generation of electricity. However, the variability of these resources introduces high uncertainty in the operation of a power system and, hence, fast generating and storage units must be incorporated in the system. To obtain economically and technically efficient solutions in the capacity expansion problem, an adequate representation of the variability of the renewable resource is crucial, but this may increase the size of the problem up to computational intractability. The most suitable representation is often selected through clustering techniques. The clustering algorithms proposed in the literature suffer from a significant trade-off between their ability to capture the inter-temporal correlation of the clustered elements and the representativeness of the clusters when only very few are needed. This paper proposes an innovative clustering technique that overcomes this trade-off. A case study based on the European power system is solved. The outcomes given by the new clustering algorithm and other well-known techniques are investigated through in-sample and out-of-sample analyses applied to multiple cases that differ in to the number of clusters and the minimum renewable production.
(2021). Multi-chronological hierarchical clustering to solve capacity expansion problems with renewable sources [journal article - articolo]. In ENERGY. Retrieved from http://hdl.handle.net/10446/185928
Multi-chronological hierarchical clustering to solve capacity expansion problems with renewable sources
Dominguez Martin, Maria Ruth;Vitali, Sebastiano
2021-01-01
Abstract
Renewable sources are increasing their presence in power systems to achieve the goal of decarbonizing the generation of electricity. However, the variability of these resources introduces high uncertainty in the operation of a power system and, hence, fast generating and storage units must be incorporated in the system. To obtain economically and technically efficient solutions in the capacity expansion problem, an adequate representation of the variability of the renewable resource is crucial, but this may increase the size of the problem up to computational intractability. The most suitable representation is often selected through clustering techniques. The clustering algorithms proposed in the literature suffer from a significant trade-off between their ability to capture the inter-temporal correlation of the clustered elements and the representativeness of the clusters when only very few are needed. This paper proposes an innovative clustering technique that overcomes this trade-off. A case study based on the European power system is solved. The outcomes given by the new clustering algorithm and other well-known techniques are investigated through in-sample and out-of-sample analyses applied to multiple cases that differ in to the number of clusters and the minimum renewable production.File | Dimensione del file | Formato | |
---|---|---|---|
1-s2.0-S0360544221007404-mainFINALE_FINALE.pdf
Solo gestori di archivio
Versione:
publisher's version - versione editoriale
Licenza:
Licenza default Aisberg
Dimensione del file
1.83 MB
Formato
Adobe PDF
|
1.83 MB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
Aisberg ©2008 Servizi bibliotecari, Università degli studi di Bergamo | Terms of use/Condizioni di utilizzo