共 45 条
Risk Limiting Dispatch in Congested Networks
被引:0
作者:
Rajagopal, Ram
[1
]
Tse, David
[2
]
Zhang, Baosen
[2
]
机构:
[1] Stanford Univ, Dept Civil & Environm Engn, Stanford Sustainable Syst Lab, Stanford, CA 94305 USA
[2] Univ Calif Berkeley, Dept EECS, Berkeley, CA 94720 USA
来源:
2012 50TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON)
|
2012年
关键词:
TRADING WIND GENERATION;
POWER;
D O I:
暂无
中图分类号:
TP [自动化技术、计算机技术];
学科分类号:
0812 ;
摘要:
Increased uncertainty due to high penetration of renewables imposes significant costs to the system operators. The added costs depend on several factors including market design, performance of renewable generation forecasting and the specific dispatch procedure. Quantifying these costs has been limited to small sample Monte Carlo approaches applied specific dispatch algorithms. The computational complexity and accuracy of these approaches has limited the understanding of tradeoffs between different factors. In this work we follow a different approach by considering a two-stage stochastic economic dispatch problem, where the optimal dispatch is called risk limiting dispatch. First we consider an uncongested network and derive the price of uncertainty, a number that characterizes the intrinsic impact of uncertainty on the integration cost of renewables. Then we extend the results to a two bus network where a transmission line may become congested. We demonstrate the existence of the price of uncertainty even in this case, under mild assumptions. We show that risk limiting dispatch is given by a set of deterministic equilibrium equations. The dispatch solution yields an important insight: congested links do not create isolated nodes, even in a two-node network. In fact, the network can support backflows in congested links, that are useful to reduce the uncertainty by averaging supply across the network.
引用
收藏
页码:1900 / 1907
页数:8
相关论文
共 45 条