A method of inclusion of security constraints with distributed optimal power flow

Kim, J.-H.; Park, J.-K.; Kim, B.H.; Park, J.-B.; Hur, Don

doi:10.1016/s0142-0615(00)00054-5

Cited by 15 publications

(10 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Unlike the NBNC and NBLC formulations, the base case variable x0 is a subcomponent of the the decision variable x 0 . To elaborate, in order to calculate solution1.txt, the reactive powers, shunt susceptances, and voltage magnitudes remain to be calculated even after having solved (10). Although setting these remaining variables to midpoints of their corresponding regions technically yields a feasible base case solution, it is desired to achieve a feasible base case point with minimal slack penalties.…”

Section: B Approximate Formulationsmentioning

confidence: 99%

“…[5], [6]. To further relieve the computational burden arising from contingency constraints, decomposition techniques such as Benders [7], [8], Lagrangian methods [9], [10], and consensus-based methods [11] are suggested in the literature. Prior methods struggle to solve the comprehensive SCOPF formulation (implemented in the industry software that is used by power grid operators) and often make simplifying assumptions to make the original problem tractable.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Computationally Efficient Solutions for Large-Scale Security-Constrained Optimal Power Flow

Bazrafshan¹,

Baker²,

Mohammadi³

2020

Preprint

View full text Add to dashboard Cite

In this paper, we discuss our approach and algorithmic framework for solving large-scale security constrained optimal power flow (SCOPF) problems. SCOPF is a mixed integer non-convex optimization problem that aims to obtain the minimum dispatch cost while maintaining the system N-1 secure. Finding a feasible solution for this problem over large networks is challenging and this paper presents contingency selection, approximation methods, and decomposition techniques to address this challenge in a short period of time. The performance of the proposed methods are verified through large-scale synthetic and actual power networks in the Grid Optimization (GO) competition organized by the U.S. Advanced Research Projects Agency-Energy (ARPA-E). As many prior works focus on smallscale systems and are not benchmarked using validated, publicly available datasets, we aim to present a practical solution to SCOPF that has been proven to achieve good performance on realistically sized (30,000 buses) networks.

show abstract

Section: B Approximate Formulationsmentioning

confidence: 99%

mentioning

confidence: 99%

Computationally Efficient Solutions for Large-Scale Security-Constrained Optimal Power Flow

Bazrafshan¹,

Baker²,

Mohammadi³

2020

Preprint

View full text Add to dashboard Cite

show abstract

“…To counter this problem, the line-outage of a tie-line is modeled as a generator outage. The use of generation outages to model tie-line outages is performed also in [43]; however, there they are not used to calculate the safe transmission capacity, but rather to explicitly model the effect of the tie-line outage. The import of energy across the tie-line acts similar to a local generator; losing it will necessitate the increase of local generation to re-establish power balance, or the redistribution of tie-line flows.…”

Section: Formulationmentioning

confidence: 99%

A unified analysis of security-constrained OPF formulations considering uncertainty, risk, and controllability in single and multi-area systems

Vrakopoulou

Chatzivasileiadis

Iggland

et al. 2013

2013 IREP Symposium Bulk Power System Dynamics and Control - IX Optimization, Security and Control of the Emerging Power Grid

View full text Add to dashboard Cite

This paper presents a variety of different Security Constrained Optimal Power Flow formulations addressing four power system operation and planning problems: (a) forecast uncertainty of Renewable Energy Sources (RES) in-feed and load, (b) security criteria based on contingency risk, (c) corrective control offered through High Voltage Direct Current (HVDC) lines and flexible demand, (d) operation of multi-area systems with limited data exchange. A comprehensive probabilistic Security Constrained Optimal Power Flow (SCOPF) framework based on scenario-based methodologies is presented. This approach provides a-priori guarantees regarding the probability of the constraint satisfaction. In this paper, we show how HVDC lines, flexible demand, and novel risk-based operational paradigms can be used to handle outage uncertainty and the fluctuating in-feed from RES. Our analysis is extended by introducing a distributed probabilistic SCOPF algorithm for multi-area systems involving different levels of data exchange. The applicability of the methods is demonstrated on the threearea Reliability Test System (RTS-96). Results are compared based on operating costs and maximum wind power penetration.

show abstract

“…As técnicas de decomposição matemáticas em que o problema de FP multi-áreas é resolvido possuem poucas referências na literatura especializada. A maioria delas são aplicadas ao problema de fluxo de potência ótimo (Bakirtzis e Biskas, 2003;Biskas e Bakirtzis, 2006;Conejo e Aguado, 1998;Granada et al, 2008;Kim e Baldick, 1997;Kim et al, 2001;Nogales et al, 2003) . Em Bakirtzis e Biskas (2002) é apresentado um FP-DC descentralizado usando o princípio do problema auxiliar (PPA), no qual um dos objetivos é preservar a confidencialidade dos dados de rede para cada ORS em um mercado de livre concorrência.…”

Section: Revisão Da Literaturaunclassified

Fluxo de potência AC para operação independente de áreas interligadas

Echeverri¹,

Rider²,

Mantovani³

2011

Sba Controle & Automação

View full text Add to dashboard Cite

Neste artigo utiliza-se um método de decomposição matemática para resolver um problema de fluxo de carga AC em sistemas de potência compostos de áreas interligadas e administradas por diferentes operadores regionais do sistema elétrico (ORS). A estratégia proposta permite encontrar o ponto de operação de uma determinada área sem conhecer explicitamente os dados da rede das outras áreas interligadas, sendo necessária apenas a troca de informações de fronteira associadas às linhas de interligação. A metodologia baseia-se na decomposição das condições de otimalidade de primeira ordem do fluxo de potência AC que, por sua vez, é formulado como um problema de programação não-linear. Para visualizar melhor o conceito de operação independente de cada ORS, usou-se uma rede neural artificial para simular os cálculos das variáveis de fronteira dos ORS interligados. Um fluxo de carga multi-áreas pode ser visto como uma ferramenta básica que pode ser usada no âmbito de mercados competitivos multi-agentes. O sistema de teste IEEE RTS-96 é utilizado para demonstrar o funcionamento e a eficácia do fluxo de potência AC multi-áreas.

show abstract

A method of inclusion of security constraints with distributed optimal power flow

Cited by 15 publications

References 14 publications

Computationally Efficient Solutions for Large-Scale Security-Constrained Optimal Power Flow

Computationally Efficient Solutions for Large-Scale Security-Constrained Optimal Power Flow

A unified analysis of security-constrained OPF formulations considering uncertainty, risk, and controllability in single and multi-area systems

Fluxo de potência AC para operação independente de áreas interligadas

Contact Info

Product

Resources

About