.png){kind=icon}
返回
Interior point methods for power flow optimization with security constraints
.png){kind=icon}
PRE
AI
DOI：10.1111/itor.12279.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper deals with power flow optimization with security constraints, focusing on the problem of short-term hydroelectric scheduling, called predispatch. Since the energy demand varies throughout the day, the generation must satisfy daily targets, established by long-term scheduling models. This study considers that the hydroelectric plants and transmission systems must provide an optimal flow of energy under security constraints that allow meeting energy demands for normal operating conditions and when disturbances happen. Algebraic techniques are used to exploit the sparse structure of the problem, targeting the design of an interior point algorithm, efficient in terms of robustness and computational time. Case studies compare the proposed approach with a general purpose optimization solver for quadratic problems and an algorithm for the predispatch problem that does not consider security constraints. The results show the benefits of using the method proposed in the paper, obtaining optimal power flow that is suitable to consider contingencies, with numerical stability and appropriate computational time.
Keyword:
optimal power flows
security constraints
predispatch problem
convex cost flow
interior point methods
power systems
期刊
IF:
2.9
论文数:
1.8K
被引数:
3.7K
机构
引用论文
1,1-Ethylene-1H-azulenium ion and its alkyl substituted derivatives: Synthesis, characterization, and some reactions thereof.png)
Tetrahedron
TetrahedronIF0
PREAI
分享收藏(Re)Conceptualising Unfree Labour: Local Labour Control Regimes and Constraints on Workers' Freedoms
OAAI
OAAI分享收藏Early Detection and Optimal Corrective Measures of Power System Insecurity in Enhanced Look-Ahead Dispatch增强型前瞻调度中电力系统不安全的早期发现与最优纠正措施
PREAI
分享收藏
查看更多内容