arrow
返回

Linear optimal power flow using cycle flows

delete2018-05-01
delete62
delete
OA
AI
J
Jonas Hörsch
H
Henrik Ronellenfitsch
D
Dirk Witthaut
T
Tom Brown *
DOI:10.1016/j.epsr.2017.12.034delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Linear optimal power flow (LOPF) algorithms use a linearization of the alternating current (AC) load flow equations to optimize generator dispatch in a network subject to the loading constraints of the network branches. Common algorithms use the voltage angles at the buses as optimization variables, but alternatives can be computationally advantageous. In this article we provide a review of existing methods and describe a new formulation that expresses the loading constraints directly in terms of the flows themselves, using a decomposition of the network graph into a spanning tree and closed cycles. We provide a comprehensive study of the computational performance of the various formulations, in settings that include computationally challenging applications such as multi-period LOPF with storage dispatch and generation capacity expansion. We show that the new formulation of the LOPF solves up to 7 times faster than the angle formulation using a commercial linear programming solver, while another existing cycle-base formulation solves up to 20 times faster, with an average speed-up of factor 3 for the standard networks considered here. If generation capacities are also optimized, the average speed-up rises to a factor of 12, reaching up to factor 213 in a particular instance. The speed-up is largest for networks with many buses and decentral generators throughout the network, which is highly relevant given the rise of distributed renewable generation and the computational challenge of operation and planning in such networks. (C) 2018 Elsevier B.V. All rights reserved.
Keyword:
Linear optimal power flow
DC power flow
Dual network
Graph theory
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Electric Power Systems Research 封面图
Electric Power Systems Research
IF:
4.2
论文数:
1.2W
被引数:
2.2W

机构

R
research center julich
学者数:
9.9K
论文数: 6.7K
被引数: 10
U
university of pennsylvania
学者数:
9.2W
论文数: 7.8W
被引数: 153
H
Helmholtz Association
学者数:
13.2W
论文数: 10.7W
被引数: 145
学者 查看更多机构
引用论文

引用论文

Blinded Independent Central Review of the Progression-Free Survival Endpoint
err2010-04-11
err0
errOAAI
errOhad Amit; Will Bushnell; Lori Dodd; Nancy Roach; Daniel Sargent
err分享
err收藏
err分享
err收藏
学者 查看更多内容