arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2205.14531cs.GT
收藏

配电网的公平划分算法

Fair Division Algorithms for Electricity Distribution

Dinesh Kumar Baghel, Vadim E. Levit, Erel Segal-Halevi

摘要:

在许多发展中国家,总的电力需求大于发电站有限的发电能力。许多国家采用常规减载的普遍做法-切断整个地区的电力供应-以保持供需平衡。削减电力负荷会令住户感到困难和不适,而这对那些在削减电力负荷期间对电力的需求比其他人高的住户来说,情况更糟,因此是不公平的。最近,Oluwasuji等人。[2020]提出了这个问题,并提出了几种启发式解决方案。在这项工作中,我们研究的电力分配问题作为一个问题的公平分工,模型使用相关文献切蛋糕的问题,并讨论了一些见解的时间间隔的部分分配给每个家庭。我们考虑四种情况:相同需求,统一效用;相同需求,可加效用;不同需求,统一效用;不同需求,可加效用。我们提供了解决方案的前两种情况下,并讨论了新的概念,q次装箱的其余情况。我们还展示了第四种情况是如何与共识k-划分问题。人们可以使用功利主义和平等主义的社会福利指标来研究目标和限制,以及试图保持尽可能少的削减数量。第二个目标可以是最小化代理之间的最大效用差异。

英文摘要:

In many developing countries, the total electricity demand is larger than the limited generation capacity of power stations. Many countries adopt the common practice of routine load shedding - disconnecting entire regions from the power supply - to maintain a balance between demand and supply. Load shedding results in inflicting hardship and discomfort on households, which is even worse and hence unfair to those whose need for electricity is higher than that of others during load shedding hours. Recently, Oluwasuji et al. [2020] presented this problem and suggested several heuristic solutions. In this work, we study the electricity distribution problem as a problem of fair division, model it using the related literature on cake-cutting problems, and discuss some insights on which parts of the time intervals are allocated to each household. We consider four cases: identical demand, uniform utilities; identical demand, additive utilities; different demand, uniform utilities; different demand, additive utilities. We provide the solution for the first two cases and discuss the novel concept of q-times bin packing in relation to the remaining cases. We also show how the fourth case is related to the consensus k-division problem. One can study objectives and constraints using utilitarian and egalitarian social welfare metrics, as well as trying to keep the number of cuts as small as possible. A secondary objective can be to minimize the maximum utility-difference between agents.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑