2016
DOI: 10.3906/elk-1306-88
|View full text |Cite
|
Sign up to set email alerts
|

Stochastic congestion management considering power system uncertainties: a chance-constrained programming approach

Abstract: Considering system uncertainties in developing power systems, algorithms such as congestion management (CM) are vital in power system analysis and studies. This paper proposes a new model for power system CM by considering power system uncertainties based on chance-constrained programming (CCP). In the proposed approach, transmission constraints are taken into account by stochastic, instead of deterministic, models. The proposed approach considers network uncertainties with a specific level of probability in t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(4 citation statements)
references
References 20 publications
(40 reference statements)
0
4
0
Order By: Relevance
“…The SQG method was first introduced by Ermoliev in 1976 [49]. This method combines the Monte Carlo simulation (MCS) [50] and the recursive sampling algorithm, and was first used to solve non‐linear stochastic programming problems with continuous probability distributions. The main feature of this method, compared to other gradient mapping programming methods, is that both the objective function and its constraints can be non‐linear and non‐convex.…”
Section: Optimisation Algorithmmentioning
confidence: 99%
“…The SQG method was first introduced by Ermoliev in 1976 [49]. This method combines the Monte Carlo simulation (MCS) [50] and the recursive sampling algorithm, and was first used to solve non‐linear stochastic programming problems with continuous probability distributions. The main feature of this method, compared to other gradient mapping programming methods, is that both the objective function and its constraints can be non‐linear and non‐convex.…”
Section: Optimisation Algorithmmentioning
confidence: 99%
“…Esfahani and Yousefi proposed an algorithm to minimize the congestion clearing time for CM [11]. Hojjat et al in 2016 considered power system uncertainties and proposed a chance-constrained programming method for CM [12]. In another study, Sarwar and Siddiqui mitigated congestion taking into account the locational marginal pricing differences for the placement of distributed generations (DGs) in the most congested zones [13].…”
Section: Literature Surveymentioning
confidence: 99%
“…In the recent literature, stochastic TEP problem can be solved either robust optimization [6][7][8], two or multi-stage stochastic optimization [9][10][11][12][13] and chance constrained programming [4,5,[14][15][16][17][18][19]. In this study, we work with chance constraints under TEP optimization, which ensures the system constraints will be satisfied with a pre-specified probability.…”
Section: Introductionmentioning
confidence: 99%
“…In [15], a three-line overload risk index is considered under TEP optimization with load, wind, and N-1 contingency uncertainties, and the proposed formulation gives a comprehensive risk control model. In [16], an equivalent linear model for stochastic congestion management is proposed using chance constraints on transmission lines. In [17], the authors quantified the probabilistic load curtailment degree by a capped load curtailment probability, which is incorporated into the multi-stage TEP model.…”
Section: Introductionmentioning
confidence: 99%