Convex inner approximation of the feeder hosting capacity limits on dispatchable demand
Convex inner approximation of the feeder hosting capacity limits on dispatchable demand
复制标题
可调度需求的支线承载能力限制的凸内近似
DOI：
--
复制
发表时间：
2019
期刊：
影响因子：
--
通讯作者：
M. Almassalkhi
中科院分区：
文献类型：
--
作者：
Nawaf Nazir;M. Almassalkhi
为了提高配电网最优潮流（OPF）模型的可行性，提出了一种求凸内逼近的方法。对于电阻式配电网，实际功率和无功功率对节点电压都有影响，因此在制定OPF问题时必须同时考虑两者。线性化OPF模型的不准确性可能导致在大规模调度灵活需求时出现欠压和过压，以响应批发市场或电网条件。为了保证可调度资源的可行性，本文根据可调度资源的实功率和无功能力，得到了可调度资源运行的内凸集，保证了网络电压的可行性。在标准的IEEE配电测试网络上进行了测试仿真，验证了该方法的有效性。
This paper presents a method to obtain a convex inner approximation that aims to improve the feasibility of optimal power flow (OPF) models in distribution feeders. For a resistive distribution network, both real and reactive power effect the node voltages and this makes it necessary to consider both when formulating the OPF problem. Inaccuracy in linearized OPF models may lead to under and over voltages when dispatching flexible demand, at scale, in response to whole-sale market or grid conditions. In order to guarantee feasibility, this paper obtains an inner convex set in which the dispatchable resources can operate, based on their real and reactive power capabilities, that guarantees network voltages to be feasible. Test simulations are conducted on a standard IEEE distribution test network to validate the approach.