Disaggregated bundle methods for distributed market clearing in power networks
Disaggregated bundle methods for distributed market clearing in power networks
复制标题
电力网络分布式市场清算的分类捆绑方法
DOI：
--
复制
发表时间：
2013
期刊：
影响因子：
--
通讯作者：
G. Giannakis
中科院分区：
文献类型：
--
作者：
Yu Zhang;Nikolaos Gatsis;G. Giannakis
提出了一种适用于大规模需求响应电力系统的快速分布式市场出清方法。除了传统的供应报价外，还纳入了来自聚合器的需求报价，该聚合器为大量具有不同能源约束的住宅智能电器提供服务。利用基于拉格朗日松弛的对偶分解，所得到的优化问题被分解成单独的子问题，然后由市场运营商和每个聚合器在最终用户智能电表的帮助下以分布式方式解决。采用分解束方法求解具有可分结构的对偶问题。与传统的双更新算法相比，该方法具有更快的收敛速度，从而减少了通信开销。数值结果证实了新方法的有效性。
A fast distributed approach is developed for the market clearing with large-scale demand response in electric power networks. In addition to conventional supply bids, demand offers from aggregators serving large numbers of residential smart appliances with different energy constraints are incorporated. Leveraging the Lagrangian relaxation based dual decomposition, the resulting optimization problem is decomposed into separate subproblems, and then solved in a distributed fashion by the market operator and each aggregator aided by the end-user smart meters. A disaggregated bundle method is adapted for solving the dual problem with a separable structure. Compared with the conventional dual update algorithms, the proposed approach exhibits faster convergence speed, which results in reduced communication overhead. Numerical results corroborate the effectiveness of the novel approach.