4.7 Article

Decentralized Coordination of a Community of Electricity Prosumers via Distributed MILP

期刊

IEEE TRANSACTIONS ON POWER SYSTEMS
卷 36, 期 6, 页码 5578-5589

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TPWRS.2021.3073039

关键词

Couplings; Optimization; Privacy; Peer-to-peer computing; Organizations; Matrix decomposition; Iterative methods; Community of prosumers; Decomposition methods; Distributed optimization; Mixed Integer Linear Programming (MILP); Receding Horizon

资金

  1. Enabling peer-to-peer energy trading by leveraging prosumer analytics [647.003.003]
  2. Netherlands Organization for Scientific Research (NWO)

向作者/读者索取更多资源

This study focuses on decentralized energy management of a community of prosumers, utilizing mixed-integer linear programming and dual decomposition methods. A receding horizon approach is proposed to divide and solve subproblems, ensuring feasibility under realistic conditions and reducing necessary constraint tightening. Evaluation includes different organizational structures with and without a coordinator, as well as various communication graph structures.
In this paper, the decentralized energy management of a community of prosumers is studied. The coordination of the prosumers participating in the community is cast as a mixed-integer linear program (MILP) with local and global coupling constraints. A dual decomposition method with a tightening of the coupling constraints is applied to solve the problem in a decentralized way. The resulting tightened problem provides feasibility guarantees for the obtained solutions. A receding horizon approach that exploits the structure of the problem is proposed to divide the problem in subproblems and solve them sequentially. The proposed approach ensures that the tightened problem is feasible under realistic conditions, whereas the existing methods may result in infeasible problems. Moreover, it may reduce the necessary constraint tightening compared to existing methods. Two setups are evaluated for the organizational structure of the community, one with a community coordinator and one without. Moreover, three different structures of the communication graph are analyzed for the setup without a coordinator. The simulation results demonstrate that the proposed method results in feasible problems that can be solved due to the reduced constraint tightening when other methods are not feasible. In the case of feasible problems, the optimality gap is comparable to that achieved with existing methods and even smaller for communities with a small number of participating prosumers.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据