2017
DOI: 10.1049/iet-gtd.2016.1334
|View full text |Cite
|
Sign up to set email alerts
|

Redispatch index for assessing bidding zone delineation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
20
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
4
2

Relationship

2
4

Authors

Journals

citations
Cited by 8 publications
(21 citation statements)
references
References 16 publications
0
20
0
Order By: Relevance
“…Second, Marinho et al. show in [20] that zone delineations obtained with the Fuzzy C‐Means method are generally less efficient in terms of redispatching reduction than configurations obtained with K‐Means and Hierarchical clustering.…”
Section: Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…Second, Marinho et al. show in [20] that zone delineations obtained with the Fuzzy C‐Means method are generally less efficient in terms of redispatching reduction than configurations obtained with K‐Means and Hierarchical clustering.…”
Section: Methodsmentioning
confidence: 99%
“…In particular, Marinho et al. [20] show that the Hierarchical, K‐Means and Fuzzy C‐Means approaches can be enhanced by using a redispatch effort index to identify zone configurations that are most efficient regarding congestion management.…”
Section: Literature Reviewmentioning
confidence: 99%
See 1 more Smart Citation
“…Following the observations in [15], where hierarchical clustering outperforms other clustering techniques for the aggregation of the European transmission network, hierarchical clustering was applied to aggregate the network buses in a determined number of zones. In this bottom-up algorithm, each network bus starts as an isolated zone, and at each step, the indicator A, as defined in Equation (1), is assessed and two electrically connected zones are aggregated until all the network buses belong to the same zone or the algorithm reaches the stopping criterion, which can either be a pre-determined number of zones or a threshold for the minimum distance between clusters.…”
Section: Clusteringmentioning
confidence: 99%
“…In [15], we suggested using the sum of the squared euclidean distances to determine the distance between pairs of observations for each scenario s ∈ S as:…”
Section: Clusteringmentioning
confidence: 99%