Online Algorithm for Demand Response with Inelastic Demands and Apparent Power Constraint
Abstract
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.
Cite
@article{arxiv.1611.00559,
title = {Online Algorithm for Demand Response with Inelastic Demands and Apparent Power Constraint},
author = {Areg Karapetyan and Majid Khonji and Chi-Kin Chau and Khaled Elbassioni},
journal= {arXiv preprint arXiv:1611.00559},
year = {2021}
}
Comments
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