arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1709.07480cs.CCcs.AI
收藏

智能电网中充电调度的复杂性

Complexity of Scheduling Charging in the Smart Grid

Delft University of Technology(代尔夫特理工大学);Duke University(杜克大学)

Mathijs de Weerdt, Michael Albert, Vincent Conitzer

AI总结:

本文研究智能电网中电动汽车充电调度问题的计算复杂性,通过动态规划证明约20种变体属于P类或弱NP难,约10种变体为强NP难,揭示了规模化应用的障碍。

摘要:

在智能电网中,其意图是利用需求侧的灵活性,既用于平衡需求与供应,也用于解决潜在的拥塞问题。这种灵活需求的一个首要典型例子是电动汽车的充电,电动汽车并不一定需要在插电后立即充电。在电力基础设施约束下,对电动汽车充电需求进行最优调度的问题被称为充电调度问题。充电速度、时间范围和充电需求的模型决定了充电调度问题的计算复杂性。对于大约20种变体,我们使用动态规划方法证明该问题要么属于P类,要么是弱NP难的。我们还证明了大约10种变体是强NP难的,这对其在实际规模化场景中的应用构成了潜在的重大障碍。

英文摘要:

In the smart grid, the intent is to use flexibility in demand, both to balance demand and supply as well as to resolve potential congestion. A first prominent example of such flexible demand is the charging of electric vehicles, which do not necessarily need to be charged as soon as they are plugged in. The problem of optimally scheduling the charging demand of electric vehicles within the constraints of the electricity infrastructure is called the charge scheduling problem. The models of the charging speed, horizon, and charging demand determine the computational complexity of the charge scheduling problem. For about 20 variants, we show, using a dynamic programming approach, that the problem is either in P or weakly NP-hard. We also show that about 10 variants of the problem are strongly NP-hard, presenting a potentially significant obstacle to their use in practical situations of scale.

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

↑