具有无弹性要求和显性电力约束的在线需求反应的数值 (Online Algorithm for Demand Response with Inelastic Demands and Apparent Power Constraint)

from arxiv, An extended version of parts of this work appeared in the paper published under the title "A Competitive Scheduling Algorithm for Online Demand Response in Islanded Microgrids" in the IEEE Transactions on Power Systems journal

A classical problem in power systems is to allocate in-coming (elastic or inelastic) demands without violating the operating constraints of electric networks in an online fashion. Although online decision problems have been well-studied in the literature, a unique challenge arising in power systems is the presence of non-linear constraints, a departure from the traditional settings. A particular example is the capacity constraint of apparent power, which gives rise to a quadratic constraint, rather than typical linear constraints. In this paper, we present a competitive randomized online algorithm for deciding whether a sequence of inelastic demands can be allocated for the requested intervals, subject to the total satisfiable apparent power within a time-varying capacity constraint. We also consider an alternative setting with nodal voltage constraint, using a variant of the online algorithm. Finally, simulation studies are provided to evaluate the algorithms empirically.

翻译：电力系统的一个典型问题是,在不违反电网运行限制的情况下,以在线方式分配即时(弹性或无弹性)需求。虽然在线决策问题在文献中已经进行了充分研究,但电力系统出现的独特挑战是存在非线性限制,这与传统环境不同。一个特别的例子是表面力量的能力限制,这引起了二次限制,而不是典型的线性限制。在本文中,我们提出了一个竞争性随机化的在线算法,用以决定是否可以为所要求的间隔分配无弹性需求序列,但取决于在时间变换能力限制下完全可作对称的表面力量。我们还考虑使用在线算法的变式,设定一个具有交点电压限制的替代设置。最后,我们提供模拟研究,以便根据经验评估算法。