Submodularity of energy storage placement in power networks
Submodularity of energy storage placement in power networks
复制标题
电力网络中储能布局的子模块性
DOI：
--
复制
发表时间：
2016
期刊：
影响因子：
--
通讯作者：
R. Rajagopal
中科院分区：
文献类型：
--
作者：
Junjie Qin;Insoon Yang;R. Rajagopal
本文研究了电网中储能装置的最优配置问题。我们明确建模存储设备的资本和安装成本，因为这些固定成本占大多数网格规模存储项目的最大成本组成部分。由于（i）这种放置问题的离散性质，以及（ii）经由传输线路和分布式能量存储资源的能量的空间和时间转移，找到最佳放置策略是一项具有挑战性的任务。为了开发一个有效的布局框架与性能保证，我们调查的最优值函数的结构特性的多周期经济调度问题的存储动态，最优存储控制和位置的边际价格的分析表征。特别是，我们提供了一个紧条件下的最佳布局值函数是次模和一个有效的计算方法来证明的条件。当该条件成立时，用于最大化受背包约束的子模函数的修改后的贪婪算法提供了（1 - 1/e）最优解。
This paper studies the problem of optimally placing energy storage devices in power networks. We explicitly model capital and installation costs of storage devices because these fixed costs account for the largest cost component in most grid-scale storage projects. Finding an optimal placement strategy is a challenging task due to (i) the discrete nature of such placement problems, and (ii) the spatial and temporal transfer of energy via transmission lines and distributed energy storage resources. To develop an efficient placement framework with performance guarantees, we investigate the structural properties of the optimal value function for the multi-period economic dispatch problem with storage dynamics, and an analytical characterization of optimal storage controls and locational marginal prices. In particular, we provide a tight condition under which the optimal placement value function is submodular and an efficient computational method to certify the condition. When this condition is valid, a modified greedy algorithm for maximizing a submodular function subject to a knapsack constraint provides a (1 - 1/e)-optimal solution.