摘要
In this paper, we propose a parallel dual dynamic programming (PDDP)-based decentralized algorithm for the multi-area optimal power flow (MAOPF), which can preserve the information privacy and operational independence of each area. The MAOPF problem is decomposed into a series of subproblems for individual areas by the dual dynamic programming (DDP) algorithm, and the Benders cut-based value functions are used to reflect the impacts of one area's decisions to the subsequent areas. The optimal solution of MAOPF can be obtained in a decentralized fashion, requiring only a limited amount of information exchange among neighbor areas. Moreover, a parallel processing technique is designed to avoid the waiting process of the basic DDP algorithm, thus accelerating the computing speed of the proposed decentralized algorithm. Compared with the existing decentralized algorithms, the proposed algorithm has better performance in terms of convergence and computational efficiency. In addition, there is no need for parameter tuning. Case studies on several IEEE test systems and a real 2298-bus system demonstrate the effectiveness of the proposed algorithm.
学科与关键词
- An Improved Dynamic Programming-Based Decentralized Algorithm for AC-OPF of Radially Connected Multi-Level NetworksChen, Jiajun; Zhu, Jianquan*; Ye, Hanfang; Wang, Zeshuang; Zeng, Kai; Liu, Haixin; Liu, MingboIEEE Transactions on Power Systems, 2023, 38(2): 1460-1473.
- Increment-Exchange-Based Decentralized Multiobjective Optimal Power Flow for Active Distribution GridsLu, Wentian; Liu, Mingbo*; Liu, QingkaiIEEE Systems Journal, 2020, 14(3): 3695-3704.被引 10
- Quadratic Taylor Expansion-Based Approximate Dynamic Programming for Fully Decentralized AC-OPF of Multi-Area Power SystemsYe, Hanfang; Zhu, Jianquan*; Chen, Jiajun; Wang, Zeshuang; Zhuo, Yelin; Liu, Haixin; Liu, MingboIEEE Transactions on Power Systems, 2023, 38(5): 4940-4949.
